Abstract
This paper presents some new results on barbed equivalences for the π-calculus. The equivalences studied are barbed congruence and a variant of it called open barbed bisimilarity. The difference between the two is that in open barbed the quantification over contexts is inside the definition of the bisimulation and is therefore recursive. It is shown that if infinite sums are admitted to the π-calculus then it is possible to give a simple proof that barbed congruence and early congruence coincide on all processes, not just on image-finite processes. It is also shown that on the o-calculus, and on the extension of it with infinite sums, open barbed bisimilarity does not correspond to any known labelled bisimilarity. It coincides with a variant of open bisimilarity in which names that have been extruded are treated in a special way, similarly to how names are treated in early bisimilarity.
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. Abadi and C. Fournet. Mobile Values, New Names, and Secure Communication. In 28th Annual Symposium on Principles of Programming Languages. ACM, 2001.
P. Aczel. An introduction to inductive definitions. In Handbook of Mathematical Logic. North Holland, 1977.
R. Amadio, I. Castellani, and D. Sangiorgi. On bisimulations for the asynchronous π-calculus. Theoretical Computer Science, 195(2):291–324, 1998.
C. Fournet and G. Gonthier. A hierarchy of equivalences for asynchronous calculi. In ICALP’98: Automata, Languages and Programming, volume 1443 of Lecture Notes in Computer Science. Springer-Verlag, 1998.
K. Honda and N. Yoshida. On reduction-based process semantics. Theoretical Computer Science, 152(2):437–486, 1995.
A. Jeffrey and J. Rathke. A theory of bisimulation for a fragment of Concurrent ML with local names. In 15th Annual IEEE Symposium on Logic in Computer Science. IEEE Computer Society Press, 2000.
M. Merro. Locality in the π-calculus and Applications to Object-Oriented Languages. PhD thesis, Ecole des Mines de Paris, 2000.
R. Milner. The polyadic π-calculus: a tutorial. In Logic and Algebra of Specification. Springer-Verlag, 1993.
R. Milner and D. Sangiorgi. Barbed bisimulation. In ICALP’92: Automata, Languages and Programming, volume 623 of Lecture Notes in Computer Science. Springer-Verlag, 1992.
U. Montanari and V. Sassone. Dynamic congruence vs. progressing bisimulation for CCS. Fundamenta Informaticae, XVI(2):171–199, 1992.
D. Sangiorgi. Expressing Mobility in Process Algebras: First-Order and Higher-Order Paradigms. PhD thesis, Department of Computer Science, University of Edinburgh, 1992.
D. Sangiorgi. A theory of bisimulation for the π-calculus. Acta Informatica, 33:69–97, 1996.
D. Sangiorgi. The name discipline of uniform receptiveness. Theoretical Computer Science, 221:457–493, 1999.
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
Sangiorgi, D., Walker, D. (2001). On Barbed Equivalences in π-Calculus. In: Larsen, K.G., Nielsen, M. (eds) CONCUR 2001 — Concurrency Theory. CONCUR 2001. Lecture Notes in Computer Science, vol 2154. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44685-0_20
Download citation
DOI: https://doi.org/10.1007/3-540-44685-0_20
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42497-0
Online ISBN: 978-3-540-44685-9
eBook Packages: Springer Book Archive