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.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
A. Asperti and N. Busi (1996), Mobile Petri Nets, Technical Report UBLCS 96-10, Università di Bologna.
G. Berry and G. Boudol (1992), The Chemical Abstract Machine, Theoretical Computer Science, 96:217–248.
M. Boreale, C. Fournet, and C. Laneve (1998), Bisimulations for the Join-Calculus, In Proc. PROCOMET’98, D. Gries and W.P. de Roever (Eds.), 68–86, IFIP, Chapman & Halls.
R. Bruni, J. Meseguer, U. Montanari, and V. Sassone (2000), Functorial Models for Petri Nets, Information and Computation. To appear.
C. Fournet and G. Gonthier (1996), The Reflexive Chemical Abstract Machine and the Join-Calculus, In Proc. POPL’96, 372–385, ACM.
C. Fournet and G. Gonthier (1996), A Hierarchy of Equivalences for Asynchronous Calculi, In Proc. ICALP’98, Lecture Notes in Computer Science 1443, 844–855, Springer.
C. Fournet, G. Gonthier, J. L*00c9*vy, L. Maranget, and D. R*00c9*my (1996), A Calculus of Mobile Agents, In Proc. CONCUR’96, Lecture Notes in Computer Science 1119, 406–421, Springer.
C. Fournet, C. Laneve, L. Maranget, and D. R*00c9*my (1997), Implicit Typing à la ML for the Join-Calculus, In Proc. CONCUR’97, Lecture Notes in Computer Science 1243, 196–212, Springer.
K. Jensen (1992), Coloured Petri Nets. Basic Concepts, Analysis Methods and Practical Use. Monographs on Theoretical Computer Science, Springer.
C. Laneve (1996), May And Must Testing In The Join-Calculus, Technical Report UBLCS 96-04, Università Di Bologna.
F. Le Fessant and L. Maranget (1998), Compiling Join-Patterns, In Proc. HLCL’98, Electronic Notes in Computer Science 16(3), Elsevier.
R. Milner (1993), Action Calculi, or Syntactic Action Structures, In Proc. MFCS’93, Lecture Notes in Computer Science 711, 105–121, Springer.
M. Nielsen, L. Priese, and V. Sassone (1995), Characterizing Behavioural Congruences for Petri Nets, in Proc. CONCUR 95, Lecture Notes in Computer Science 962, 175–189, Springer.
M. Odersky (2000), Functional Nets, In Proc. ESOP’2000, Lecture Notes in Computer Science 1782, 1–25, Springer.
M. Odersky, C. Zenger, M. Zenger, and G. Chen (1999), A Functional View of Join, Technical Report ACRC-99-016, University of South Australia.
C.A. Petri (1962), Kommunikation mit Automaten. Ph.D. thesis, Institut fur Instrumentelle Mathematik, Bonn.
W. Reisig (1985), Petri Nets: An Introduction. EATCS Monographs on Theoretical Computer Science, Springer.
V. Sassone (2000), On the Algebraic Structure of Petri Nets, Bulletin of EATCS 72, 133–148.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Buscemi, M.G., Sassone, V. (2001). High-Level Petri Nets as Type Theories in the Join Calculus. In: Honsell, F., Miculan, M. (eds) Foundations of Software Science and Computation Structures. FoSSaCS 2001. Lecture Notes in Computer Science, vol 2030. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45315-6_7
Download citation
DOI: https://doi.org/10.1007/3-540-45315-6_7
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-41864-1
Online ISBN: 978-3-540-45315-4
eBook Packages: Springer Book Archive