Skip to main content

A hierarchy of equivalences for asynchronous calculi

Extended abstract

  • Conference paper
  • First Online:
Automata, Languages and Programming (ICALP 1998)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1443))

Included in the following conference series:

Abstract

We generate a natural hierarchy of equivalences for asynchronous name-passing process calculi from simple variations on Milner and Sangiorgi's definition of weak barbed bisimulation. The π-calculus, used here, and the join-calculus are examples of such calculi.

We prove that barbed congruence coincides with Honda and Yoshida's reduction equivalence, and with asynchronous labeled bisimulation when the calculus includes name matching, thus closing those two conjectures. We also show that barbed congruence is coarser when only one barb is tested. For the π-calculus it becomes an odd limit bisimulation, but for the join-calculus it coincides with both fair testing equivalence and with the weak barbed version of Sjödin and Parrow's coupled simulation.

This work is partly supported by the ESPRIT CONFER-2 WG-21836

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. M. Abadi, C. Fournet, and G. Gonthier. Secure implementation of channel abstractions. In Proceedings of LICS '98, June 1998.

    Google Scholar 

  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.

    Article  MathSciNet  Google Scholar 

  3. R. M. Amadio, I. Castellani, and D. Sangiorgi. On bisimulations for the asynchronous π-calculus. In Proceedings of CONCUR '96, Aug. 1996. LNCS 1119.

    Google Scholar 

  4. M. Boreale, C. Fournet, and C. Laneve. Bisimulations in the join-calculus. In Proceedings of PROCOMET '98. Chapman and Hall, June 1998.

    Google Scholar 

  5. M. Boreale and R. D. Nicola. Testing equivalence for mobile processes. Information and Computation, 120(2):279–303, Aug. 1995.

    Article  MATH  MathSciNet  Google Scholar 

  6. G. Boudol. Asynchrony and the π-calculus (note). Rapport de Recherche 1702, INRIA Sophia-Antipolis, May 1992.

    Google Scholar 

  7. E. Brinksma, A. Rensink, and W. Vogler. Fair testing. In Proceedings of CONCUR '95, pages 313–327, 1995. LNCS 962.

    Google Scholar 

  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.

    Google Scholar 

  9. R. De Nicola and M. C. B. Hennessy. Testing equivalences for processes. Theoretical Comput. Sci., 34:83–133, 1984.

    Article  MATH  Google Scholar 

  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.

    Google Scholar 

  11. M. Hennessy. Algebraic Theory of Processes. The MIT Press, 1988.

    Google Scholar 

  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.

    MathSciNet  Google Scholar 

  13. K. Honda and N. Yoshida. On reduction-based process semantics. Theoretical Comput. Sci., 151:437–486, 1995.

    Article  MATH  MathSciNet  Google Scholar 

  14. C. Laneve. May and must testing in the join-calculus. Technical Report UBLCS 96-04, University of Bologna, May 1996.

    Google Scholar 

  15. R. Milner. Communication and Concurrency. Prentice Hall, New York, 1989.

    Google Scholar 

  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.

    Google Scholar 

  17. R. Milner and D. Sangiorgi. Barbed bisimulation. In Proceedings of ICALP '92, pages 685–695, 1992. LNCS 623.

    MathSciNet  Google Scholar 

  18. J. H. Morris, Jr. Lambda-Calculus Models of Programming Languages. Ph. D. dissertation, MIT, Dec. 1968. Report No. MAC-TR-57.

    Google Scholar 

  19. V. Natarajan and R. Cleaveland. Divergence and fair testing. In Proceedings of ICALP '95, 1995. LNCS 944.

    Google Scholar 

  20. U. Nestmann and B. C. Pierce. Decoding choice encodings. In Proceedings of CONCUR '96, pages 179–194, Aug. 1996. LNCS 1119.

    MathSciNet  Google Scholar 

  21. J. Parrow and P. Sjödin. Multiway synchronization verified with coupled simulation. In Proceedings of CONCUR '92, pages 518–533, 1992. LNCS 630.

    Google Scholar 

  22. J. Parrow and P. Sjödin. The complete axiomatization of CS-congruence. In Proceedings of STACS '94, pages 557–568, 1994. LNCS 775.

    MATH  Google Scholar 

  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.

    Google Scholar 

  24. D. Sangiorgi. Expressing Mobility in Process Algebras: First-Order and Higher-Order Paradigms. Ph.D. thesis, University of Edinburgh, May 1993.

    Google Scholar 

  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.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Kim G. Larsen Sven Skyum Glynn Winskel

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Fournet, C., Gonthier, G. (1998). A hierarchy of equivalences for asynchronous calculi. In: Larsen, K.G., Skyum, S., Winskel, G. (eds) Automata, Languages and Programming. ICALP 1998. Lecture Notes in Computer Science, vol 1443. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0055107

Download citation

  • DOI: https://doi.org/10.1007/BFb0055107

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-64781-2

  • Online ISBN: 978-3-540-68681-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics