Abstract
In this paper we introduce positive, negative and conditional application conditions for the single and the double pushout approach to graph transformation. To give the reader some intuition how the formalism can be used for specification we consider consistency and an interesting representation for specific conditions, namely (conditional) equations. Using a graph grammar notion without nonterminal graphs, i.e. each derivation step leads to a graph of the generated language, we prove a hierarchy: graph grammars over rules with positive application conditions are as powerful as the ones over rules without any extra application condition. Introducing negative application conditions makes the formalism more powerful. Graph grammars over rules with conditional application conditions are on top of the hierarchy.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
M. Arbib and E.G. Manes. Arrows, Structures, and Functors: The Categorical Imperative. Academic Press, New York, 1975.
H. Ehrig. Introduction to the algebraic theory of graph grammars. In V. Claus, H. Ehrig, and G. Rozenberg, editors, 1st Graph Grammar Workshop, Lecture Notes in Computer Science 73, pages 1–69, 1979.
H. Ehrig and A. Habel. Graph grammars with application conditions. In G. Rozenberg and A. Salomaa, editors, The Book of L, pages 87–100. 1985.
H. Ehrig, A. Habel, H.-J. Kreowski, and F. Parisi-Presicce. From graph grammars to High Level Replacement Systems. pages 269–291, 1991. Lecture Notes in Computer Science 532.
H. Ehrig and M. Löwe. Categorical principles, techniques and results for high-level replacement systems in computer science. Applied Categorical Structures, 1(1):21–50, 1993.
A. Habel, R. Heckel, and G. Taentzer. Graph grammars with negative application conditions. accepted for special issue of Fundamenta Informaticae, 1994.
R. Heckel. Embedding of conditional graph transformations. unpublished, 1994.
R. Heckel, J. Müller, G. Taentzer, and A. Wagner. Attributed graph transformations with controlled application of rules. submitted to proceedings of Graphgrammar Mallorca Workshop 94, 1994.
H. Herrlich and G. Strecker. Category Theory. Allyn and Bacon, Rockleigh, New Jersey, 1973.
M. Korff. Single pushout transformations of equationally defined graph structures with applications to actor systems. In Proc. Graph Grammar Workshop Dagstuhl 93, pages 234–247, 1994. Lecture Notes in Computer Science 776.
M. Löwe. Algebraic approach to single-pushout graph transformation. TCS, 109:181–224, 1993.
U. Montanari. Separable graphs, planar graphs and web grammars. Information and Control 16, pages 243–267, 1970.
A. Schürr. Progress: A vhl-language based on graph grammars. In LNCS532. Springer, 1991.
A. Wagner. On the expressive power of graph grammars with application conditions. Technical Report 27, TU Berlin, 1994.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wagner, A. (1995). On the expressive power of algebraic graph grammars with application conditions. In: Mosses, P.D., Nielsen, M., Schwartzbach, M.I. (eds) TAPSOFT '95: Theory and Practice of Software Development. CAAP 1995. Lecture Notes in Computer Science, vol 915. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-59293-8_210
Download citation
DOI: https://doi.org/10.1007/3-540-59293-8_210
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-59293-8
Online ISBN: 978-3-540-49233-7
eBook Packages: Springer Book Archive