Abstract
Given a production p* in a graph grammar we consider the problem to find all productions p and p′ and all dependency relations R between p and p′ such that p* is equal to the concurrent production p*Rp′. In view of the Concurrency Theorem — shown in an earlier paper — this means that there is a bijective correspondence between direct derivations G⇒ X via p* and R-related derivations G⇒ H⇒ X via (p,p′). We are able to give a general procedure for the decomposition of p*=p*Rp′ which leads to all possible decompositions at least in the case of injective relations R. An important application of this decomposition theorem is the problem to find all possible decompositions of manipulation rules into atomic manipulation rules of a data base system. The theorem is proved within the framework of the algebraic theory of graph grammars using pushout and pullback techniques.
Preview
Unable to display preview. Download preview PDF.
5. References
Arbib, M.A.; Manes, E.G.: Arrows, Structures and Functors: The Categorical Imperative, Academic Press, New York, 1975
Batini, C.; D'Atri, A.: Rewriting Systems as a Tool for Relational Data Base Design, Proc. International Workshop on Graph Grammars and Their Applications to Computer Science and Biology, Bad Honnef 1978, this volume
Ehrig, H.: Introduction to the Algebraic Theory of Graph Grammars, Proc. International Workshop on Graph Grammars and Their Applications to Computer Science and Biology, Bad Honnef 1978, this volume
Ehrig, H.; Kreowski, H.-J.: Contributions to the Algebraic Theory of Graph Grammars, Techn. Report 76-22, FB 20, TU Berlin (1976), to appear in Math. Nachr.
—: Algebraic Theory of Graph Grammars Applied to Consistency and Synchronization in Data Bases, Proc. Workshop WG 78 on Graphtheoretic Concepts in Computer Science, to appear in the series Applied Computer Sci.
Ehrig, H.; Rosen, B.K.: Concurrency of Manipulations in Multidimensional Information Structures, Techn. Rep. 78-13, FB 20, TU Berlin (1978), short version in Proc. MFCS'78, Springer Lect. Notes Comp. Sci (64), 165–176 (1978)
Furtado, A.L.: Transformations of Data Base Structures, Proc. International Workshop on Graph Grammars and Their Applications to Computer Science and Biology, Bad Honnef 1978, this volume
Negraszus-Patan, G.: Anwendungen der algebraischen Graphentheorie auf die formale Beschreibung und Manipulation eines Datenbankmodells, Diplomarbeit, FB 20, TU Berlin (1977)
Steiner, S.: Untersuchungen über die gleichzeitige Ausführung von Operationen in Datenbankmodellen unter Verwendung der Algebraischen Graphentheorie, Diplomarbeit FB 20, TU Berlin (1978)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1979 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ehrig, H., Rosen, B.K. (1979). Decomposition of graph grammar productions and derivations. In: Claus, V., Ehrig, H., Rozenberg, G. (eds) Graph-Grammars and Their Application to Computer Science and Biology. Graph Grammars 1978. Lecture Notes in Computer Science, vol 73. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0025721
Download citation
DOI: https://doi.org/10.1007/BFb0025721
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-09525-5
Online ISBN: 978-3-540-35091-0
eBook Packages: Springer Book Archive