Abstract
We study a new formulation of bisimulation for the π-calculus [9], which we have called open bisimulation (∼). In contrast with the previously known bisimilarity equivalences, ∼ is preserved by name substitution and (hence) by input prefix. The differences among all these equivalences already appear in the sublanguage without restriction: Here the definition of ∼ can be factorised into a “standard” part which, modulo the different syntax of actions, is the CCS bisimulation, and a part specific to the π-calculus, which requires name instantiation. Attractive features of ∼ are: a simple axiomatisation (of the finite terms), with a completeness proof which leads to the construction of minimal canonical representatives for the equivalence classes of ∼; an “efficient” characterisation, based on a modified transition system. This characterisation seems promising for the development of automated-verification tools and also shows the call-by-need flavour of ∼. Although in the paper we stick to π-calculus, the issues developed may be relevant to value-passing calculi in general.
Work supported by the ESPRIT BRA project “CONFER”.
Preview
Unable to display preview. Download preview PDF.
References
R. Amadio. A uniform presentation of CHOCS and π-calculus. Rapport de recherche 1726, INRIA-Lorraine, Nancy, 1992.
M. Boreale and R. De Nicola. Testing equivalence for mobile processes. In R. Cleaveland, editor, 3rd CONCUR, volume 630 of Lecture Notes in Computer Science, pages 2–16. Springer Verlag, 1992.
P. Degano, S. Kasangian, and S. Vigna. Applications of the calculus of trees to process description languages. In Proc. of the CTCS '91 Conference, volume 530 of Lecture Notes in Computer Science, pages 281–301. Springer Verlag, 1991.
M. Hennessy and H. Lin. Symbolic bisimulations. Revised Version of Technical Report TR 1/92, Department of Computer Science, University of Sussex, 1992.
R. Milner. Communication and Concurrency. Prentice Hall, 1989.
R. Milner. Action structures. Technical Report ECS-LFCS-92-249, LFCS, Dept. of Comp. Sci., Edinburgh Univ., December 1992.
R. Milner. Functions as processes. Journal of Mathematical Structures in Computer Science, 2(2):119–141, 1992.
R. Milner, J. Parrow, and D. Walker. Modal logics for mobile processes. In 2nd CONCUR, volume 527 of Lecture Notes in Computer Science, pages 45–60. Springer Verlag, 1991.
R. Milner, J. Parrow, and D. Walker. A calculus of mobile processes, (Parts I and II). Information and Computation, 100:1–77, 1992.
U. Montanari and V. Sassone. Dynamic congruence vs. progressing bisimulation for CCS. Fundamenta Informaticae, XVI(2):171–199, 1992.
D.M. Park. Concurrency on automata and infinite sequences. In P. Deussen, editor, Conf. on Theoretical Computer Science, volume 104 of Lecture Notes in Computer Science. Springer Verlag, 1981.
J. Parrow and D. Sangiorgi. Algebraic theories for name-passing calculi. Technical Report ECS-LFCS-93-262, LFCS, Dept. of Comp. Sci., Edinburgh Univ., 1993.
D. Sangiorgi. Expressing Mobility in Process Algebras: First-Order and Higher-Order Paradigms. CST-99-93, Department of Computer Science, University of Edinburgh, 1992. Also published as ECS-LFCS-93-266.
D. Sangiorgi. A theory of bisimulation for π-calculus. To appear as Technical Report, Department of Computer Science, University of Edinburgh, 1993.
C. P. Wadsworth. Semantics and pragmatics of the lambda calculus. PhD thesis, University of Oxford, 1971.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Sangiorgi, D. (1993). A theory of bisimulation for the π-calculus. 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_10
Download citation
DOI: https://doi.org/10.1007/3-540-57208-2_10
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