Structured transformations and computation graphs for actor grammars
Actor Grammars are a model of actor systems based on graph rewriting. Computation graphs model rewriting processes in actor grammars, and hence, computations in actor systems. The relationship between computation graphs and structured transformations, as introduced in [JR 89], is investigated. A structured transformation may be viewed as a description of the external effect of of a computation described by a computation graph.
KeywordsActor systems Graph grammars Concurrency Processes
Unable to display preview. Download preview PDF.
- [A 86]G. A. Agha, Actors: A Model of Concurrent Computation in Distributed Systems, M.I.T. Press, Cambridge, MA, 1986.Google Scholar
- [H 77]
- [JLR 90]D. Janssens, M. Lens and G. Rozenberg, Computation Graphs for Actor Grammars, Technical Report, Dept. Mathematics and Computer Science, Vrije Universiteit Brussel, V.U.B. (1990).Google Scholar
- [JR 87]D. Janssens and G. Rozenberg, Basic Notions of Actor Grammars: a Graph Grammar Model for Actor Computation, in Graph Grammars and Their Application to Computer Science, Lecture Notes in Computer Science, Vol. 291, Springer-Verlag, Berlin, 1987, 280–298.Google Scholar
- [JR 89]
- [R 87]G. Rozenberg, Behaviour of Elementary Net Systems, in Advances in Petri Nets 1986, Part I, Lecture Notes in Computer Science, Vol. 254, Springer-Verlag, Berlin, 1987, 60–94.Google Scholar