Abstract
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.
Partially supported by the EC TMR Network GETGRATS (General Theory of Graph Transformation Systems) and Esprit Working Group APPLIGRAPH through Universitaire Instelling Antwerpen.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
K. Barthelmann, Describing Göttler’s Operational Graph Grammars with Pushouts, in “4th International Workshop on Graph Grammars and Their Application to Computer Science” Springer Lecture Notes in Computer Science 532 (1991), 98–112.
P. Baldan, A. Corradini, H. Ehrig, M. Löwe, U. Montanari and F. Rossi, Concurrent Semantics of Algebraic Graph Transformations, in “Handbook of Graph Grammars and Computing by Graph Transformation”, Vol. 3, World Scientific (1999), 107–187.
A. Corradini, U. Montanari and F. Rossi, Graph Processes, Fundamenta Informaticae, 26 (1996), 241–265.
A. Corradini, H. Ehrig, R. Heckel, M. Löwe, U. Montanari and F. Rossi, Algebraic Approaches to Graph Transformation, in “Handbook of Graph Grammars and Computing by Graph Transformation”, Vol. 1, World Scientific (1997), 163–245.
H. Ehrig, M. Pfender and H.J. Schneider, Graph-Grammars: an Algebraic Approach, In “Proceedings IEEE Conf. on Automata and Switching Theory”, 167–180, 1973.
J. Engelfriet and G. Rozenberg, Node Replacement Graph Grammars, in “Handbook of Graph Grammars and Computing by Graph Transformation”, Vol. 1, World Scientific, 1–94, 1997.
D. Janssens, Actor Grammars and Local Actions, in Handbook of Graph Grammars and Computing by Graph Transformation, Vol. 3, World Scientific (1999), 57–106.
D. Janssens and G. Rozenberg, On the Structure of Node Label Controlled Graph Languages, Information Sciences 20 (1980), 191–216.
D. Janssens and N. Verlinden, A Framework for ESM and NLC: Local Action Systems, in “6th International Workshop on Theory and Aplication of Graph Transformation”, Springer Lecture Notes in Computer Science 1764 (2000), 194–214.
H.-J. Kreowski, Manipulation von Graphmanipulationen, PhD Thesis, Technische Universität Berlin (1977).
H.-J. Kreowski, Is Parallelism Already Concurrency? Part 1: Derivations in Graph Grammars, in “3rd International Workshop on Graph Grammars and Their Application to Computer Science”, Springer Lecture Notes in Computer Science 291 (1987), 343–360.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Janssens, D. (2002). Local Action Systems and DPO Graph Transformation. In: Brauer, W., Ehrig, H., Karhumäki, J., Salomaa, A. (eds) Formal and Natural Computing. Lecture Notes in Computer Science, vol 2300. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45711-9_10
Download citation
DOI: https://doi.org/10.1007/3-540-45711-9_10
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43190-9
Online ISBN: 978-3-540-45711-4
eBook Packages: Springer Book Archive