An Algebra of Graph Derivations Using Finite (co—) Limit Double Theories

  • Andrea Corradini
  • Martin Groβe-Rhode
  • Reiko Heckel
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1589)


Graph transformation systems have been introduced for the formal specification of software systems. States are thereby modeled as graphs, and computations as graph derivations according to the rules of the specification. Operations on graph derivations provide means to reason about the distribution and composition of computations. In this paper we discuss the development of an algebra of graph derivations as a descriptive model of graph transformation systems. For that purpose we use a categorical three level approach for the construction of models of computations based on structured transition systems. Categorically the algebra of graph derivations can then be characterized as a free double category with finite horizontal colimits.

One of the main objectives of this paper is to show how we used algebraic techniques for the development of this formal model, in particular to obtain a clear and well structured theory. Thus it may be seen as a case study in theory design and its support by algebraic development techniques.


Graph Transformation Monoidal Category Graph Grammar Composition Operation Graph Derivation 
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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. BC87.
    M. Bauderon and B. Courcelle. Graph expressions and graph rewritings. Mathematical Systems Theory, 20:83–127, 1987.CrossRefMathSciNetzbMATHGoogle Scholar
  2. CA93.
    A. Corradini and A. Asperti. A categorical model for logic programs: Indexed monoidal categories. In Proceedings REX Workshop, Beekbergen, The Netherlands, June 1992, Springer LNCS 666, 1993.Google Scholar
  3. CG97.
    A. Corradini and F. Gadducci. A 2-categorical presentation of term graph rewriting. In Proceedings CTCS’97, Springer LNCS 1290, 1997.Google Scholar
  4. CGW95.
    I. Claβen, M. Groβe-Rhode, and U. Wolter. Categorical concepts for parameterized partial specifications. MSCS, 5(2):153–188, 1995.MathSciNetGoogle Scholar
  5. CM92.
    A. Corradini and U. Montanari. An algebraic semantics for structured transition systems and its application to logic programs. TCS, 103:51–106, 1992.CrossRefzbMATHGoogle Scholar
  6. Cor90.
    A. Corradini. An algebraic semantics for transition systems and logic programming. PhD thesis, Dip. Informatica, Università di Pisa, 1990.Google Scholar
  7. Ehr79.
    H. Ehrig. Introduction to the algebraic theory of graph grammars. In V. Claus, H. Ehrig, and G. Rozenberg, editors, 1st Graph Grammar Workshop, Springer LNCS 73, pages 1–69, 1979.Google Scholar
  8. EV97.
    J. Engelfriet and J.J. Vereijken. Context-free graph grammars and concatenation of graphs. Acta Informatica, 34:773–803, 1997.CrossRefMathSciNetzbMATHGoogle Scholar
  9. GH98.
    F. Gadducci and R. Heckel. An inductive view of graph transformation. In Proceedings WADT’97, Springer LNCS 1376, 1998.Google Scholar
  10. Gog91.
    J.A. Goguen. A categorical manifesto. MSCS, 1, 1991.Google Scholar
  11. Gra89.
    J.W. Gray. The category of sketches as a model for algebraic semantics. Contemporary Mathematics, 92:109–135, 1989.CrossRefzbMATHGoogle Scholar
  12. GU71.
    P. Gabriel and F. Ulmer. Lokal präsentierbare Kategorien, Springer LNM 221, 1971.Google Scholar
  13. Hec98.
    R. Heckel. Compositional Development of Reactive Systems using Graph Transformation Systems with Loose Semantics. PhD thesis, TU Berlin, 1998.Google Scholar
  14. Law63.
    F. W. Lawvere. Functorial semantics of algebraic theories. In Proc. National Academy of Science, U.S.A., 50, pages 869–872. Columbia University, 1963.CrossRefzbMATHGoogle Scholar
  15. MM90.
    J. Meseguer and U. Montanari. Petri nets are monoids. Information and Computation, 88:105–155, 1990.CrossRefMathSciNetzbMATHGoogle Scholar
  16. Roz97.
    G. Rozenberg, editor. Handbook of Graph Grammars and Computing by Graph Transformations, Volume 1: Foundations. World Scientic, 1997.Google Scholar

Copyright information

© IFIP International Federation for Information Processing 1999

Authors and Affiliations

  • Andrea Corradini
    • 1
  • Martin Groβe-Rhode
    • 2
  • Reiko Heckel
    • 3
  1. 1.Dip. InformaticaUniversità di PisaGermany
  2. 2.TU Berlin, FB InformatikGermany
  3. 3.Universität-GH Paderborn, FB Mathematik-InformatikGermany

Personalised recommendations