## Composable Semantic Models for Actor Theories (1998)

### Cached

### Download Links

- [www-formal.stanford.edu]
- [www-formal.stanford.edu]
- DBLP

### Other Repositories/Bibliography

Venue: | Higher-Order and Symbolic Computation |

Citations: | 31 - 10 self |

### BibTeX

@ARTICLE{Talcott98composablesemantic,

author = {Carolyn L. Talcott},

title = {Composable Semantic Models for Actor Theories},

journal = {Higher-Order and Symbolic Computation},

year = {1998},

volume = {11},

pages = {321--364}

}

### Years of Citing Articles

### OpenURL

### Abstract

We define three semantic models for actor computation starting with a generalization to open systems of Clinger's event diagram model, and forming two abstractions: interaction diagrams and interaction paths. An algebra is defined on each semantic domain with operations for parallel composition, hiding of internal actors, and renaming. We use these models to provide semantics for descriptions of actor components based on actor theories and show that the semantics is a component algebra homomorphism. 1

### Citations

1132 | Actors: a model of concurrent computation in distributed systems - Agha - 1986 |

488 |
Conditional rewriting logic as a unified model of concurrency
- Meseguer
- 1992
(Show Context)
Citation Context ...eralization of the notion of actor structures presented in [15, 14]. They are an abstract framework for executable specification of the behavior of actor system components inspired by rewriting logic =-=[10, 11]-=-. Here we focus on a special form of actor theory we call HBC-actor theories. Details about the more general case may be found in [12]. HBC-actor theories reflect the semantics of the actor systems st... |

415 |
Viewing control structures as patterns of passing messages
- Hewitt
- 1977
(Show Context)
Citation Context ...ents may be added; old components may be replaced or removed; interconnections change over time; and a component has little if any control over its environment. We take the actor model of computation =-=[9, 1, 2]-=- as our starting point. Actors are independent computational agents that interact solely via asynchronous message passing. The actor model provides the basic elements for open distributed computation:... |

227 | A foundation for actor computation
- Agha, Mason, et al.
- 1997
(Show Context)
Citation Context ... needed to provide a basis for specifying and reasoning about components of open distributed systems in a modular way. Purely operational semantics based on transition systems, such as those given in =-=[1, 4]-=-, are simple and intuitive, but too concrete for many purposes. Operational models based on rewriting logic [14] provide a first level of abstraction, defining an equivalence relation on computations ... |

160 |
Concurrent Object-Oriented Programming
- Agha
- 1990
(Show Context)
Citation Context ...aj;j2 = ep 01;2 . For (z.5) we showsi 0 "A 12 ` ae i 12 by induction on i. The other case follows by symmetry for each i. If i = 0 we haves0 0 " A 12 ` ae 0 1 [ ae 0 2 = ae 0 12 by (z.5[0,1]=-=) and (z.5[0,2]). No-=-w, assume a 2si+1 0 " A 12 and show a 2 ae i+1 12 . If a 2si 0 , then we are done by the induction hypothesis and monotonicity of receptionists and externals. Thus we may assume there is some e s... |

84 | Rewriting logic as a semantic framework for concurrency: a progress report
- Meseguer
- 1996
(Show Context)
Citation Context ...eralization of the notion of actor structures presented in [15, 14]. They are an abstract framework for executable specification of the behavior of actor system components inspired by rewriting logic =-=[10, 11]-=-. Here we focus on a special form of actor theory we call HBC-actor theories. Details about the more general case may be found in [12]. HBC-actor theories reflect the semantics of the actor systems st... |

60 |
Laws for Communicating Parallel Processes
- Hewitt, Baker
- 1977
(Show Context)
Citation Context ...d interconnection. In this section we review some of the motivations and basic precepts of the actor model and the laws postulated for actor computation in the early papers of Hewitt and his students =-=[9, 6, 7]. The foun-=-dational objective for the actor model was a "mathematical theory of computation which can represent any kind of discrete behavior that can be physically realized." [9]. One of the applicati... |

59 |
Foundations of actor semantics
- Clinger
- 1981
(Show Context)
Citation Context ...t of structure-global time pairs will be used throughout for sets of structures for which the notion of global time is defined. 34 Actor laws These laws are adaptations of the axioms given by Clinger =-=[7]-=- for event diagrams. They fall into two groups: (Ordering Laws) having to do with the partial order on events; and (Locality Laws), having to do with actor creation and acquaintance relations. Let oed... |

51 | Abstracting Interaction Patterns: A Programming Paradigm for Open Distributed Systems
- Agha
- 1997
(Show Context)
Citation Context ...sactions, security policies, reliable communication, dependability, and real time computation. There are a number of experiments in designing extensions to actor languages that support these features =-=[3]-=-. A next step is to develop semantic models that support these abstractions. An important new aspect that arises here is understanding dynamic composability as well as static composability. One exampl... |

44 |
Interaction semantics for components of distributed systems
- Talcott
- 1996
(Show Context)
Citation Context ...ic models yields a spectrum of equivalence relations that can be used for specification and for reasoning about replacing subcomponents of a system. Interaction path semantics was first introduced in =-=[15]-=- (called simply interaction semantics). In studying this semantics it became clear that in order to give a mathematical characterization of the possible interaction paths of a configuration one needed... |

29 |
Semantics of communicating parallel processes
- Greif
- 1975
(Show Context)
Citation Context ...omputation and their relation to computation and interaction semantics: open event diagrams (OED); and interaction diagrams (ID). Open event diagrams generalize the event diagrams introduced by Greif =-=[8]-=-, used by Hewitt in [9] and formalized by Clinger [7] to the open systems setting, making 4 interactions with the environment explicit. Event diagrams express the view that what is important about an ... |

27 | An actor rewriting theory
- TALCOTT
- 1996
(Show Context)
Citation Context ... a constraint on the operations of C. Note that this requirement implies that interface of an empty component is the empty interface. For static descriptions of actor components we use actor theories =-=[15, 14, 12]-=-. The notion of an actor theory provides an axiomatic characterization of the essential features of actor languages. It reflects the view that an actor's behavior should be specified in terms of the m... |

14 |
A semantically sound actor translation
- Mason, Talcott
- 1997
(Show Context)
Citation Context ... a constraint on the operations of C. Note that this requirement implies that interface of an empty component is the empty interface. For static descriptions of actor components we use actor theories =-=[15, 14, 12]-=-. The notion of an actor theory provides an axiomatic characterization of the essential features of actor languages. It reflects the view that an actor's behavior should be specified in terms of the m... |

13 | Specification diagrams for actor systems
- Smith, Talcott
- 1999
(Show Context)
Citation Context ...nt diagrams or interaction diagrams as an alternative to using traditional temporal languages which are based on global times. A promising approach is the graphical language of specification diagrams =-=[13]-=-. A second direction is extensions of the basic actor model. Many computational abstractions that are important for dynamic adaptive distributed open systems are not directly supported. Examples are s... |

10 | Actor systems for real-time computation
- Baker
- 1978
(Show Context)
Citation Context .... Clinger's formalization treats incomplete event diagrams that represent stages in the generation of an actor computation. This is accomplished by including in event diagrams a set of pending events =-=[5]-=- representing messages that have been sent, but not yet delivered. A complete diagram is one in which the set of pending events is empty. To construct a complete, possibly infinite, computation from f... |