Abstract
A distributed semantics for π-calculus, based on P/T Petri nets with inhibitor arcs, is presented. This net semantics is sound w.r.t. the original early transition system semantics: the interleaving semantics of an agent p is retrievable from the net by considering the interleaving marking graph for the associated marking dec(p). Furthermore, π-calculus is equipped with a multistep and a causal semantics. The latter is compared with recent proposals appeared in the literature.
Research partially supported by EC BRA n. 9102 COORDINATION.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
G. Berry, G. Boudol, “The Chemical Abstract Machine”, Theoretical Computer Science 96, 217–248, 1992.
M. Boreale, D. Sangiorgi, “A fully abstract semantics of causality in the π-calculus”, Technical Report ECS-LFCS-94-297, 1994.
N. Busi, R. Gorrieri, “Distributed Conflicts in Communicating Systems”, UBLCS-TR-94-08, April 1994. in Proc. Workshop on Models and Languages for Coordination of Parallelism and Distribution, LNCS 924, Springer, 1995.
Ph. Darondeau, P. Degano, “Causal Trees”, in Proc. ICALP'89, LNCS 372, Springer, 234–248, 1989.
P. Degano, R. De Nicola, U. Montanari, “A Distributed Operational Semantics for CCS based on C/E Systems”, Acta Informatica 26, 59–91, 1988.
P. Degano, C. Priami, “Causality for Mobile Processes”, to appear in Proc. ICALP'95, LNCS, Springer, 1995.
J. Engelfriet, “A Multiset Semantics for the π-calculus with Replication”, in Proc. CONCUR'93, LNCS 715, Springer, 7–21, 1993.
R. van Glabbeek, F. Vaandrager, “Petri Net Models for Algebraic Theories of Concurrency”, in Proc. PARLE'87, LNCS 259, Springer, 224–242, 1987.
U. Goltz, “On Representing CCS Programs by Finite Petri Nets”, in Proc. MFCS'88, LNCS 324, Springer, 339–350, 1988.
U. Goltz, “CCS and Petri Nets”, LNCS 469, Springer, 334–357, 1990.
R. Gorrieri, U. Montanari, “SCONE: A Simple Calculus of Nets”, in Proc. CONCUR'90, LNCS 458, Springer, 2–30, 1990.
R. Gorrieri, U. Montanari, “On the Implementation of Concurrent Calculi in Net Calculi: Two Case Studies”, Theoretical Computer Science 141 (1–2), 195–252, 1995.
M. Hack, “Petri Net Languages”, Technical Report 159, MIT, 1976.
R. Janicki, M. Koutny, “Invariant Semantics of Nets with Inhibitor Arcs”, in Proc. CONCUR'91, LNCS 527, Springer, 317–331, 1991.
L. Jategaonkar Jagadeesan, R. Jagadeesan, “Causality and True Concurrency: A Data-flow Analysis of the Pi-Calculus”, to appear in Proc. AMAST'95, 1995.
R. Milner, J. Parrow, D. Walker, “A Calculus of Mobile Processes”, Information and Computation 100, 1–77, 1992.
U. Montanari, M. Pistore, “Concurrent Semantics for the π-calculus”, in Proc. MFPS'95, ENCS 1, Elsevier, 1995.
U. Montanari, F. Rossi “Contextual Nets”, Acta Informatica, to appear.
E. R. Olderog, Nets, Terms and Formulas, Cambridge Tracts in Theoretical Computer Science 23, CUP, 1991.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Busi, N., Gorrieri, R. (1995). A Petri net semantics for π-calculus. In: Lee, I., Smolka, S.A. (eds) CONCUR '95: Concurrency Theory. CONCUR 1995. Lecture Notes in Computer Science, vol 962. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60218-6_11
Download citation
DOI: https://doi.org/10.1007/3-540-60218-6_11
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60218-7
Online ISBN: 978-3-540-44738-2
eBook Packages: Springer Book Archive