Abstract
The actor model is a natural starting point for a semantic theory that treats both heterogeneity and modularity (encapsulation and composability) in open distributed systems. This paper begins with some simple examples of actor systems that illustrate the essential features of actor based computation, and the interactions and combinations of components these systems. We then present a semantic theory that models these features. A notion of abstract actor structure (AAS) is introduced that characterizes the minimal semantic requirements for an actor language and allows for components to be defined using multiple languages. We model components as collections of actors accessed via a specified subset called receptionists. A transition system semantics for components is derived from the local rules for behavior of individual actors given in an AAS. This semantics accounts for both internal computation and interaction of a component with its environment. We abstract away from details of internal computation to define a notion of interaction semantics. This allows us to reason about equivalence of actor system components considered as black boxes. An algebra of interaction sets corresponding to the algebra of components is defined, verifying that the interaction semantics compositional. This provides a basis for modular reasoning about construction and transformation of components specified as abstract actor systems.
Chapter PDF
References
G. Agha. Actors: A Model of Concurrent Computation m Distributed Systems. MIT Press, Cambridge, Mass., 1986.
G. Agha. Concurrent object-oriented programming. Communications of the ACM 33(9):125–141, September 1990.
G. Agha, I. A. Mason, S. F. Smith, and C. L. Talcott. A foundation for actor computation, 199? to appear.
Henry G. Baker and Carl Hewitt. Laws for communicating parallel processes, ln IFIP Congress, pages 987–992. IFIP, August 1977.
W. D. Clinger. Foundations of actor semantics. AI-TR- 633, MIT Artificial Intelligence Laboratory, May 1981.
C. Hewitt. Viewing control structures as patterns of passing messages. Journal of Artificial Intelligence, 8 (3): 323–364, 1977.
J. Meseguer. Conditional rewriting logic as a unified model of concurrency. Theoretical Computer Science, 96 (1): 73–155, 1992.
R. Milner, J. G. P arrow, and D. J. Walker. A calculus of mobile processes, Parts I and H. Technical Report ECS-LFCS-89–85, -86, Edinburgh University, 1989.
N. Venkatasubramanian and C. L. Talcott. Reasoning about Meta Level Activities in Open Distributed Systems. In Principles of Distributed Computation, 1995.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1997 IFIP International Federation for Information Processing
About this chapter
Cite this chapter
Talcott, C. (1997). Interaction Semantics for Components of Distributed Systems. In: Najm, E., Stefani, JB. (eds) Formal Methods for Open Object-based Distributed Systems. IFIP Advances in Information and Communication Technology. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-35082-0_11
Download citation
DOI: https://doi.org/10.1007/978-0-387-35082-0_11
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-5041-2875-9
Online ISBN: 978-0-387-35082-0
eBook Packages: Springer Book Archive