Basic notions of actor grammars
Actor systems are a model of massively parallel systems based on asynchronous message passing. This paper presents a formalism for 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 derivations in actor grammars are discussed.
Key wordsmassive parallelism actor systems neighbourhood controlled embedding handle rewriting actor grammars
Unable to display preview. Download preview PDF.
- [A86]Agha, G.A., Actors: a Model of Concurrent Computation in Distributed Systems, M.I.T. Press (1986).Google Scholar
- [C81]Clinger, W.D., Foundations of Actor Semantics, Ph.D. Thesis, Massachusetts Institute of Technology (1981). Available as technical report 633, M.I.T. AI lab.Google Scholar
- [ENR83]Ehrig, H., Nagl, M. and Rozenberg, G., eds., Graph Grammars and Their Applications to Computer Science, Lecture Notes in Computer Science 153, Springer Verlag. (1983).Google Scholar
- [HK83]Habel, A. and Kreowski, H.J., On context-Free Graph Languages Generated by Edge Replacement, in [ENR83], 143–158.Google Scholar
- [HB77]Hewitt, C. and Baker, H., Laws for Communicating Parallel Processes, IFIP-77, Toronto (1977), 987–992.Google Scholar
- [JR83]Janssens, D. and Rozenberg, G., Graph Grammars with Node-Label Controlled Rewriting and Embedding, in [ENR83], 186–205.Google Scholar
- [L81]Lieberman, H., A Preview of Act 1, technical report 625, M.I.T. AI lab (1981).Google Scholar
- [T83]Theriault, D., Issues in the Design and Implementation of ACT 2, technical report 728, M.I.T. AI lab (1983).Google Scholar