TY  - CHAP
M1  - 2030
N2  - 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.

SN  - 3-540-41864-4
UR  - http://dx.doi.org/10.1007/3-540-45315-6_7
TI  - High-Level Petri Nets as Type Theories in the Join Calculus
AV  - none
EP  - 120
T2  - Proceedings of Foundations of Software Science and Computation Structure (FoSSaCS ?01)
N1  - The final publication is available at www.springerlink.com
ID  - eprints134
SP  - 104
T3  - Lecture Notes in Computer Science
A1  - Buscemi, Maria Grazia
A1  - Sassone, Vladimiro
PB  - Springer
Y1  - 2001///
ED  - Honsell, Furio
ED  - Miculan, Marino
ER  -