eprintid: 134
rev_number: 6
eprint_status: archive
userid: 29
dir: disk0/00/00/01/34
datestamp: 2011-03-01 11:14:20
lastmod: 2011-07-11 14:33:43
status_changed: 2011-03-01 11:14:20
type: book_section
metadata_visibility: show
item_issues_count: 0
creators_name: Buscemi, Maria Grazia
creators_name: Sassone, Vladimiro
creators_id: m.buscemi@imtlucca.it
creators_id: 
title: High-Level Petri Nets as Type Theories in the Join Calculus
ispublished: pub
subjects: QA75
divisions: CSA
full_text_status: none
note: The final publication is available at www.springerlink.com
abstract: We study the expressiveness of the join calculus by comparison with (generalised, coloured) Petri nets and using tools from type theory. More precisely, we consider four classes of nets of increasing expressiveness, ∏  i , introduce a hierarchy of type systems of decreasing strictness, Δ i , i = 0,..., 3, and we prove that a join process is typeable according to Δ i  if and only if it is (strictly equivalent to) a net of class ∏  i . In the details, ∏  0  and ∏ 1 contain, resp., usual place/transition and coloured Petri nets, while ∏ 2 and ∏ 3 propose two natural notions of high-level net accounting for dynamic reconfiguration and process creation and called reconfigurable and dynamic Petri nets, respectively.

date: 2001
date_type: published
series: Lecture Notes in Computer Science
volume: 2030
publisher: Springer
pagerange: 104-120
id_number: 10.1007/3-540-45315-6_7
refereed: TRUE
isbn: 3-540-41864-4
book_title: Proceedings of Foundations of Software Science and Computation Structure (FoSSaCS ’01)
editors_name: Honsell, Furio
editors_name: Miculan, Marino
official_url: http://dx.doi.org/10.1007/3-540-45315-6_7
funders: Supported by MURST project TOSCA. The authors wish to thank BRICS, Basic Research in Computer Science and project MIMOSA, INRIA Sophia Antipolis.
citation:   Buscemi, Maria Grazia and Sassone, Vladimiro  High-Level Petri Nets as Type Theories in the Join Calculus.   In:  Proceedings of Foundations of Software Science and Computation Structure (FoSSaCS ’01).   Lecture Notes in Computer Science, 2030 .  Springer, pp. 104-120.  ISBN 3-540-41864-4      (2001)