Abstract
A multiset (or Petri net) semantics is defined for the π-calculus with replication. The semantic mapping is a strong bisimulation, and structurally congruent processes have the same semantics.
The research of the author was supported by the Esprit Basic Working Group No.6067 CALIBAN.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
J.-P.Bânatre, D. Le Métayer; Programming by multiset transformation, Comm. of the ACM 36 (1993), 98–111
H.P.Barendregt; The Lambda Calculus, North-Holland, Amsterdam, 1984
G.Berry, G.Boudol; The chemical abstract machine, Theor.Comput.Sci. 96 (1992), 217–248
N.G.De Bruijn; Lambda calculus notation with nameless dummies, a tool for automatic formula manipulation, Indag. Math. 34 (1972), 381–392
P.Degano, R.De Nicola, U.Montanari; A distributed operational semantics for CCS based on Condition/Event systems, Acta Informatica 26 (1988), 59–91
J.Engelfriet; Branching processes of Petri nets, Acta Informatica 28 (1991), 575–591
U.Goltz; On representing CCS programs by finite Petri nets, in Proc. MFCS'88, Lecture Notes in Computer Science 324, Springer-Verlag, 1988, pp.339–350
U.Goltz, W.Reisig; The non-sequential behaviour of Petri nets, Inform. Control 57 (1983), 125–147
R.Milner; Communication and Concurrency, Prentice-Hall, Englewood Cliffs, NJ., 1989
R.Milner; Functions as processes, Math. Struct. in Comp. Science 2 (1992), 119–14
R.Milner; The polyadic π-calculus: a tutorial, Report ECS-LFCS-91-180, University of Edinburgh, 1991
R.Milner; Elements of interaction, Comm. of the ACM 36 (1993), 78–89, Turing Award Lecture
R.Milner, J.Parrow, D.Walker; A calculus of mobile processes, Inform. Comput. 100 (1992), 1–77
M.Nielsen; CCS and its relationship to net theory, in Petri nets: applications and relationships to other models of concurrency, Lecture Notes in Computer Science 255, Springer-Verlag, 1987, pp.393–415
E.-R.Olderog; Nets, Terms and Formulas, Cambridge University Press, Cambridge, 1991
W.Reisig; Petri Nets, EATCS Monographs in Theoretical Computer Science, Springer-Verlag, 1982
D.Taubner; Finite representations of CCS and TCSP programs by automata and Petri nets, Lecture Notes in Computer Science 369, Springer-Verlag, 1989
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Engelfriet, J. (1993). A multiset semantics for the pi-calculus with replication. In: Best, E. (eds) CONCUR'93. CONCUR 1993. Lecture Notes in Computer Science, vol 715. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57208-2_2
Download citation
DOI: https://doi.org/10.1007/3-540-57208-2_2
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-57208-4
Online ISBN: 978-3-540-47968-0
eBook Packages: Springer Book Archive