# Issues in the practical use of graph rewriting

## Abstract

Graphs are a popular data structure, and graph-manipulation programs are common. Graph manipulations can be cleanly, compactly, and explicitly described using graph-rewriting notation. However, when a software developer is persuaded to try graph rewriting, several problems commonly arise. Primarily, it is difficult for a newcomer to develop a feel for how computations are expressed via graph rewriting. Also, graph-rewriting is not convenient for solving all aspects of a problem: better mechanisms are needed for interfacing graph rewriting with other styles of computation. Efficiency considerations and the limited availability of development tools further limit practical use of graph rewriting. The inaccessible appearance of the graph-rewriting literature is an additional hindrance. These problems can be addressed through a combination of “public relations” work, and further research and development, thereby promoting the widespread use of graph rewriting.

## Keywords

Control Specification Graph Transformation Edge Label Node Label Rule Application## Preview

Unable to display preview. Download preview PDF.

## References

- [Ande77]R. Anderson, “Two Dimensional Mathematical Notation,” in
*Syntactic Pattern Recognition, Applications*, K. S. Fu editor, Springer 1977, pp. 147–177.Google Scholar - [ArJa94]O. Arnold and K. Jantke, “Therapy Plans as Hierarchically Structured Graphs,” in [IWGG94], pp. 338–343.Google Scholar
- [BlFG95]D. Blostein, H. Fahmy, A. Grbavec, “Practical Use of Graph Rewriting,” Technical Report No. 95-373, Computing and Information Science, Queen's University, Jan 1995.Google Scholar
- [Bunk82a]H. Bunke, “Attributed Programmed Graph Grammars and Their Application to Schematic Diagram Interpretation,”
*IEEE Pattern Analysis and Machine Intelligence*, Vol. 4, No. 6, Nov. 1982, pp. 574–582.Google Scholar - [Bunk82b]H. Bunke, “On the Generative Power of Sequential and Parallel Programmed Graph Grammars,”
*Computing*, Vol. 29, 1982, pp. 89–112.Google Scholar - [BuGT91]H. Bunke, T. Glauser, T. Tran, “An Efficient Implementation of Graph Grammars Based on the RETE Matching Algorithm,” in [IWGG91], pp. 174–189.Google Scholar
- [BuHa92]H. Bunke and B. Haller, “Syntactic Analysis of Context-Free Plex Languages for Pattern Recognition,” in
*Structured Document Image Analysis*, Eds. Baird, Bunke, Yamamoto, Springer 1992, pp. 500–519.Google Scholar - [CoTV93]S. Collin, K. Tombre, P. Vaxiviere, “Don't Tell Mom I'm Doing Document Analysis; She Believes I'm in the Computer Vision Field,”
*Proc. Second Intl. Conf. on Document Analysis and Recognition*, Tsukuba, Japan, Oct. 1993, pp. 619–622.Google Scholar - [DoTo88]J. Dolado, F. Torrealdea, “Formal Manipulation of Forrester Diagrams by Graph Grammars,”
*IEEE Trans. Systems, Man and Cybernetics***18**(6), pp. 981–996, Nov 1988.Google Scholar - [EgPM92]J. Egar, A. Puerta, M. Musen, “Automated Interpretation of Diagrams for Specification of Medical Protocols,”
*AAAI Symposium: Reasoning with Diagrammatic Representations*, Stanford University, March 1992, p 189–192.Google Scholar - [EhKr80]H. Ehrig and H. Kreowski, “Applications of Graph Grammar Theory to Consistency, Synchronization, and Scheduling in Data Base Systems,”
*Information Systems*, Vol. 5, pp. 225–238, 1980.Google Scholar - [EhHK92]H. Ehrig, A. Habel, H. Kreowski, “Introduction to Graph Grammars with Applications to Semantic Networks,”
*International Journal of Computers and Mathematical Applications*, Vol. 23, No 6–9, pp. 557–572, 1992.Google Scholar - [EhEn94]H. Ehrig and G. Engels, “Pragmatic and Semantic Aspects of a Module Concept for Graph Transformation Systems,” in [IWGG94], pp. 157–168.Google Scholar
- [EnLS87]G. Engels, C. Lewerentz, W. Schafer, “Graph Grammar Engineering: A Software Specification Method,” in [IWGG87], pp. 186–201.Google Scholar
- [ELNSS92]G. Engels, C. Lewerentz, M. Nagl, W. Schafer, A. Schürr, “Building Integrated Software Development Environments Part 1: Tool Specification,”
*ACM Trans. Software Engineering and Methodology*, Vol. 1, No. 2, Apr. 1992, pp. 135–167.Google Scholar - [FaB193]H. Fahmy and D. Blostein, “A Graph Grammar Programming Style for Recognition of Music Notation,”
*Machine Vision and Applications*, Vol 6, No 2, pp. 83–99, 1993.Google Scholar - [Fahm95]H. Fahmy, “Reasoning in the Presence of Uncertainty via Graph Rewriting,” Ph.D. Thesis, Computing and Information Science, Queen's University, March 1995.Google Scholar
- [Fu82]K. S. Fu,
*Syntactic Pattern Recognition and Applications*, Prentice Hall 1982.Google Scholar - [Gött83]H. Göttler, “Attribute Graph Grammars for Graphics,” in [IWGG83], pp. 130–142.Google Scholar
- [Gött87]H. Göttler, “Graph Grammars and Diagram Editing,” in [IWGG87], pp. 216–231.Google Scholar
- [GöGN91]H. Göttler, J. Gunther, G. Nieskens, “Use Graph Grammars to Design CAD-Systems!” in [IWGG91], pp. 396–410.Google Scholar
- [Gött92]H. Göttler, “Diagram Editors = Graphs + Attributes + Graph Grammars,”
*International Journal of Man-Machine Studies*, Vol 37, No 4, Oct. 1992, pp. 481–502.Google Scholar - [GöHi94]H. Göttler and B. Himmelreich, “Modeling of Transactions in Object-Oriented Databases by Two-level Graph Productions,” in [IWGG94], pp. 151–156.Google Scholar
- [GrB195]A. Grbavec and D. Blostein, “Mathematics Recognition Using Graph Rewriting,”
*Third International Conference on Document Analysis and Recognition*, Montreal, Canada, August 1995, pp. 417–421.Google Scholar - [Hare88]D. Harel, “On Visual Formalisms,”
*Communications of the ACM*, Vol 31, No 5, pp. 514–530, May 1988.Google Scholar - [HeSa86]T. Henderson and A. Samal, “Shape Grammar Compilers,”
*Pattern Recognition*, Vol 19, No 4, pp. 279–288, 1986.Google Scholar - [Hims91]M. Himsolt, “GraphEd: An Interactive Tool for Developing Graph Grammars,” in [IWGG91], pp. 61–65.Google Scholar
- [Hims94]M. Himsolt, “Hierarchical Graphs for Graph Grammars,” in [IWGG94], pp. 67–70.Google Scholar
- [IWGG79]
*Intl. Workshop on Graph Grammars and Their Application to Computer Science and Biology*, LNCS Vol. 73, V. Claus, H. Ehrig, G. Rozenberg Eds, Springer, 1979.Google Scholar - [IWGG83]
*Second Intl. Workshop on Graph Grammars and Their Application to Computer Science*, LNCS Vol. 153, H. Ehrig, M. Nagl, G. Rozenberg Eds, Springer, 1983.Google Scholar - [IWGG87]
*Third Intl. Workshop on Graph Grammars and Their Application to Computer Science*, LNCS Vol. 291, Ehrig, Nagl, Rozenberg, Rosenfeld Eds, Springer, 1987.Google Scholar - [IWGG91]
*Fourth Intl. Workshop on Graph Grammars and Their Application to Computer Science*, LNCS Vol. 532, H. Ehrig, H. Kreowski, G. Rozenberg Eds, Springer, 1991.Google Scholar - [IWGG94]Pre-proceedings of the
*Fifth Intl. Workshop on Graph Grammars and Their Application to Computer Science*, Williamsburg, VA, Nov. 1994. Full versions of selected papers appear in this volume.Google Scholar - [KaLG91]S. Kaplan, J. Loyall, S. Goering, “Specifying Concurrent Languages and Systems with Δ-grammars,” in [IWGG91], pp. 475–489.Google Scholar
- [Kaul83]M. Kaul, “Parsing of Graphs in Linear Time,” in [IWGG83], pp. 206–218.Google Scholar
- [Klau94]C. Klauck, “Heuristic Driven Chart-Parsing,” in [IWGG94], pp. 107–113.Google Scholar
- [KrRo90]H.-J. Kreowski, G. Rozenberg, “On Structured Graph Grammars, I, II”
*Information Sciences*, Vol. 52, 1990, pp. 185–210, 210–246.Google Scholar - [LiFu89]W. Lin and K.S. Fu, “A Syntactic Approach to Three-Dimensional Object Recognition,”
*IEEE Trans. Systems Man and Cybernetics*,**16**(3), May 1986, pp. 405–422.Google Scholar - [LöBe93]M. Löwe, M. Beyer, “AGG — An Implementation of Algebraic Graph Rewriting,”
*Fifth Intl. Conf. on Rewriting Techniques and Applications*, Montreal, Canada, June 1993, in LNCS 690, Springer, pp. 451–456.Google Scholar - [LoKa92]J. Loyall and S. Kaplan, “Visual Concurrent Programming with Delta-Grammars,”
*Journal of Visual Languages and Computing*, Vol 3, 1992, pp. 107–133.Google Scholar - [MaKl92]J. Mauss and C. Klauck, “A Heuristic Driven Parser Based on Graph Grammars for Feature Recognition in CIM,”
*Advances in Structural and Syntactic Pattern Recognition*, Ed. H. Bunke, World Scientific, 1992, pp. 611–620.Google Scholar - [NaSc91]M. Nagl, A. Schürr, “A Specification Environment for Graph Grammars,” in [IWGG91], pp. 599–609.Google Scholar
- [Panel91]“Panel Discussion: The Use of Graph Grammars in Applications,” in [IWGG91], pp. 41–60.Google Scholar
- [Pfei90]J. Pfeiffer, “Using Graph Grammars for Data Structure Manipulation,”
*Proc. 1990 IEEE Workshop on Visual Languages*, pp. 42–47.Google Scholar - [ReSc94]J. Rekers and A. Schürr, “Parsing for Context-Sensitive Graph Grammars,” in [IWGG94], pp. 89–94.Google Scholar
- [Roze87]G. Rozenberg, “An Introduction to the NLC Way of Rewriting Graphs,” in [IWGG87], pp. 55–70.Google Scholar
- [Schü91]A. Schürr, “PROGRESS: A VHL-Language Based on Graph Grammars,” in [IWGG91], pp. 641–659.Google Scholar
- [Schn93]H. Schneider, “On categorical graph grammars integrating structural transformations and operations on labels,”
*Theoretical Computer Science*, Vol. 109, 1993, pp. 257–275.Google Scholar - [SiGJ93]G. Sindre, B. Gulla, H. Jokstad, “Onion Graphs: Aesthetics and Layout,”
*Proc. 1993 IEEE Symposium on Visual Languages*, Bergen, Norway, Aug. 1993, pp. 287–291.Google Scholar - [Strz90]T. Strzalkowski, “Reversible Logic Grammars for Natural Language Parsing and Generation,”
*Canadian Computational Intelligence Journal*,**6**(3), pp. 145–171, 1990.Google Scholar - [Taen94]G. Taentzer, “Hierarchically Distributed Graph Transformations,” in [IWGG94], pp. 430–435.Google Scholar
- [ToKa94]W. Tolone and S. Kaplan, “A Semantic Definition for Introspect using Δ-Grammars,” in [IWGG94], pp. 418–423.Google Scholar
- [ZüSc92]A. Zündorf and A. Schürr, “Nondeterministic Control Structures for Graph Rewriting Systems,”
*Proc 17th Intl. Workshop on Graph-Theoretic Concepts in Computer Science WG91*, LNCS Vol 570, Springer Verlag, 1992.Google Scholar - [Zünd94]A. Zündorf, “Graph Pattern Matching in PROGRES,” in [IWGG94], pp. 174–178.Google Scholar