Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bunke, H.: Programmed Graph Grammars, in /CER 79/, pp.155–166
Claus, V. — Ehrig, H. — Rozenberg, G.: Graph Grammars and Their Application to Computer Science and Biology, Int. Workshop, Springer LNCS 73, 1979
Ehrig, H.: Introduction to the Algebraic Theory of Graph Grammars, in /CER 79/, pp. 1–69
Ehrig, H.: Algebraic Specifications with Requirements, Proc. CAAP’83, Springer LNCS 112 (1981), pp. 1–24
Ehrig, H. — Kreowski, H.-J.: Applications of Graph Grammar Theory to Consistency, Synchronisation and Scheduling in Data Base Systems, Inf. Systems 5 (1980), pp. 225–238
Ehrig, H. — Mahr, B.: Fundamentals of Algebraic Specifications 1: Equations and Initial Semantics, EATCS-Mono-graphs Vol. 6, Springer Verlag 1985
Ehrig, H. — Nagl, M. — Rozenberg, G.: Graph Grammars and Their Application to Computer Science, 2nd Int. Workshop, Springer LNCS 153, 1983
Ehrig, H. — Pfender, M. — Schneider, H.J.: Graph Grammars: An Algebraic Approach, Proc. SWAT 73, pp. 167–180
Gottlieb, C. — Furtado, A.: Data Schemata Based on Directed Graphs, Techn. Report No. 70 (1974), Dept. Comp. Sci., Univ. Toronto
Habel, A. — Kreowski, H.-J.: On Context-free Graph Languages Generated by Edge Replacement, in /ENR 83/, pp. 143–158
Janssens, D. — Rozenberg, G.: On the Structure of Node-Label-Controlled Graph Languages, Information Sciences 20, pp. 191–216 (1980)
Kreowski, H.-J.: A Pumping Lemma for Context-free Graph Languages, in /CER 79/, pp. 270–283
Kreowski, H.-J. — Rozenberg, G.: On Structured Graph Grammars (Part I), Techn. Report No. 1/85, FB Math./Informatik Universitát Bremen, 1985
Lindenmayer, A. — Rozenberg, G.: Automata, Languages, Development, North Holland, 1976
Montanari, U.: Separable Graphs, Planar Graphs and Web Grammars, Inf. Contr. 16, pp. 243–267 (1970)
Rosenfeld, A. — Milgram, D.: Web Automata and Web Grammars, Mach. Intell. 7, pp. 307–324 (1972)
Uesu, T.: A System of Graph Grammars which generates all Recursively Enumerable Sets of Labelled Graphs, Tsukuba J. Math. Vol 2 (1978), pp. 11–26
Wankmüller, F.: Characterization of Graph Classes by Forbidden Structures and Reductions, in /ENR 83/, pp.405–414
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1986 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Ehrig, H., Habel, A. (1986). Graph Grammars with Application Conditions. In: The Book of L. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-95486-3_7
Download citation
DOI: https://doi.org/10.1007/978-3-642-95486-3_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-95488-7
Online ISBN: 978-3-642-95486-3
eBook Packages: Springer Book Archive