Skip to main content
SpringerLink
Log in

A Sight-seeing Tour of the Computational Landscape of Graph Transformation

  • Chapter
  • First Online:
Formal and Natural Computing

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

Abstract

In this paper, the basic features of graph transformation are introduced as a kind of sight-seeing tour of the computational landscape which is based on the application of rules to graphs.

This research was partially supported by the EC TMR Network GETGRATS (General Theory of Graph Transformation Systems) and the ESPRIT Working Group APPLIGRAPH (Applications of Graph Transformation).

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. L.M. Adleman. Molecular Computation of Solutions to Combinatorial Problems. Science, 226:1021–1024, 1994.

    Article  Google Scholar 

  2. Anne Bottreau and Yves Métivier. Minor Searching, Normal Forms of Graph Relabelling: Two Applications Based on Enumerations by Graph Relabelling. In M. Nivat, Editor, Proc. Foundations of Software Science and Computation Structures (FoSSaCS’98), volume 1378 of Lecture Notes in Computer Science, pages 110–124. Springer, 1998.

    Google Scholar 

  3. 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 

  4. Hartmut Ehrig, Gregor Engels, Hans-Jörg Kreowski, and Grzegorz Rozenberg, Editors. Handbook of Graph Grammars and Computing by Graph Transformation, Vol. 2: Applications, Languages and Tools. World Scientific, Singapore, 1999.

    Google Scholar 

  5. Hartmut Ehrig, Reiko Heckel, Martin Kor., Michael Löwe, Leila Ribeiro, and Annika Wagner. 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, Hans-Jörg Kreowski, Ugo Montanari, and Grzegorz Rozenberg, Editors. Handbook of Graph Grammars and Computing by Graph Transformation, Vol. 3: Concurrency, Parallelism, and Distribution. World Scientific, Singapore, 1999.

    Google Scholar 

  7. Annegret Habel and Detlef Plump. Computational Completeness of Programming Languages Based on Graph Transformation. In F. Honsell and M. Miculan, Editors, Proc. Foundations of Software Science and Computation Structures (FoSSaCS 2001), volume 2030 of Lecture Notes in Computer Science, pages 230–245. Springer, 2001.

    Google Scholar 

  8. Hans-Jörg Kreowski and Sabine Kuske. Graph Transformation Units and Modules. In Ehrig et al. [EEKR99], pages 607–638.

    Google Scholar 

  9. Hans-Jörg Kreowski and Sabine Kuske. Graph Transformation Units with Interleaving Semantics. Formal Aspects of Computing, 11(6):690–723, 1999.

    Article  MATH  Google Scholar 

  10. Hans-Jörg Kreowski, Sabine Kuske, and Andy Schürr. Nested Graph Transformation Units. International Journal on Software Engineering and Knowledge Engineering, 7(4):479–502, 1997.

    Article  Google Scholar 

  11. Sabine Kuske. More about Control Conditions for Transformation Units. In H. Ehrig, G. Engels, H.-J. Kreowski, and G. Rozenberg, Editors, Proc. Theory and Application of Graph Transformations (TAGT’98), volume 1764 of Lecture Notes in Computer Science, pages 323–337. Springer, 2000.

    Google Scholar 

  12. Sabine Kuske. Transformation Units—A Structuring Principle for Graph Transformation Systems. PhD thesis, University of Bremen, 2000.

    Google Scholar 

  13. Igor Litovsky and Yves Métivier. Computing with Graph Rewriting Systems with Priorities. Theoretical Computer Science, 115(2):191–224, 1993.

    Article  MATH  MathSciNet  Google Scholar 

  14. Igor Litovsky, Yves Métivier, and Éric Sopena. Different Local Controls for Graph Relabeling Systems. Mathematical Systems Theory, 28(1):41–65, 1995.

    Article  MATH  MathSciNet  Google Scholar 

  15. Igor Litovsky, Yves Métivier, and Éric Sopena. Checking Global Graph Properties by Means of Local Computations: The Majority Problem. Theoretical Computer Science, 194(1–2):245–246, 1998.

    Google Scholar 

  16. Igor Litovsky, Yves Métivier, and Éric Sopena. Graph Relabelling Systems and Distributed Algorithms. In Ehrig et al. [EKMR99], chapter 1, pages 1–56.

    Google Scholar 

  17. Yves Métivier and Éric Sopena. Graph Relabelling Systems: A General Overview. Computers and Artificial Intelligence, 16(2):167–185, 1997.

    MATH  MathSciNet  Google Scholar 

  18. Detlef Plump. Hypergraph Rewriting: Critical Pairs and Undecidability of Confluence. In Sleep et al. [SPvE93], chapter 15, pages 201–213.

    Google Scholar 

  19. Detlef Plump. Termination of Graph Rewriting Is Undecidable. Fundamenta Informaticae, 33(2):201–209, 1998.

    MATH  MathSciNet  Google Scholar 

  20. Detlef Plump. Term Graph Rewriting. In Ehrig et al. [EEKR99], chapter 1, pages 1–61.

    Google Scholar 

  21. Gheorghe Păun, Grzegorz Rozenberg, and Arto Salomaa. DNA Computing. Springer, 1998.

    Google Scholar 

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

    Google Scholar 

  23. M.R. Sleep, M.J. Plasmeijer, and M.C.J.D. van Eekelen, Editors. Term Graph Rewriting. Theory and Practice. John Wiley, 1993.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Bremen, P.O. Box 33 04 40, 28334, Bremen, Germany

    Hans-Jörg Kreowski

Authors
  1. Hans-Jörg Kreowski
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Computer Science Department, Technical University of Munich, Arcisstraße 21, 80333, Munich, Germany

    Wilfried Brauer

  2. Computer Science Department, Technical University of Berlin, Franklinstraße 28/29, 10587, Berlin, Germany

    Hartmut Ehrig

  3. Department of Mathematics, University of Turku, 20014, Turku, Finland

    Juhani Karhumäki

  4. Turku Centre for Computer Science, Lemminkäisenkatu 14A, 20520, Turku, Finland

    Arto Salomaa

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Kreowski, HJ. (2002). A Sight-seeing Tour of the Computational Landscape of Graph Transformation. In: Brauer, W., Ehrig, H., Karhumäki, J., Salomaa, A. (eds) Formal and Natural Computing. Lecture Notes in Computer Science, vol 2300. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45711-9_9

Download citation

  • DOI: https://doi.org/10.1007/3-540-45711-9_9

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-43190-9

  • Online ISBN: 978-3-540-45711-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation