Abstract
Actor systems are a model of massively parallel systems based on asynchronous message passing. This paper presents a formalism for a restricted version of actor systems in the framework of graph grammars. To this aim actor grammars are introduced, motivated, and illustrated by examples. Some of the basic properties pertinent to graph transformations in actor grammars are discussed.
Similar content being viewed by others
References
G. A. Agha,Actors: A Model of Concurrent Computation in Distributed Systems, M.I.T. Press, Cambridge, MA, 1986.
D. B. Benson, Semantic Preserving Translations,Math. Systems Theory,8 (1974), 105–126.
W. Brauer, W. Reisig, and G. Rozenberg, eds.,Advances in Petri Nets 1986, Vols. I and II, Lecture Notes in Computer Science, Vols. 254 and 255, Springer-Verlag, Berlin, 1987.
W. D. Clinger, Foundations of Actor Semantics, Ph.D. Thesis, Massachusetts Institute of Technology, 1981. Available as Technical Report 633, AI Lab., Massachusetts Institute of Technology.
H. Ehrig, Tutorial Introduction to the Algebraic Approach of Graph Grammars, inGraph Grammars and Their Application to Computer Science (H. Ehrig, M. Nagl, G. Rozenberg, and A. Rosenfeld, eds.), Lecture Notes in Computer Science, Vol. 291, Springer-Verlag, Berlin, 1987, pp. 3–14.
H. Ehrig, M. Nagl, G. Rozenberg, and A. Rosenfeld, eds.,Graph Grammars and Their Application ot Computer Science, Lecture Notes in Computer Science, Vol. 291, Springer-Verlag, Berlin, 1987.
C. Hewitt, Viewing Control Structures as Patterns of Passing Messages,J. Artificial Intel.,8 (1977), 323–364.
C. Hewitt and H. Baker, Laws for Communicating Parallel Processes,Proc. IFIP 77, Toronto, 1977, pp. 987–992.
G. Hotz, Eindeutigkeit und Mehrdeutigkeit Formaler Sprachen,Elektron. Informationsverarb. Kybernet.,2 (1966), 235–246.
D. Janssens and G. Rozenberg, Basic Notions of Actor Grammars: A Graph Grammar Model for Actor Computation, inGraph Grammars and Their Application to Computer Science (H. Ehrig, M. Nagl, G. Rozenberg and A. Rosenfeld, eds.), Lecture Notes in Computer Science, Vol. 291, Springer-Verlag, Berlin, 1987, pp. 280–298.
D. Janssens and G. Rozenberg, The Destination—Normal Form for Actor Grammars, in preparation.
H. J. Kreowski, Parallelism and Concurrency in Graph Grammars,Bull. EATCS,25 (1987), 63–79.
H. Lieberman, A Preview of Act 1, Technical Report 625, AI Lab., Massachusetts Institute of Technology, 1981.
G. Rozenberg, An Introduction to the NLC Way of Rewriting Graphs, inGraph Grammars and Their Application to Computer Science (H. Ehrig, M. Nagl, G. Rozenberg, and A. Rosenfeld, eds.), Lecture Notes in Computer Science, Vol. 291, Springer-Verlag, Berlin, 1987, pp. 55–66.
D. Theriault, Issues in the Design and Implementation of ACT 2, Technical Report 728, AI Lab., Massachusetts Institute of Technology, 1983.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Janssens, D., Rozenberg, G. Actor grammars. Math. Systems Theory 22, 75–107 (1989). https://doi.org/10.1007/BF02088293
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF02088293