Abstract
Symbolic transition systems are used as a basis for giving a new semantics of the 7r-calculus. This semantics is more amenable to automatic manipulation and sheds new light on the logical differences among different forms of bisimulation over dynamic process algebras. Symbolic transitions have the form P P’ where, intuitively, q’ is a boolean constraint over names that has to hold for the transition to take place, and a is a 7r-calculus action; e.g., [x = y]a•P [x-a P says that action a can be performed under any interpretation of names satisfying x = y. A symbolic bisimulation is defined on top of the symbolic transition system and it is shown that it captures the standard ones. Finally, a complete proof system is defined for symbolic bisimulation.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
M. Boreale and R. De Nicola. Testing equivalence for mobile processes. Technical Report SI 92 RR 04, Dipartimento di Scienze dell’Informazione Università “La Sapienza”, Roma, 1992. Extended abstract appeared in: R. Cleaveland (ed.), Proceedings of CONCUR ‘82, LNCS 630 Springer-Verlag. Full version to appear in Information and Computation.
M. Boreale and R. De Nicola. A symbolic semantics for the a-calculus. Technical Report SI 94 RR 04, Dipartimento di Scienze dell’Informazione Università “La Sapienza”, Roma, 1994.
M. Dam. Model checking mobile processes. In E. Best, editor, Proceedings of CONCUR ‘83, LNCS 715. Springer-Verlag, Berlin, 1993.
G. Ferrari, U. Montanari, and P. Quaglia. The a-calculus with explicit substitutions. Technical report, Università di Pisa, 1994. Accepted to MFCS’94.
M. Hennessy. A model for the a-calculus. Technical report, University of Sussex, 1991.
M. Hennessy and H. Lin. Symbolic bisimulations. Technical report, University of Sussex, 1992.
M. Hennessy and H. Lin. Proof systems for message-passing process algebras. In E. Best, editor, Proceedings of CONCUR ‘83, LNCS 715. Springer-Verlag, Berlin, 1993.
R. Milner. Communication and Concurrency. Prentice-Hall, 1989.
R. Milner, J. Parrow, and D. Walker. A calculus of mobile processes, part 1 and 2. Information and Computation, 100, 1992.
J. Parrow and D. Sangiorgi. Algebraic theories for name-passing calculi. Technical report, University of Edinburgh, 1993. To appear in Information and Computation.
D. Sangiorgi. A theory of bisimulation for the a-calculus. In E. Best, editor, Proceedings of CONCUR ‘83, LNCS 715. Springer-Verlag, Berlin, 1993.
D. Sangiorgi. On the bisimulation proof method. Technical report, University of Edinburgh, 1994. In preparation.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Boreale, M., De Nicola, R. (1994). A Symbolic Semantics for the π-calculus. In: Jonsson, B., Parrow, J. (eds) CONCUR ’94: Concurrency Theory. CONCUR 1994. Lecture Notes in Computer Science, vol 836. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-48654-1_24
Download citation
DOI: https://doi.org/10.1007/978-3-540-48654-1_24
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-58329-5
Online ISBN: 978-3-540-48654-1
eBook Packages: Springer Book Archive