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)Full text not available from this repository.
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.
|Item Type:||Book Section|
|Additional Information:||The final publication is available at www.springerlink.com|
|Funders:||Supported by MURST project TOSCA. The authors wish to thank BRICS, Basic Research in Computer Science and project MIMOSA, INRIA Sophia Antipolis.|
|Subjects:||Q Science > QA Mathematics > QA75 Electronic computers. Computer science|
|Research Area:||Computer Science and Applications|
|Depositing User:||Users 29 not found.|
|Date Deposited:||01 Mar 2011 11:14|
|Last Modified:||11 Jul 2011 14:33|
Actions (login required)