A uniform approach to graph rewriting: The pullback approach

  • Michel Bauderon
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1017)


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.


Production Rule Recursive Equation Graph Grammar Categorical Framework Infinite Graph 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    M. Bauderon, Infinite Hypergraphs I. Basic properties, Theor. Comput. Sci 82 (1991) 177–214Google Scholar
  2. 2.
    M. Bauderon, Infinite Hypergraphs II. Systems of recursive equations, Theor. Comput. Sci 103 (1993) 165–190Google Scholar
  3. 3.
    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. Google Scholar
  4. 4.
    M. Bauderon, Parallel rewriting through the pullback approach, in SEGRA-GRA'95, to appear, Elect. Notes in Theor. Comp. Sci. Google Scholar
  5. 5.
    M. Bauderon, B. Courcelle, Graph expressions and graph rewriting, Math. Systems Theory 20 (1987), 83–127CrossRefGoogle Scholar
  6. 6.
    B. Courcelle, An axiomatic definition of context-free rewriting and its applications to NLC graph grammars, Theor. Comput. Sci 55 (1987), 141–181.CrossRefGoogle Scholar
  7. 7.
    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–242Google Scholar
  8. 8.
    J. Engelfriet, G. Rozenberg, A comparison of boundary graph grammars and context-free hypergraph grammars, Inf. Comp. 84, 1990, 163–206Google Scholar
  9. 9.
    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.Google Scholar
  10. 10.
    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)Google Scholar
  11. 11.
    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–69Google Scholar
  12. 12.
    M. Farzan, D.A. Waller, Kronecker products and local joins of graphs, Can. J. Math. Vol. XXIX, No 2 1977, 255–269Google Scholar
  13. 13.
    A. Habel, Hyperedge Replacement: Grammars and Languages, Lect. Notes in Comp Sci N 643, 1992.Google Scholar
  14. 14.
    D. Janssens, G. Rozenberg, On the structure of node-label-controlled graph languages, Inform. Sci. 20 (1980), 191–216.CrossRefGoogle Scholar
  15. 15.
    D. Janssens, G. Rozenberg, Graph grammars with node label controlled rewriting and embedding, Lect. Notes in Comp. Sci. 153 (1982), 186–205.Google Scholar
  16. 16.
    D. Janssens, G. Rozenberg, Graph grammars with neighboorhood-controlled embedding, Theor. Comp. Sci. 21 (1982), 55–74.Google Scholar
  17. 17.
    S. McLane, Categories for the working mathematician, Springer, Berlin, 1971.Google Scholar
  18. 18.
    W. Vogler, On hyperedge replacement and BNLC graph grammars, Discrete Applied Mathematics 46 (1993) 253–273.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1995

Authors and Affiliations

  • Michel Bauderon
    • 1
  1. 1.Laboratoire Bordelais de Recherche en InformatiqueUniversité Bordeaux ITalence CedexFrance

Personalised recommendations