Abstract
Motivated by the work which has been done for Petri-nets, the paper presents a categorical approach to graph grammars “in the large”. In the large means, that we define categories of graph grammars, graph transition systems, and graph derivation systems which embody the notion “grammar”, “direct derivation”, and “derivation”, respectively, as they are defined in the classical algebraic theory. For this purpose we introduce a suitable notion of graph grammar morphism on “typed graph grammars” in analogy to Petri-nets. A typed graph grammar is a grammar for typed graphs which is a slight generalization of the standard case. The main result shows that the three categories are related by left-adjoint functors. We discuss the relationship of our results to similar results obtained in the Petri-net field, and applications to entity/relationship models.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
M. A. Bednarcsyk: Categories of asynchronous systems, Ph.D. Thesis, University of Sussex, Report no. 1/88, 1988.
A. Corradini, H. Ehrig, M. Löwe, U. Montanari and F. Rossi: Abstract Graph Derivations in the Double-Pushout Approach, LNCS 776, Springer-Verlag, 1994, 86–103.
A. Corradini, H. Ehrig, M. Löwe, U. Montanari and F. Rossi: An Event Structure Semantics for Safe Graph Grammars, in Proc. IFIP Conf. PROCOMET'94 (Conference Edition), San Miniato, Italy, 1994.
P.P. Chen: The Entity-Relationship Model: Toward a Unified View of Data, ACM Transactions on Database Systems, 1(1):9–36, 1976.
I. Claßen, M. Löwe: Scheme Evolution in Object-Oriented Models: A Graph Transformation Approach, to appear Proc. Workshop on Formal Methods at the ICSE'95, Seattle (U.S.A.), 1995.
I. Claßen, M. Löwe, S. Wasserroth, J. Wortmann: Static and Dynamic Semantics of EIR Models Based on Algebraic Methods, Integration von semiformalen und formalen Methoden für die Spezifikation von Software-Systemen (B. Wolfinger, ed.), Springer-Verlag, Informatik aktuell, 1994, 2–9.
A. Corradini, U. Montanari and F. Rossi: Graph Processes, accepted for publication in Fundamenta Informaticae.
P. Degano, J. Meseguer, U. Montanari: Axiomatizing Net Computations and Processes, in Proc. 4th Annual Symp. on Logic in Comp. Sci., Asilomar, CA, USA, 1989, 175–185.
H. Ehrig: Tutorial Introduction to the Algebraic Approach of Graph-Grammars, LNCS 291, Springer-Verlag, 1987, 3–14.
H. Ehrig, B.K. Rosen: Parallelism and Concurrency of Graph Manipulation, TCS 11(1980), 247–275.
M. Löwe: Von Graphgrammatiken zu Petri-Netzen und zurück, Tagungsband Alternative Konzepte für Sprachen und Rechner 1994 (F. Simon, eds.), Univ. Kiel, FB Informatik, Nr. 9412, 79–82.
J. Meseguer, and U. Montanari: Petri-Nets are Monoids, in Info. and Co., 88(1990) 105–155.
M. Nielsen, G. Plotkin and G. Winskel: Petri-Nets, Event Structures and Domains, Part 1, in Theoret. Comp. Sci. 13 (1981), 85–108.
W. Reisig: Petri Nets: An Introduction, EATCS Monographs on Theoretical Computer Science, Springer-Verlag, 1985.
V. Sassone, M. Nielsen and G. Winskel: Relationship between models of concurrency, in Proc. REX'93, 1993.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Corradini, A., Ehrig, H., Löwe, M., Montanari, U., Padberg, J. (1996). The category of typed graph grammars and its adjunctions with categories of derivations. In: Cuny, J., Ehrig, H., Engels, G., Rozenberg, G. (eds) Graph Grammars and Their Application to Computer Science. Graph Grammars 1994. Lecture Notes in Computer Science, vol 1073. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61228-9_79
Download citation
DOI: https://doi.org/10.1007/3-540-61228-9_79
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61228-5
Online ISBN: 978-3-540-68388-9
eBook Packages: Springer Book Archive