Equivalence of Computations in Actor Grammars

Abstract Actor grammars were introduced by Janssens and Rozenberg (1987) as a formal model for actor systems. In an actor grammar, configurations of an actor system are represented by graphs, and the dynamic behavior of an actor system is described by graph rewriting. In this way, the problem of understanding the dynamic evolution of configurations in an actor system is translated into the problem of understanding the rewriting processes of an actor grammar. The structure of these rewriting processes is investigated by Janssens and Rozenberg (1989, 1990). The present paper continues the research on this topic; more precisely, it is demonstrated that the notion of a structured transformation, introduced by Janssens and Rozenberg (1989), arises in a natural way from the notion of a subcomputation, introduced by Janssens and Rozenberg (1990). All required notions about actor grammars are introduced in the paper.

[1]  Carl Hewitt,et al.  Viewing Control Structures as Patterns of Passing Messages , 1977, Artif. Intell..

[2]  Gul A. Agha,et al.  ACTORS - a model of concurrent computation in distributed systems , 1985, MIT Press series in artificial intelligence.

[3]  Hartmut Ehrig,et al.  Tutorial introduction to the algebraic approach of graph grammars , 1986, Graph-Grammars and Their Application to Computer Science.

[4]  Grzegorz Rozenberg,et al.  Basic notions of actor grammars: A graph grammar model for actor computation , 1986, Graph-Grammars and Their Application to Computer Science.

[5]  Grzegorz Rozenberg.  Behaviour of Elementary Net Systems , 1986 .

[6]  Carl Hewitt,et al.  Laws for Communicating Parallel Processes , 1977, IFIP Congress.

[7]  Simon M. Kaplan,et al.  Visual Concurrent Object-Based Programming in GARP , 1989, PARLE.