Abstract
Graph grammars in which the generation of graphs using productions and restricting derivation sequences based on the double pushout, recently introduced by H.Ehrig and the author and motivated by modular software design, are shown to have strictly more expressive power than those using derivations based on the single pushout approach of [12]. Furthermore, not being based on the internal structure of graphs, the approach can be immediately generalized to other formalisms, such as algebraic specifications, jungles, etc.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
P.Boehm, H.R.Fonio, A.Habel: Amalgamation of Graph Transformations: a synchronization mechanism. J. Comput. Syst. Sci 34 (1987) 377–408
H.Ehrig: Introduction to the Algebraic Theory of Graph Grammars. First International Workshop on Graph Grammars, Springer Lecture Notes in Computer Science 73 (1979) 1–69
H.Ehrig, A.Habel,H.-J.Kreowski,F.Parisi-Presicce: Parallelism and Concurrency in High Level Replacement Systems. Math. Struct.in Comp. Science 1 (1991) 361–406
H.Ehrig, H.-J.Kreowski, G.Rozenberg (eds): Graph Grammars and their applications to Computer Science. Springer Lecture Notes in Computer Science 532 (1991)
H.Ehrig, M.Nagl, G.Rozenberg (eds): Graph Grammars and their applications to Computer Science. Springer Lecture Notes in Computer Science 153 (1983)
H.Ehrig, M.Nagl, G.Rozenberg, A.Rosenfeld (eds): Graph Grammars and their applications to Computer Science. Springer Lecture Notes in Computer Science 291 (1987)
H.Ehrig, F.Parisi-Presicce: Interactions between Graph Grammars and Modular System Design. Technical Report
H.Ehrig, M.Pfender, H.J.Schneider: Graph Grammars: an algebraic approach. Proc. IEEE Conf. SWAT 73, Iowa City (1973) 167–180
J.R.Kennaway: On On Graph Rewriting. Theoret. Comp. Sci 52 (1987) 37–58
J.R.Kennaway: Graph rewriting in some categories of partial morphisms. in [4].
H.-J.Kreowski, A.Wilharm: Is Parallelism already Concurrency? Part 2: Non sequential Processes in Graph Grammars. in [6].
M.Lowe: Extended Algebraic Graph Transformation. Doctoral Dissertation, Technische Universität Berlin Feb 1991, 180 pages
M.Lowe, H.Ehrig: Algebraic Approach to Graph Transformation Based on Single pushout Derivations. Proc. 16th Workshop Graph Theoretic Concepts in Comp. Sci., Springer Lecture Notes in Computer Science 484 (1990) 338–353
F.Parisi-Presicce: Modular System Design applying Graph Grammar Techniques. Proc. ICALP 89, Springer Lecture Notes in Computer Science 372 (1989) 621–636
F.Parisi-Presicce: A Rule Based Approach to Modular System Design. Proc. 12th Internat. Conf. Soft. Engin. (1990) 202–211
F.Parisi-Presicce: Foundations of Rule-Based Design of Modular Systems. Theoret. Comp. Sci. 83 (1991) 131–155
F.Parisi-Presicce, H.Ehrig, U.Montanari: Graph rewriting with Unification and Composition. in [6].
J.C.Raoult: On Graph Rewriting. Theoret. Comp. Sci. 32 (1984) 1–24
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Parisi-Presicce, F. (1993). Single vs. double pushout derivations of graphs. In: Mayr, E.W. (eds) Graph-Theoretic Concepts in Computer Science. WG 1992. Lecture Notes in Computer Science, vol 657. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-56402-0_52
Download citation
DOI: https://doi.org/10.1007/3-540-56402-0_52
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-56402-7
Online ISBN: 978-3-540-47554-5
eBook Packages: Springer Book Archive