Abstract
Most of the works in the theory of graph rewriting can be put into two main categories: edge (or hyperedge) rewriting and node rewriting. Each has been described by a specific formalism, both have given rise to many significant developments and many works have been devoted to the comparison of both approaches. In this paper, we describe a new categorical formalism, which provides a common framework to both approaches and makes their comparison much clearer.
This work has been supported by the Esprit BRA ”;Computing with graph transformations”;
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
M. Bauderon, Infinite Hypergraphs I. Basic properties, Theor. Comput. Sci 82 (1991) 177–214
M. Bauderon, Infinite Hypergraphs II. Systems of recursive equations, Theor. Comput. Sci 103 (1993) 165–190
M. Bauderon, A categorical approach to vertex replacement: the generation of infinite graphs, 5th International Conference on Graph Grammars and their applications to Computer Science, Williamsburg, November 1994, To appear, Lect. Notes in Comp. Sci.
M. Bauderon, Parallel rewriting through the pullback approach, in SEGRA-GRA'95, to appear, Elect. Notes in Theor. Comp. Sci.
M. Bauderon, B. Courcelle, Graph expressions and graph rewriting, Math. Systems Theory 20 (1987), 83–127
B. Courcelle, An axiomatic definition of context-free rewriting and its applications to NLC graph grammars, Theor. Comput. Sci 55 (1987), 141–181.
B. Courcelle, Graph rewriting: an algebraic and logic approach, in J. Van Leeuwen, ed, Handbook of Theoretical Computer Science, Vol. B (Elsevier, Amsterdam, 1990) 193–242
J. Engelfriet, G. Rozenberg, A comparison of boundary graph grammars and context-free hypergraph grammars, Inf. Comp. 84, 1990, 163–206
J. Engelfriet, G. Rozenberg, Graph grammars based on node rewriting: an introduction to NLC grammars, Lect. Notes in Comp Sci N 532, 1991, 12–23.
J. Engelfriet, L. Heyker, G. Leih, Context free graph languages of bounded degree are generated by apex graph grammars, Acta Informatica 31, 341–378 (1994)
H. Ehrig, Introduction of the algebraic theory of graph grammars, in Graph Grammars and their applications to Computer Science, Lect. Notes in Comp Sci N 73, 1979, 1–69
M. Farzan, D.A. Waller, Kronecker products and local joins of graphs, Can. J. Math. Vol. XXIX, No 2 1977, 255–269
A. Habel, Hyperedge Replacement: Grammars and Languages, Lect. Notes in Comp Sci N 643, 1992.
D. Janssens, G. Rozenberg, On the structure of node-label-controlled graph languages, Inform. Sci. 20 (1980), 191–216.
D. Janssens, G. Rozenberg, Graph grammars with node label controlled rewriting and embedding, Lect. Notes in Comp. Sci. 153 (1982), 186–205.
D. Janssens, G. Rozenberg, Graph grammars with neighboorhood-controlled embedding, Theor. Comp. Sci. 21 (1982), 55–74.
S. McLane, Categories for the working mathematician, Springer, Berlin, 1971.
W. Vogler, On hyperedge replacement and BNLC graph grammars, Discrete Applied Mathematics 46 (1993) 253–273.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bauderon, M. (1995). A uniform approach to graph rewriting: The pullback approach. In: Nagl, M. (eds) Graph-Theoretic Concepts in Computer Science. WG 1995. Lecture Notes in Computer Science, vol 1017. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60618-1_69
Download citation
DOI: https://doi.org/10.1007/3-540-60618-1_69
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60618-5
Online ISBN: 978-3-540-48487-5
eBook Packages: Springer Book Archive