Graph Grammars with Application Conditions

The algebraic approach of graph grammars is extended by a very general notion of application conditions which can be defined separately for each production. This extended approach is applied to a small library system in order to show the flexibility of this concept for the design of systems in computer science and related areas. In addition to the general concept we study some special cases of graph grammars with application conditions with respect to their generative power. Finally we state some facts how to extend known results in the algebraic theory of graph grammars to the case with application conditions.

[1]  Hartmut Ehrig,et al.  Fundamentals of Algebraic Specification 1: Equations and Initial Semantics , 1985 .

[2]  Hartmut Ehrig,et al.  Graph-Grammars: An Algebraic Approach , 1973, SWAT.

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

[4]  Hartmut Ehrig,et al.  Introduction to the Algebraic Theory of Graph Grammars (A Survey) , 1978, Graph-Grammars and Their Application to Computer Science and Biology.

[5]  Frank Wankmüller.  Characterization of graph classes by forbidden structures and reductions , 1982, Graph-Grammars and Their Application to Computer Science.

[6]  Annegret Habel,et al.  On context-free gragh languages generated by edge replacement , 1982, Graph-Grammars and Their Application to Computer Science.

[7]  Ugo Montanari,et al.  Separable Graphs, Planar Graphs and Web Grammars , 1970, Inf. Control..

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

[9]  Horst Bunke.  Programmed Graph Grammars , 1978, Graph-Grammars and Their Application to Computer Science and Biology.

[10]  Grzegorz Rozenberg,et al.  On the structure of node-label-controlled graph languages , 1980, Inf. Sci..

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

[12]  T. Uesu.  A system of graph grammars which generates all recursively enumerable sets of labelled graphs , 1978 .

[13]  Hans-Jörg Kreowski.  A Pumping Lemma for Context-Free Graph Languages , 1978, Graph-Grammars and Their Application to Computer Science and Biology.

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