Abstract
We show how graph rewriting can be described with a single pushout in a suitable category of graphs, and compare our result with the conventional approach which uses double pushouts.
Chapter PDF
Similar content being viewed by others
References
H. Ehrig, H. Pfender and H.J. Schneider, Graph grammars: an algebraic approach, in: Proc. 14th Ann. Conf. on Switching and Automata Theory (1973) 167–180.
H. Ehrig, Introduction to the algebraic theory of graph grammars (a survey), in: V. Claus, H. Ehrig and G. Rozenberg, eds., Graph grammars and their application to Computer Science and Biology, Lecture Notes in Computer Science 73 (Springer, Berlin, 1979) 1–69.
J.C. Raoult, On graph rewritings, Theoret. Comput. Sci. 32 (1984) 1–24.
R. Kennaway, On "On graph rewritings", Theoret. Comput. Sci. 52 (1987) 37–58.
P.M. van den Broek, Comparison of two graph-rewrite systems, Theoret. Comput. Sci. 61 (1988) 67–81.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1991 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
van den Broek, P.M. (1991). Algebraic graph rewriting using a single pushout. In: Abramsky, S., Maibaum, T.S.E. (eds) TAPSOFT '91. CAAP 1991. Lecture Notes in Computer Science, vol 493. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-53982-4_6
Download citation
DOI: https://doi.org/10.1007/3-540-53982-4_6
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-53982-7
Online ISBN: 978-3-540-46563-8
eBook Packages: Springer Book Archive