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.


[img] PDF
Download (200Kb)


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)
ISBNs: 3540418644
Keywords: join-calculus, petri nets, foundations of distributed systems
Divisions : Faculty of Physical Sciences and Engineering > Electronics and Computer Science > Web & Internet Science
ePrint ID: 262283
Accepted Date and Publication Date:
Date Deposited: 11 Apr 2006
Last Modified: 31 Mar 2016 14:05
Further Information:Google Scholar
URI: http://eprints.soton.ac.uk/id/eprint/262283

Actions (login required)

View Item View Item

Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.

View more statistics