Abstract
In this paper we propose an axiomatization of ‘partially abstract graphs’, i.e., of suitable classes of monomorphisms in a category of graphs, which may be interpreted as graphs having both a concrete part and an abstract part (defined up to isomorphism). Morphisms between pa-graphs are pushout squares. We show that the basic notions of the algebraic theory of graph grammars [Eh79] (instantiated to a suitable category of graphs) can be rephrased in a natural way using partially abstract graphs. The terms of the algebra we propose are built over a small set of operators, including parallel composition, substitution application, and restriction. By equipping the algebra of terms with a categorical structure (arrows are equivalence classes of monadic contexts), we show that there is a full and faithful embedding (with a right adjoint) of the category of partially abstract graphs into the category of (well-formed) terms. This embedding is exploited to show that rewriting (in the sense of term rewriting systems) over this algebra models faithfully the direct derivations of graphs, described by a double pushout construction along the guidelines of [Eh79]. In particular, we show that also graph productions having non-discrete gluing graphs can be represented as term rewrite rules without loss of information, unlike a similar approach proposed in [BC87].
Research partially supported by the GRAGRA Basic Research Esprit Working Group n. 3299.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
6 References
M. Bauderon, B. Courcelle, Graph Expressions and Graph Rewritings, Mathematical System Theory 20, 1987, pp. 83–127.
V. Claus, H. Ehrig, G. Rozenberg, (Eds.) Proceedings of the 1 st International Workshop on Graph-Grammars and Their Application to Computer Science and Biology, LNCS 73, 1979.
A. Corradini, U. Montanari, F. Rossi, H. Ehrig, M. Löwe, Logic Programming and Graph Grammars, in [EKR91].
A. Corradini, An Algebraic Semantics for Transition Systems and Logic Programming, Ph.D. Thesis TD-8/90, Dipartimento di Informatica, Università di Pisa, March '90.
H. Ehrig, Introduction to the Algebraic Theory of Graph-Grammars, in [CER79], pp. 1–69.
H. Ehrig, A. Habel, H.-J. Kreowski, F. Parisi-Presicce, From Graph Grammars to High-Level Replacement Systems, in [EKR91].
H. Ehrig, A. Habel, H.-J. Kreowski, F. Parisi-Presicce, Parallelism and Concurrency in High-Level Replacement Systems, Technical Report n• 90/35, Technische Universität Berlin. To appear in Mathematical Structures in Computer Science, 1991.
H. Ehrig, H.-J. Kreowski, A. Maggiolo-Schettini, B. Rosen, J. Winkowski, Transformation of Structures: an Algebraic Approach, Mathematical System Theory 14, 1981, pp. 305–334.
H. Ehrig, H.-J. Kreowski, G. Rozenberg, (Eds.) Proceedings of the 4 th International Workshop on Graph-Grammars and Their Application to Computer Science, LNCS, 1991.
H. Ehrig, M. Nagl, G. Rozenberg, (Eds.) Proceedings of the 2 nd International Workshop on Graph-Grammars and Their Application to Computer Science, LNCS 153, 1983.
H. Ehrig, M. Nagl, G. Rozenberg, A. Rosenfeld, (Eds.) Proceedings of the 3 rd International Workshop on Graph-Grammars and Their Application to Computer Science, LNCS 291, 1987.
H. Ehrig, M. Pfender, H.J. Schneider, Graph-grammars: an algebraic approach, Proc, IEEE Conf. on Automata and Switching Theory, 1973, pp. 167–180.
A. Habel, Collage Grammars, in [EKR91].
A. Habel, H.-J. Kreowski, May we introduce to you: hyperedge replacement, in [ENRR87], pp. 15–26.
A. Habel, H-J. Kreowski, D. Plump, Jungle evaluation, in Proc. Fifth Workshop on Specification of Abstract Data Types, LNCS 332, 1988, pp. 92–112.
J.R. Kennaway, Graph rewriting in some categories of partial morphisms, in [EKR91].
J. Meseguer, Rewriting as a Unified Model of Concurrency, Proc. CONCUR '90, LNCS 458, 1990, pp. 384–400. Full version as Tech. Rep. SRI-CSL-90-02, SRI International, February '90.
J. Meseguer, U. Montanari, Petri Nets are Monoids: A New Algebraic Foundation for Net Theory, Proc. Logics In Computer Science, Edinburgh, 1988, pp. 155–164. Also in Information and Computation, 88 (2), 1990, pp. 105–155.
U. Montanari, F. Rossi, True Concurrency in Concurrent Constraint Programming, Proc. International Logic Programming Symposium, MIT Press, 1991.
F. Parisi-Presicce, H. Ehrig and U. Montanari, Graph Rewriting with Unification and Composition, in [ENRR87], pp. 496–514.
F. Parisi-Presicce, A Rule Based Approach to Modular System Design, Proc. 12th Int. Conf. Software Engineering, March 1990.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1991 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Corradini, A., Montanari, U. (1991). An algebra of graphs and graph rewriting. In: Pitt, D.H., Curien, PL., Abramsky, S., Pitts, A.M., Poigné, A., Rydeheard, D.E. (eds) Category Theory and Computer Science. CTCS 1991. Lecture Notes in Computer Science, vol 530. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0013469
Download citation
DOI: https://doi.org/10.1007/BFb0013469
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-54495-1
Online ISBN: 978-3-540-38413-7
eBook Packages: Springer Book Archive