Skip to main content
SpringerLink
Log in

A Relation-Algebraic Approach to Graph Structure Transformation

Invited Talk — Extended Abstract

  • Conference paper
  • First Online:
Relational Methods in Computer Science (RelMiCS 2001)

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

Included in the following conference series:

Abstract

Graph transformation is a rapidly expanding field of research, motivated by a wide range of applications.

Most of this work was completed during the author’s appointment at Institute of Software Technology, Universität der Bundeswehr München.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Michel Bauderon. A uniform approach to graph rewriting: The pullback approach. In Manfred Nagl, editor, Graph Theoretic Concepts in Computer Science, WG’ 96, volume 1017 of LNCS, pages 101–115. Springer, 1997.

    Google Scholar 

  2. Michel Bauderon and Hélène Jacquet. Pullback as a generic graph rewriting mechanism. Applied Categorical Structures, 9(1):65–82, 2001.

    Article  MATH  MathSciNet  Google Scholar 

  3. Michael Barr and Charles Wells. Category Theory for Computing Science. Prentice Hall International Series in Computer Science. Prentice Hall, 1990.

    Google Scholar 

  4. [CMR+97]_Andrea Corradini, Ugo Montanari, Francesca Rossi, Hartmut Ehrig, Reiko Heckel, and Michael Löwe. Algebraic approaches to graph transformation, part I: Basic concepts and double pushout approach. In Rozenberg [Roz97], chapter 3, pages 163–245.

    Google Scholar 

  5. [EHK+97]_Hartmut Ehrig, Reiko Heckel, Martin Korff, Michael Löwe, Leila Ribeiro, Annika Wagner, and Andrea Corradini. Algebraic approaches to graph transformation, part II: Single pushout approach and comparison with double pushout approach. In Rozenberg [Roz97], chapter 4, pages 247–312.

    Google Scholar 

  6. Hartmut Ehrig, M. Pfender, and H. J. Schneider. Graph grammars: An algebraic approach. In Proc.IEEE Conf. on Automata and Switching Theory, SWAT’ 73, pages 167–180, 1973.

    Google Scholar 

  7. Joost Engelfriet and Grzegorz Rozenberg. Node replacement graph grammars. In Rozenberg [Roz97], chapter 1, pages 1–94.

    Google Scholar 

  8. Peter J. Freyd and Andre Scedrov. Categories, Allegories, volume 39 of North-Holland Mathematical Library. North-Holland, Amsterdam, 1990.

    Google Scholar 

  9. Wolfram Kahl. A relation-algebraic approach to graph structure transformation, 2001. Habil. Thesis, Fakultät für Informatik, Univ. der Bundeswehr München, Techn. Bericht 2002-03.

    Google Scholar 

  10. Yasuo Kawahara. Pushout-complements and basic concepts of grammars in toposes. Theoretical Computer Science, 77:267–289, 1990.

    Article  MATH  MathSciNet  Google Scholar 

  11. Grzegorz Rozenberg, editor. Handbook of Graph Grammars and Computing by Graph Transformation, Vol.1: Foundations. World Scientific, Singapore, 1997.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computing and Software, McMaster University, Canada

    Wolfram Kahl

Authors
  1. Wolfram Kahl
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Tilburg University, P.O. Box 90153, 5000, LE Tilburg, The Netherlands

    Harrie C. M. de Swart

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kahl, W. (2002). A Relation-Algebraic Approach to Graph Structure Transformation. In: de Swart, H.C.M. (eds) Relational Methods in Computer Science. RelMiCS 2001. Lecture Notes in Computer Science, vol 2561. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36280-0_1

Download citation

  • DOI: https://doi.org/10.1007/3-540-36280-0_1

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-00315-1

  • Online ISBN: 978-3-540-36280-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation