Pullback as a Generic Graph Rewriting Mechanism

Applied Categorical Structures

Volumn 9, Issue 1, 2001, Pages 65-82

  Bauderon, Michel ^a   Jacquet, Hélène ^b  

^a UNIVERSITÉ BORDEAUX 1   (France)

^b NONE   (France)

Author keywords

Graph rewriting; Pullback

Indexed keywords

EID: 0042191635     PISSN: 09272852     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1008610714027     Document Type: Article

References (25)

1. Asperti, A. and Longo, G.: Categories, Types, and Structures. An Introduction to Category Theory for the Working Computer Scientist, MIT Press, 1991.
2. Barr, M. and Wells, C. F.: Category Theory for Computing Science, Prentice-Hall, 1990.
3. Bauderon, M.: A categorical approach to vertex replacement: The generation of infinite graphs, in [12], pp. 27-37.
4. Bauderon, M.: A uniform approach to graph rewriting: The pullback approach, in Proceedings WG'95, Lecture Notes in Comput. Sci. 1017, 1995, pp. 101-115.
5. Bauderon, M.: Parallel rewriting through the pullback approach, in SEGRAGRA'95, Elect. Notes in Theor. Comput. Sci. 2, 1995.
6. Bauderon, M. and Courcelle, B.: Graph expressions and graph rewriting, Math. Systems Theory 20 (1987), 83-127.
7. Bauderon, M. and Jacquet, H.: Node rewriting in hypergraphs, in Proceedings WG'96, Lecture Notes in Comput. Sci. 1197, pp. 31-43.
8. Bauderon, M. and Jacquet, H.: Node rewriting in graphs and hypergraphs: A categorical framework, Research Report LaBRI-1134, submitted.
9. Courcelle, B.: An axiomatic definition of context-free rewriting and its applications to NLC graph grammars, Theoret. Comput. Sci. 55 (1987), 141-181.
10. Courcelle, B.: Graph rewriting: An algebraic and logic approach, in J. Van Leeuwen (ed.), Handbook of Theoretical Computer Science, Vol. B, Elsevier, Amsterdam, 1990, pp. 193-242.
11. Courcelle, B., Engelfriet, J. and Rozenberg, G.: Handle-rewriting hypergraph grammars, J. Comput. System Sci. 46 (1993), 218-270.
12. Cuny, J., Ehrig, H., Engels, G. and Rozenberg G. (eds), 5th International Conference on Graph Grammars and their Applications to Computer Science, Williamsburg, November 1994, Lecture Notes in Comput. Sci. 1073, 1996.
13. Engelfriet, J. and Rozenberg, G.: A comparison of boundary graph grammars and context-free hypergraph grammars, Inform. and Comput. 84 (1990), 163-206.
14. Engelfriet, J. and Rozenberg, G.: Graph grammars based on node rewriting: An introduction to NLC grammars, Lecture Notes in Comput. Sci. 532 (1991), 12-23.
15. Engelfriet, J., Heyker, L. and Leih, G.: Context free graph languages of bounded degree are generated by apex graph grammars, Acta Informatica 31 (1994), 341-378.
16. Ehrig, H.: Introduction of the algebraic theory of graph grammars, in Graph Grammars and their Applications to Computer Science, Lecture Notes in Comput. Sci. 73, 1979, pp. 1-69.
17. Habel, A.: Hyperedge Replacement: Grammars and Languages, Lecture Notes in Comput. Sci. 643, 1992.
18. Janssens, D. and Rozenberg, G.: On the structure of node-label-controlled graph languages, Inform. Sci. 20 (1980), 191-216.
19. Janssens, D. and Rozenberg, G.: Graph grammars with node label controlled rewriting and embedding, Lecture Notes in Comput. Sci. 153 (1982), 186-205.
20. Janssens, D. and Rozenberg, G.: Graph grammars with neighbourhood-controlled embedding, Theoret. Comput. Sci. 21 (1982), 55-74.
21. Kim, C. and Jeong, T. E.: HRNCE Grammars, - A hypergraphs generating system with an eNCE way of rewriting, in [12], pp. 383-396.
22. Klempien-Hinrichs, R.: Node replacement in hypergraphs: Simulation of hyperedge replacement and decidability of confluence, in [12], pp. 397-411.
23. Klempien-Hinrichs, R.: Net refinement by pullback rewriting, Research Report LaBRI-1175, to appear in FOSSACS'98.
24. McLane, S.: Categories for the Working Mathematician, Springer, Berlin, 1971.
25. Vogler, W.: On hyperedge replacement and BNLC graph grammars, Discrete Appl. Math. 46 (1993), 253-273.