Fundamenta Informaticae - Special issue on graph transformations
Node replacement graph grammars
Handbook of graph grammars and computing by graph transformation
Algebraic approaches to graph transformation. Part I: basic concepts and double pushout approach
Handbook of graph grammars and computing by graph transformation
Actor grammars and local actions
Handbook of graph grammars and computing by graph transformation
A Framework for NLC and ESM: Local Action Systems
TAGT'98 Selected papers from the 6th International Workshop on Theory and Application of Graph Transformations
Is parallelism already concurrency? Part 1: Derivations in graph grammars
Proceedings of the 3rd International Workshop on Graph-Grammars and Their Application to Computer Science
Describing Göttler's Operational Graph Grammars with Pushouts
Proceedings of the 4th International Workshop on Graph-Grammars and Their Application to Computer Science
| Hi-index | 0.00 |
A comparison between DPO graph rewriting and Local Action Systems is presented. It is shown that, as far as the sequential behaviour is concerned, each Local Action Systems can be simulated by a set of Double Pushout productions and vice versa. The encoding used is fairly straightforward, and it is easy to give conditions under which it preserves the finiteness of the sets of productions involved. As far as the sequential behaviour is concerned, it is shown that the situation is more complicated, and that the constructions presented are not satisfactory in the sense that atomic steps which are parallel independent in one system do not give rise to parallel independent steps in the simulating system.