Skip to main content
SpringerLink
Log in
Book cover

International Workshop on Graph Grammars and Their Application to Computer Science

Graph Grammars 1990: Graph Grammars and Their Application to Computer Science pp 24–37Cite as

Tutorial introduction to the algebraic approach of graph grammars based on double and single pushouts

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 532))

Abstract

The gluing construction on which the algebraic notion of a derivation is based operationally provides a simple and intuitive understanding of graph rewriting. Inheriting the powerful toolbox of category theory, its abstract version as a (single resp. double) pushout leads to highly compact and elegant proofs especially for the basic constructions of sequential and parallel independent derivations as well as for concurrent and amalgamated productions respectively.

This is a preview of subscription content, log in via an institution.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. P. Boehm, H.-R. Fonio, A. Habel:: “Amalgamation of Graph Transformations: A Synchronization Mechanism,” Journal of Computer and System Sciences 34 (1987), p. 377–408

    Article  Google Scholar 

  2. H. Ehrig, M. Pfender, H.J. Schneider:: “Graph Grammars: An Algebraic Approach,” Proc. IEEE Conf. SWAT'73, Iowa City 1973, p. 167–180

    Google Scholar 

  3. H. Ehrig:: “Introduction to the Algebraic Theory of Graph Grammars,” LNCS 73 (1979), p. 1–69

    Google Scholar 

  4. H. Ehrig, H.-J. Kreowski, A. Maggiolo-Schettini, B. Rosen, J. Winkowski:: “Transformation of Structures: An Algebraic Approach,” Math. Syst. Theory 14 (1981), p. 305–334

    Article  Google Scholar 

  5. R. Kennaway:: “On “On Graph Rewriting,” Theoretical Computer Science 52 (1987), p. 37–58

    Article  Google Scholar 

  6. H.-J. Kreowski:: “Manipulation von Graphmanipulationen,” Ph.D. Thesis, TU Berlin 1977

    Google Scholar 

  7. M. Löwe:: “Algebraic Approach to Graph Transformation Based on Single Pushout Derivations,” Technical Report TU Berlin No 90-5, 1990 (short version to appear in Proc. of WG'90)

    Google Scholar 

  8. J.L. Raoult:: “On Graph Rewriting” Theoretical Computer Science 32 (1984), p. 1–24

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Technical University of Berlin, Franklinstraße 28/29, D-1000, Berlin 10

    Hartmut Ehrig, Martin Korff & Michael Löwe

Authors
  1. Hartmut Ehrig
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Martin Korff
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Michael Löwe
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Hartmut Ehrig Hans-Jörg Kreowski Grzegorz Rozenberg

Rights and permissions

Reprints and permissions

Copyright information

© 1991 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ehrig, H., Korff, M., Löwe, M. (1991). Tutorial introduction to the algebraic approach of graph grammars based on double and single pushouts. In: Ehrig, H., Kreowski, HJ., Rozenberg, G. (eds) Graph Grammars and Their Application to Computer Science. Graph Grammars 1990. Lecture Notes in Computer Science, vol 532. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0017375

Download citation

  • DOI: https://doi.org/10.1007/BFb0017375

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-54478-4

  • Online ISBN: 978-3-540-38395-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation