A hierarchy of equivalences for asynchronous calculi

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

Volumn 1443 LNCS, Issue , 1998, Pages 844-855

  Fournet, Cédric ^a   Gonthier, Georges ^a  

^a INRIA ROCQUENCOURT   (France)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; BIOMINERALIZATION; PATHOLOGY;

BARBED BISIMULATION; BISIMULATIONS; COUPLED SIMULATION; FAIR TESTING; JOIN CALCULUS; NAME MATCHING; NAME-PASSING PROCESS CALCULI; REDUCTION EQUIVALENCE;

CALCULATIONS;

EID: 84878582620     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0055107     Document Type: Conference Paper

References (25)

1. M. Abadi, C. Fournet, and G. Gonthier. Secure implementation of channel abstractions. In Proceedings of LICS '98, June 1998.
2. M. Abadi and A. D. Gordon. Reasoning about cryptographic protocols in the spi calculus. In Proceedings of CONCUR '97, pages 59-73, July 1997. LNCS 1243.
3. R. M. Amadio, I. Castellani, and D. Sangiorgi. On bisimulations for the asynchronous π-calculus. In Proceedings of CONCUR '96, Aug. 1996. LNCS 1119.
4. M. Boreale, C. Fournet, and C. Laneve. Bisimulations in the join-calculus. In Proceedings of PROCOMET '98. Chapman and Hall, June 1998.
5. M. Boreale and R. D. Nicola. Testing equivalence for mobile processes. Information and Computation, 120(2):279-303, Aug. 1995.
6. G. Boudol. Asynchrony and the π-calculus (note). Rapport de Recherche 1702, INRIA Sophia-Antipolis, May 1992.
7. E. Brinksma, A. Rensink, and W. Vogler. Fair testing. In Proceedings of CONCUR '95, pages 313-327, 1995. LNCS 962.
8. E. Brinksma, A. Rensink, and W. Vogler. Applications of fair testing. In Formal Description Techniques IX: Theory, Applications and Tools, Volume IX. ch, 1996.
9. R. De Nicola and M. C. B. Hennessy. Testing equivalences for processes. Theoretical Comput. Sci., 34:83-133, 1984.
10. C. Fournet and G. Gonthier. The reflexive chemical abstract machine and the join-calculus. In Proceedings of POPL '96, pages 372-385. ACM, Jan. 1996.
11. M. Hennessy. Algebraic Theory of Processes. The MIT Press, 1988.
12. K. Honda and M. Tokoro. On asynchronous communication semantics. In Proceedings of the ECOOP '91 Workshop on Object-Based Concurrent Computing, pages 21-51, 1992. LNCS 612.
13. K. Honda and N. Yoshida. On reduction-based process semantics. Theoretical Comput. Sci., 151:437-486, 1995.
14. C. Laneve. May and must testing in the join-calculus. Technical Report UBLCS 96-04, University of Bologna, May 1996.
15. R. Milner. Communication and Concurrency. Prentice Hall, New York, 1989.
16. R. Milner. The polyadic π-calculus: a tutorial. In F. L. Bauer, W. Brauer, and H. Schwichtenberg, editors, Logic and Algebra of Specification. Springer-Verlag, 1993.
17. R. Milner and D. Sangiorgi. Barbed bisimulation. In Proceedings of ICALP '92, pages 685-695, 1992. LNCS 623.
18. J. H. Morris, Jr. Lambda-Calculus Models of Programming Languages. Ph. D. dissertation, MIT, Dec. 1968. Report No. MAC-TR-57.
19. V. Natarajan and R. Cleaveland. Divergence and fair testing. In Proceedings of ICALP '95, 1995. LNCS 944.
20. U. Nestmann and B. C. Pierce. Decoding choice encodings. In Proceedings of CONCUR '96, pages 179-194, Aug. 1996. LNCS 1119.
21. J. Parrow and P. Sjödin. Multiway synchronization verified with coupled simulation. In Proceedings of CONCUR '92, pages 518-533, 1992. LNCS 630.
22. J. Parrow and P. Sjödin. The complete axiomatization of CS-congruence. In Proceedings of STACS '94, pages 557-568, 1994. LNCS 775.
23. D. Sangiorgi. On the bisimulation proof method. Technical Report ECS-LFCS-94-299, University of Edinburgh, 1994. An extended abstract appears in Proceedings of MFCS'95, LNCS 969.
24. D. Sangiorgi. Expressing Mobility in Process Algebras: First-Order and Higher-Order Paradigms. Ph. D. thesis, University of Edinburgh, May 1993.
25. R. J. van Glabbeek. The linear time-branching time spectrum II; the semantics of sequential systems with silent moves (extended abstract). In Proceedings of CONCUR '93, pages 66-81, 1993. LNCS 715.