Issues in the Practical Use of Graph Rewriting

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.

[1]  Gabriele Taentzer,et al.  Hierarchically Distributed Graph Transformation , 1994, TAGT.

[2]  Manfred Nagl,et al.  A Specification Environment for Graph Grammars , 1990, Graph-Grammars and Their Application to Computer Science.

[3]  Dorothea Blostein,et al.  Reasoning in the presence of uncertainty via graph rewriting , 1995 .

[4]  Hartmut Ehrig,et al.  Graph Grammars and Their Application to Computer Science , 1991, Lecture Notes in Computer Science.

[5]  Manfred Kaul.  Parsing of graphs in linear time , 1982, Graph-Grammars and Their Application to Computer Science.

[6]  Simon M. Kaplan,et al.  Visual concurrent programming with Δ-grammars , 1992, J. Vis. Lang. Comput..

[7]  Manfred Nagl,et al.  Graph-Grammars and Their Application to Computer Science , 1986, Lecture Notes in Computer Science.

[8]  Tomek Strzalkowski,et al.  Reversible logic grammars for natural language parsing and generation , 1990, Comput. Intell..

[9]  Hartmut Ehrig,et al.  Graph-Grammars and Their Application to Computer Science and Biology , 1978, Lecture Notes in Computer Science.

[10]  Hans Jürgen Schneider,et al.  On Categorical Graph Grammars Integrating Structural Transformations and Operations on Labels , 1993, Theor. Comput. Sci..

[11]  Horst Bunke,et al.  Syntactic Analysis of Context-Free Plex Languages for Pattern Recognition , 1992 .

[12]  Manfred Nagl,et al.  Building integrated software development environments. Part I: tool specification , 1992, TSEM.

[13]  Herbert Göttler,et al.  Graph grammars and diagram editing , 1986, Graph-Grammars and Their Application to Computer Science.

[14]  Joseph J. Pfeiffer.  Using graph grammars for data structure manipulation , 1990, Proceedings of the 1990 IEEE Workshop on Visual Languages.

[15]  José Javier Dolado,et al.  Formal manipulation of Forrester diagrams by graph grammars , 1988, IEEE Trans. Syst. Man Cybern..

[16]  David Harel,et al.  On visual formalisms , 1988, CACM.

[17]  Introduction to graph grammars with applications to semantic networks , 1992 .

[18]  Herbert Göttler,et al.  Attributed graph grammars for graphics , 1982, Graph-Grammars and Their Application to Computer Science.

[19]  Horst Bunke,et al.  An Efficient Implementation of Graph Grammars Based on the RETE Matching Algorithm , 1990, Graph-Grammars and Their Application to Computer Science.

[20]  Albert Zündorf,et al.  Graph Pattern Matching in PROGRES , 1994, TAGT.

[21]  Andy Schürr.  PROGRESS: A VHL-Language Based on Graph Grammars , 1990, Graph-Grammars and Their Application to Computer Science.

[22]  Hans-Jörg Kreowski,et al.  On structured graph grammars. II , 1990, Inf. Sci..

[23]  Klaus P. Jantke,et al.  Therapy Plans as Hierarchically Structured Graphs , 1994 .

[24]  King-Sun Fu,et al.  Syntactic Pattern Recognition And Applications , 1968 .

[25]  Hubertus Franke,et al.  An Efficient Implementation of MPI , 1994 .

[26]  Simon M. Kaplan,et al.  Specifying Concurrent Languages and Systems with ???-Grammars , 1993, Graph-Grammars and Their Application to Computer Science.

[27]  Mark A. Musen,et al.  Automated Interpretation of Diagrams for Specification of Medical Protocols , 1992 .

[28]  Christoph Klauck.  Heuristic Driven Chart-Parsing , 1994 .

[29]  Horst Bunke.  Attributed Programmed Graph Grammars and Their Application to Schematic Diagram Interpretation , 1982, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[30]  Thomas C. Henderson,et al.  Shape grammar compilers , 1986, Pattern Recognit..

[31]  Grzegorz Rozenberg.  An introduction to the NLC way of rewriting graphs , 1986, Graph-Grammars and Their Application to Computer Science.

[32]  Wei-Chung Lin,et al.  A Syntactic Approach to Three-Dimensional Object Recognition , 1986, IEEE Transactions on Systems, Man, and Cybernetics.

[33]  R. H. Anderson,et al.  Two-Dimensional Mathematical Notation , 1977 .

[34]  Michael Löwe,et al.  AGG - An Implementation of Algebraic Graph Rewriting , 1993, RTA.

[35]  Michael Himsolt.  GraphEd: An Interactive Tool For Developing Graph Grammars , 1990, Graph-Grammars and Their Application to Computer Science.

[36]  Suzanne Collin,et al.  Don't tell mom I'm doing document analysis; she believes I'm in the computer vision field , 1993, Proceedings of 2nd International Conference on Document Analysis and Recognition (ICDAR '93).

[37]  Herbert Göttler.  Diagram Editors = Graphs + Attributes + Graph Grammars , 1992, Int. J. Man Mach. Stud..

[38]  Gregor Engels,et al.  Graph Grammar Engineering: A Software Specification Method , 1986, Graph-Grammars and Their Application to Computer Science.

[39]  Guttorm Sindre,et al.  Onion graphs: aesthetics and layout , 1993, Proceedings 1993 IEEE Symposium on Visual Languages.

[40]  Herbert Göttler,et al.  Use Graph Grammars to Design CAD-Systems! , 1990, Graph-Grammars and Their Application to Computer Science.

[41]  Dorothea Blostein,et al.  Mathematics recognition using graph rewriting , 1995, Proceedings of 3rd International Conference on Document Analysis and Recognition.

[42]  Manfred Nagl,et al.  Graph-Grammars and Their Application to Computer Science , 1982, Lecture Notes in Computer Science.

[43]  Hartmut Ehrig,et al.  Panel discussion: The use of graph grammars in applications , 1991 .

[44]  Christoph Klauck,et al.  A Heuristic Driven Parser Based on Graph Grammars for Feature Recognition in CIM , 1993 .

[45]  Andy Schürr,et al.  Nondeterministic Control Structures for Graph Rewriting Systems , 1991, WG.

[46]  Hartmut Ehrig,et al.  Pragmatic and Semantic Aspects of a Module Concept for Graph Transformation Systems , 1994, TAGT.

[47]  Hartmut Ehrig,et al.  Applications of Graph Grammar Theory to Consistency, Synchronization and Scheduling in Data Base Systems , 1980, Inf. Syst..