On bisimulations for the asynchronous π-calculus

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1119, Issue , 1996, Pages 147-162

  Amadio, Roberto M ^a   Castellani, Ilaria ^b   Sangiorgi, Davide ^b  

^a CNRS   (France)

^b INHIA   (France)

Author keywords

[No Author keywords available]

Indexed keywords

SEMANTICS;

BISIMULATIONS; COMPLETE AXIOMATIZATIONS; LABELLED TRANSITION SYSTEMS; NON-BLOCKING; PI CALCULUS; TRANSITION SYSTEM;

CALCULATIONS;

EID: 84955577422     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61604-7_53     Document Type: Conference Paper

References (17)

1. 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/.
2. G. Agha. Actors: a model of concurrent computation in distributed systems. MIT-Press, 1986.
3. G. Boudol. Asynchrony and the 7r-calculus. Research Report 1702, INRIA, Sophia-Antipolis, 1991.
4. M. Boreale and D. Sangiorgi. Some congruence properties for ir-calculus bisimilarities. Research Report 2870, INRIA, Sophia-Antipolis, 1996.
5. M. Dam. Model checking mobile processes. In Proc. CONCUR’93, Lecture Notes in Computer Science, 715:22-36, 1993. Pull version in SICS report RR94:1,1994.
6. C. Foumet and G. Gonthier. The reflexive CHAM and the join-calculus. Proc. ACM-POPL, 1996.
7. M. Hansen, J. Kleist, and H. Hiittel. 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.
8. K. Honda and M. Tokoro. An object calculus for asynchronous communication. Proc. ECOOP 91, Geneve, 1991.
9. K. Honda and M. Tokoro. On asynchronous communication semantics. Object-based concurrent computing, SLNCS 612, 1992.
10. K. Honda and N. Yoshida. On reduction based process semantics. Theoretical Computer Science, 151:437-486, 1995.
11. R. Milner, J. Parrow, and D. Walker. A Calculus of Mobile Process, Parts 1-2. Information and Computation, 100(1):1-77, 1992.
12. R. Milner and D. Sangiorgi. Barbed bisimulation. In Proc. ICALP 92, SLNCS 623, 1992.
13. U. Nestmann and B. Pierce. Decoding choice encodings. In CONCUR 96, SLNCS to appear, Pisa, 1996.
14. B. Pierce and D. Turner. Piet: a programming language based on the π-calculus. U. Cambridge, 1996.
15. D. Sangiorgi. A theory of bisimulation for the ir-calculus. in Proc. CONCUR’93 Lecture Notes in Computer Science, 715:127-142, 1993.
16. 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.
17. G. Tel. Introduction to distributed algorithms. Cambridge University Press, 1995.