High-Level Petri Nets as Type Theories in the Join Calculus
Buscemi, M. and Sassone, V. (2001) High-Level Petri Nets as Type Theories in the Join Calculus. In, Foundations of Software Science and Computation Structures, FOSSACS 2001. Springer, 104-120.
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, $PN_i$, introduce a hierarchy of type systems of decreasing strictness, $Type_i$, $i=0,\ldots,3$, and we prove that a join process is typeable according to $Type_i$ if and only if it is (strictly equivalent to) a net of class $PN_i$. In the details, $PN_0$ and $PN_1$ contain, resp., usual place/transition and coloured Petri nets, while $PN_2$ and $PN_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:||Conference or Workshop Item (Paper)|
|Keywords:||join-calculus, petri nets, foundations of distributed systems|
|Divisions:||Faculty of Physical and Applied Science > Electronics and Computer Science > Web & Internet Science
|Date Deposited:||11 Apr 2006|
|Last Modified:||02 Mar 2012 11:58|
|Contributors:||Buscemi, M. (Author)
Sassone, V. (Author)
|Further Information:||Google Scholar|
|RDF:||RDF+N-Triples, RDF+N3, RDF+XML, Browse.|
Actions (login required)