Advertisement

Trace semantics for actor systems

  • Vasco Vasconcelos
  • Mario Tokoro
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 612)

Abstract

The theory of traces is used to describe the behavior of actor systems. The semantics is built from two simple concepts: a set of events representing the reception of messages by objects, and a binary symmetric and irreflexive relation on events—independence—representing permissible concurrency. Causality, the dual notion of concurrency, is expressed by the dependence relation—the complement of independence. A particular execution of a system is described by a trace: a labeled acyclic graph where nodes are labeled with events and the only edges are between nodes labeled with dependent events. The behavior of a system is viewed as the set of traces representing all possible executions. Finally, a composition operation on systems and a synchronization operation on behaviors are presented: they allow to derive the behavior of complex systems from the behavior of its components.

Keywords

Actor System Initial Configuration Dependence Graph Sequential Transition Independence Relation 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    J. Aalbersg and G. Rozenberg. Theory of traces. Theoretical Computer Science, 60:1–82, 1988.Google Scholar
  2. [2]
    Gul Agha. Actors: A model of concurrent computation in distributed systems. The MIT Press, Cambridge, MA, 1986.Google Scholar
  3. [3]
    Gérard Boudol and Ilaria Castellani. Three equivalent semantics for CCS. In Semantics of Systems of Concurrent Processes, Lecture Notes in Computer Science 469, pages 96–141, Springer-Verlag, April 1990.Google Scholar
  4. [4]
    William Clinger. Foundations of actor semantics. AI-TR 633, M.I.T. A.I. Laboratory, Cambridge, MA, May 1981.Google Scholar
  5. [5]
    Volker Diekert. Combinatorics on traces. Volume 454 of Lecture Notes in Computer Science, Springer-Verlag, 1990.Google Scholar
  6. [6]
    Carl Hewitt and Henry Baker. Laws for communicating parallel processes. In IFIP, pages 987–992, August 1977.Google Scholar
  7. [7]
    Antoni Mazurkiewicz. Basic notions of trace theory. In Linear time, Branching Time and Partial Orders in Logics and Models for Concurrency, Lecture Notes in Computer Science 354, pages 285–363, Springer-Verlag, May 1988.Google Scholar
  8. [8]
    Antoni Mazurkiewicz. Concurrent program schemes and their interpretation. DAIMI Rept. PB 78, Aarhus University, Aarhus, 1977.Google Scholar
  9. [9]
    José Meseguer. Conditional rewriting logic as a unified model of concurrency. SRI-CSL 91-05, SRI-International, Menlo Park, CA, February 1991.Google Scholar
  10. [10]
    José Meseguer. A logical theory of concurrent objects. In OOPSLA/ECOOP, pages 101–115, ACM Press, October 1990.Google Scholar
  11. [11]
    Robin Milner. Communication and concurrency. C.A.R. Hoare Series Editor, Prentice-Hall Int., 1989.Google Scholar
  12. [12]
    M. Nielsen, G. Plotkin, and G. Winskel. Petri nets, event structures and domains. Theoretical Computer Science, 13:85–108, 1981.Google Scholar
  13. [13]
    C. A. Petri. Non-sequential processes. GMD-ISF 77-S, Gesselschaft Math., Datenverarb., St. Augustin, 1977.Google Scholar
  14. [14]
    Gordon Plotkin. A structural approach to operational semantics. Daimi FN 91, Aarhus University, 1981.Google Scholar
  15. [15]
    Vaughan Pratt. Modeling concurrency with partial orders. International Journal of Parallel Programming, 15(1):33–71, 1986.Google Scholar
  16. [16]
    Vasco T. Vasconcelos. Trace semantics for concurrent objects. February 1992. To appear as a technical report, Dep. of Computer Science, Keio University.Google Scholar
  17. [17]
    G. Winskel. An introduction to event structures. In Linear time, Branching Time and Partial Orders in Logics and Models for Concurrency, Lecture Notes in Computer Science 354, pages 364–397, Springer-Verlag, May 1988.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1992

Authors and Affiliations

  • Vasco Vasconcelos
    • 1
  • Mario Tokoro
    • 1
    • 2
  1. 1.Department of Computer ScienceKeio UniversityYokohamaJapan
  2. 2.Sony Computer Science Laboratory Inc.TokyoJapan

Personalised recommendations