Skip to main content
SpringerLink
Log in

On asynchronous communication semantics

  • Conference paper
  • First Online:
Object-Based Concurrent Computing (ECOOP 1991)

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

Included in the following conference series:

Abstract

This paper presents some results concerning equational theories for an elementary calculus based on a fragment of Milner's π-calculus. The system is interesting because it realises asynchronous message passing not by extending but reducing the original fragment, while preserving the computational power. The bisimulation based on a novel asynchronous transition system is introduced and studied. Presented results include congruence of the bisimilarity for the calculus, its relationship with two other asynchronous theories based on traces and failures, strict inclusion of its synchronous counterpart in the asynchronous theory, and the method called the I completion that transforms two asynchronously bisimilar terms into synchronously bisimilar ones.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Abramsky, S., Observational Equivalence as a Testing Equivalence, Theoretical Computer Science, 53, 1987.

    Google Scholar 

  2. Agha, G.: Actors: A Model of Concurrent Computation in Distributed Systems. MIT Press, 1986.

    Google Scholar 

  3. Bergstra, J., Klop, J., and Tucker, J., Process Algebra with Asynchronous Communication Mechanisms, In Seminar on Concurrency, LNCS 197,1984, Springer Verlag.

    Google Scholar 

  4. de Boer, F., and Palamidessi, C., On the asynchronous nature of communication in concurrent logic languages: a fully abstract model based on sequences, In CONCUR '90, LNCS 458, Springer-Verlag, 1990.

    Google Scholar 

  5. de Boer, F., Kok, J., Palamidessi, C., and J.J.M.M. Rutten. The Failure of failures in a paradigm for asynchronous communication. In CONCUR '91, LNCS, Springer-Verlag, 1991.

    Google Scholar 

  6. Boudol, Towards the Lambda Calculus for Concurrent Computation. In Proc. TAP-SOFT 1989, LNCS 351, Springer Verlag, 1989.

    Google Scholar 

  7. Clinger, W. Foundations of Actor Semantics. AI-TR-633, MIT Artificial Intelligence Laboratory.

    Google Scholar 

  8. Goguen, J., Sheaf semantics for concurrent interacting objects. To appear in Proc. REX School on Foundations of Object-Oriented Programming, Noorwijkerhout, The Netherlands, May 28–June1, 1990.

    Google Scholar 

  9. Hewitt, C., Viewing Control Structures as Patterns of Passing Messages. Artificial Intelligence, 1977.

    Google Scholar 

  10. Hindley,J.R., and Seldin, J.P., Introduction to Combinators and λ-calculus. Campbridhe university Press, 1986.

    Google Scholar 

  11. Hoare, C.A.R., Communicating Sequential Processes. Prentice Hall, 1985.

    Google Scholar 

  12. Honda, K. and Tokoro, M., An Object Calculus for Asynchronous Communication, In: Proc. of European Conference on Object-Oriented Programming, LNCS, Springer-Verlag, July 1991. Extended version to appear as a Keio CS report, Novemver 1992.

    Google Scholar 

  13. Honda, K., Functions and Functionals in Interaction. A Manuscript, November 1991.

    Google Scholar 

  14. Honda, K., A Semantically Sound Mapping Between Two Calculi. A Manuscript, November 1991.

    Google Scholar 

  15. Lampson, B.W., Paul, M., and Siegert, H.J., Distributed Systems — Architecture and Implementation An Advanced Course. LNCS 105, Springer-Verlag, 1981.

    Google Scholar 

  16. Meseguer J., Conditional Rewriting Logic as a Unified Model of Concurrency. SRI-CSL-91-05, Computer Science Laboratory, SRI International, 1991. Also to appear in Theoretical Computer Science.

    Google Scholar 

  17. Milner, R., Calculus of Communicating Systems. LNCS 92, Springer-Verlag, 1980.

    Google Scholar 

  18. Milner, R., Calculi for Synchrony and Asynchrony. TCS, 1983.

    Google Scholar 

  19. Milner, R., Parrow, J.G. and Walker, D.J., A Calculus of Mobile Processes. Part I. ECS-LFCS-89-85, Edinburgh University, 1989

    Google Scholar 

  20. Milner, R., Parrow, J.G. and Walker, D.J., A Calculus of Mobile Processes. Part II. ECS-LFCS-89-86, Edinburgh University, 1989

    Google Scholar 

  21. Milner, R., Communication and Concurrency. Prentice Hall, 1989.

    Google Scholar 

  22. Milner, R., Functions as Processes. In Automata, Language and Programming, LNCS 443, 1990. The extended version under the same title as Rapports de Recherche No. 1154, INRIA-Sophia Antipolis, February 1990.

    Google Scholar 

  23. de Nicola, E., and Hennessy, M., Testing Equivalence for Processes. Theoretical Computer Science, 34, 1983.

    Google Scholar 

  24. Nielson and Engberg, A Calculus of Communicating Systems with Label Passing. Research Report DAIMI PB-208, Computer Science Department, University of Aarhus, 1986.

    Google Scholar 

  25. Nierstrasz, O., A Guide to Specifying Concurrent Behaviour with Abacus. in [29].

    Google Scholar 

  26. Nierstrasz, O., Towards an Object Calculus, in this volume, 1992.

    Google Scholar 

  27. Park, D., Concurrency and Automata on Infinite Sequences. LNCS 104, Springer-Verlag, 1980.

    Google Scholar 

  28. Tokoro, M., Toward Computing Systems in the 2000's. Operating Systems of the 90s and Beyond, LNCS 563, Springer Verlag, 1992.

    Google Scholar 

  29. Tsichritzis, D., ed. Object Management. Centre Universitaire D'informatique, Universite de Geneve, July 1990.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Keio University, 3-14-1 Hiyoshi, Kohoku-ku, 223, Yokohama, Japan

    Kohei Honda & Mario Tokoro

  2. Sony Computer Science Laboratory Inc., 3-14-13 Higashi-Gotanda, Shinagawa-ku, 141, Tokyo, Japan

    Mario Tokoro

Authors
  1. Kohei Honda
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Mario Tokoro
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

M. Tokoro O. Nierstrasz P. Wegner

Rights and permissions

Reprints and permissions

Copyright information

© 1992 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Honda, K., Tokoro, M. (1992). On asynchronous communication semantics. In: Tokoro, M., Nierstrasz, O., Wegner, P. (eds) Object-Based Concurrent Computing. ECOOP 1991. Lecture Notes in Computer Science, vol 612. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-55613-3_2

Download citation

  • DOI: https://doi.org/10.1007/3-540-55613-3_2

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-55613-8

  • Online ISBN: 978-3-540-47260-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation