High-Level Petri Nets as Type Theories in the Join Calculus

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.

• Type: Conference
• Year: 2001
• Where: FOSSACS
• Authors: Maria Grazia Buscemi, Vladimiro Sassone
• Keywords: Dynamic Petri Nets, FOSSACS 2001, Join Calculus, Petri Nets, Software Engineering