Processes and Local Actions

Abstract Local Action Systems are intended as a unifying framework for a number of types of graph rewriting based on embedding. In the first part of the paper a theory of true concurrent processes for embedding-based graph rewriting is developed, and its possible application to Petri nets is briefly discussed. In the second part different variants of Local Action Systems are discussed, and it is shown how they fit in the framework developed in the first part.

[1]  Hartmut Ehrig,et al.  Graph-Grammars: An Algebraic Approach , 1973, SWAT.

[2]  Dirk Janssens,et al.  ESM Systems and the Composition of Their Computations , 1993, Dagstuhl Seminar on Graph Transformations in Computer Science.

[3]  Dirk Janssens.  Actor grammars and local actions , 1999 .

[4]  Grzegorz Rozenberg,et al.  On the structure of node-label-controlled graph languages , 1980, Inf. Sci..

[5]  Francesca Rossi,et al.  Graph Processes , 1996, Fundam. Informaticae.

[6]  Wolfgang Reisig,et al.  Lectures on Petri Nets I: Basic Models , 1996, Lecture Notes in Computer Science.

[7]  Joost Engelfriet,et al.  Node Replacement Graph Grammars , 1997, Handbook of Graph Grammars.

[8]  Maciej Koutny,et al.  Semantics of Inhibitor Nets , 1995, Inf. Comput..

[9]  Hartmut Ehrig,et al.  Graph Transformations in Computer Science , 1994, Lecture Notes in Computer Science.