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 At Foundations of Software Science and Computation Structures, FOSSACS 2001.. , pp. 104-120.

Download

[img] PDF jNetsFOSSACSoff.pdf - Other
Download (204kB)

Description/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, $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)
Venue - Dates: Foundations of Software Science and Computation Structures, FOSSACS 2001., 2001-01-01
Keywords: join-calculus, petri nets, foundations of distributed systems
Organisations: Web & Internet Science
ePrint ID: 262283
Date :
Date Event
2001Published
Date Deposited: 11 Apr 2006
Last Modified: 17 Apr 2017 21:44
Further Information:Google Scholar
URI: http://eprints.soton.ac.uk/id/eprint/262283

Actions (login required)

View Item View Item