Abstract
This paper presents a formal system based on the notion of objects and asynchronous communication. Built on Milner's work on π-calculus, the communication primitive of the formal system is purely based on asynchronous communication, which makes it unique among various concurrency formalisms. Computationally this results in a consistent reduction of Milner's calculus, while retaining the same expressive power. Seen semantically asynchronous communication induces a surprisingly different framework where bisimulation is strictly more general than its synchronous counterpart. This paper shows basic construction of the formal system along with several illustrative examples.
Finally the authors would like to thank Carl Hewitt, who stayed in Keio University from Autumn 1989 to Summer 1990, for beneficial discussions with them, to Professor Joseph Goguen for his suggestions, to Vasco Vasconcelous for discussions and comments on the paper, to Chisato Numaoka for discussions on concurrency, to Kaoru Yoshida for her stimulating e-mails, and to all the labo members for their kind assistance and cheers.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Agha, G., Actors: A Model of Concurrent Computation in Distributed Systems. MIT Press, 1986.
Barendreght, H. The Lambda Calculus: Its Syntax and Semantics. North Holland, 1984.
Berry, G. and Boudol, G., The Chemical Abstract Machine. In Proc. 17 the Annual Symposium on Principles of Programming Languages, 1990.
Boudol, G., Towards a Lambda-Calculus for Concurrent and Communicating Systems. In Proc. TAPSOFT 1989, LNCS 351, Springer-Verlag, 1984.
Clinger, W. Foundations of Actor Semantics. AI-TR-633, MIT Artificial Intelligence Laboratory.
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–June 1, 1990.
Hewitt, C., Viewing Control Structures as Patterns of Passing Messages. Artificial Intelligence, 1977.
Hewitt, C., Bishop, P., and Steiger, R., A Universal Modular ACTOR Formalism for Artificial Intelligence. In Proc. of the 3rd International Joint Conference on Artificial Intelligence, August 1973.
Hoare, C.A.R., Communicatin Sequential Processes. Prentice Hall, 1985.
Honda, K., A Short Note On Language PROTO, a manuscript, August 1989.
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.
Milner, R., Calculus of Communicating Systems. LNCS 92, Springer-Verlag, 1980.
Milner, R., Calculi for Synchrony and Asynchrony. Theoretical Computer Science 25, 1983.
Milner, R., Parrow, J.G. and Walker, D.J., A Calculus of Mobile Processes. Part I and II. ECS-LFCS-89-85/86, Edinburgh University, 1989
Milner, R., Communication and Concurrency. Prentice Hall, 1989.
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.)
Nielson and Engberg, A Calculus of Communicating Systems with Label Passing. Research Report DAIMI PB-208, Computer Science Department, University of Aarhus, 1986.
Nierstrasz, O., Towards a Type Theory for Active Objects, in [23].
Nierstrasz, O., A Guide to Specifying Concurrent Behaviour with Abacus, in [23].
Thomsen, B., A calculus of higher order communicating systems. In Proc. 16 the Annual Symposium on Principles of Programming Languages, 1989.
Tokoro, M., Computational Field Model: Toward a New Computing Model/Methodology for Open Distributed Environment. In Proc. of The 2nd IEEE Workshop on Future Trends in Distributed Computing Systems, Cairo, 1990.
Tokoro, M. and Honda, K., Computational Field Model for Open Distributed Environment. To appear in Yonezawa, A., McColl, W., and Ito, T., ed., Concurrency: Theory, Language, Architecture, LNCS, Springer Verlag, 1991.
Tsichritzis, D., ed. Object Management. Centre Universitaire D'informatique, Universite de Geneve, July 1990.
Yonezawa, A., and Tokoro, M., ed., Object-Oriented Concurrent Programming. MIT Press, 1986.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1991 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Honda, K., Tokoro, M. (1991). An object calculus for asynchronous communication. In: America, P. (eds) ECOOP'91 European Conference on Object-Oriented Programming. ECOOP 1991. Lecture Notes in Computer Science, vol 512. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0057019
Download citation
DOI: https://doi.org/10.1007/BFb0057019
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-54262-9
Online ISBN: 978-3-540-47537-8
eBook Packages: Springer Book Archive