Abstract
The asynchronous π-calculus is a variant of the π-calculus where message emission is non-blocking. Honda and Tokoro have studied a semantics for this calculus based on bisimulation. Their bisimulation relies on a modified transition system where, at any moment, a process can perform any input action.
In this paper we propose a new notion of bisimulation for the asynchronous π-calculus, defined on top of the standard labelled transition system. We give several characterizations of this equivalence including one in terms of Honda and Tokoro's bisimulation, and one in terms of barbed equivalence. We show that this bisimulation is preserved by name substitutions, hence by input prefix. Finally, we give a complete axiomatization of the (strong) bisimulation for finite terms.
The authors were partially supported by France Télécom, CTI-CNET 95-1B-182 Modélisation de Systèmes Mobiles.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
R. Amadio, I. Castellani, and D. Sangiorgi. On bisimulations for the asynchronous π-calculus. Research Report To appear, INRIA, Sophia-Antipolis, 1996. Available at http://wwwi3s.unice.fr/∼amadio/.
G. Agha. Actors: a model of concurrent computation in distributed systems. MIT-Press, 1986.
G. Boudol. Asynchrony and the π-calculus. Research Report 1702, INRIA, Sophia-Antipolis, 1991.
M. Boreale and D. Sangiorgi. Some congruence properties for π-calculus bisimilarities. Research Report 2870, INRIA, Sophia-Antipolis, 1996.
M. Dam. Model checking mobile processes. In Proc. CONCUR'93, Lecture Notes in Computer Science, 715:22–36, 1993. Full version in SICS report RR94:1, 1994.
C. Fournet and G. Gonthier. The reflexive CHAM and the join-calculus. Proc. ACM-POPL, 1996.
M. Hansen, J. Kleist, and H. Hüttel. Bisimulations for asynchronous mobile processes. In Proceedings of the Tbilisi Symposium on Language, Logic, and Computation, 1995. Research paper HCRC/RP-72, Human Communication Research Centre, University of Edinburgh.
K. Honda and M. Tokoro. An object calculus for asynchronous communication. Proc. ECOOP 91, Geneve, 1991.
K. Honda and M. Tokoro. On asynchronous communication semantics. Object-based concurrent computing, SLNCS 612, 1992.
K. Honda and N. Yoshida. On reduction based process semantics. Theoretical Computer Science, 151:437–486, 1995.
R. Milner, J. Parrow, and D. Walker. A Calculus of Mobile Process, Parts 1–2. Information and Computation, 100(1):1–77, 1992.
R. Milner and D. Sangiorgi. Barbed bisimulation. In Proc. ICALP 92, SLNCS 623, 1992.
U. Nestmann and B. Pierce. Decoding choice encodings. In CONCUR 96, SLNCS to appear, Pisa, 1996.
B. Pierce and D. Turner. Pict: a programming language based on the π-calculus. U. Cambridge, 1996.
D. Sangiorgi. A theory of bisimulation for the π-calculus. in Proc. CONCUR'93 Lecture Notes in Computer Science, 715:127–142, 1993.
D. Sangiorgi. Lazy functions and mobile processes. Research Report RR-2515, INRIA, Sophia-Antipolis, 1995. Available via anonymous ftp from cma.cma.fr_as_pub/papers/davide/RR-2515.ps.
G. Tel. Introduction to distributed algorithms. Cambridge University Press, 1995.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Amadio, R.M., Castellani, I., Sangiorgi, D. (1996). On bisimulations for the asynchronous π-calculus. In: Montanari, U., Sassone, V. (eds) CONCUR '96: Concurrency Theory. CONCUR 1996. Lecture Notes in Computer Science, vol 1119. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61604-7_53
Download citation
DOI: https://doi.org/10.1007/3-540-61604-7_53
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61604-7
Online ISBN: 978-3-540-70625-0
eBook Packages: Springer Book Archive