Advertisement

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

  • Hans-Jörg Kreowski
Chapter
Part of the Lecture Notes in Computer Science book series (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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [Adl94]
    L.M. Adleman. Molecular Computation of Solutions to Combinatorial Problems. Science, 226:1021–1024, 1994.CrossRefGoogle Scholar
  2. [BM98]
    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. [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
  4. [EEKR99]
    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. [EHK+97]
    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. [EKMR99]
    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. [HP01]
    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. [KK99a]
    Hans-Jörg Kreowski and Sabine Kuske. Graph Transformation Units and Modules. In Ehrig et al. [EEKR99], pages 607–638.Google Scholar
  9. [KK99b]
    Hans-Jörg Kreowski and Sabine Kuske. Graph Transformation Units with Interleaving Semantics. Formal Aspects of Computing, 11(6):690–723, 1999.zbMATHCrossRefGoogle Scholar
  10. [KKS97]
    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.CrossRefGoogle Scholar
  11. [Kus00a]
    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. [Kus00b]
    Sabine Kuske. Transformation Units—A Structuring Principle for Graph Transformation Systems. PhD thesis, University of Bremen, 2000.Google Scholar
  13. [LM93]
    Igor Litovsky and Yves Métivier. Computing with Graph Rewriting Systems with Priorities. Theoretical Computer Science, 115(2):191–224, 1993.zbMATHCrossRefMathSciNetGoogle Scholar
  14. [LMS95]
    Igor Litovsky, Yves Métivier, and Éric Sopena. Different Local Controls for Graph Relabeling Systems. Mathematical Systems Theory, 28(1):41–65, 1995.zbMATHCrossRefMathSciNetGoogle Scholar
  15. [LMS98]
    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. [LMS99]
    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. [MS97]
    Yves Métivier and Éric Sopena. Graph Relabelling Systems: A General Overview. Computers and Artificial Intelligence, 16(2):167–185, 1997.zbMATHMathSciNetGoogle Scholar
  18. [Plu93]
    Detlef Plump. Hypergraph Rewriting: Critical Pairs and Undecidability of Confluence. In Sleep et al. [SPvE93], chapter 15, pages 201–213.Google Scholar
  19. [Plu98]
    Detlef Plump. Termination of Graph Rewriting Is Undecidable. Fundamenta Informaticae, 33(2):201–209, 1998.zbMATHMathSciNetGoogle Scholar
  20. [Plu99]
    Detlef Plump. Term Graph Rewriting. In Ehrig et al. [EEKR99], chapter 1, pages 1–61.Google Scholar
  21. [PRS98]
    Gheorghe Păun, Grzegorz Rozenberg, and Arto Salomaa. DNA Computing. Springer, 1998.Google Scholar
  22. [Roz97]
    Grzegorz Rozenberg, Editor. Handbook of Graph Grammars and Computing by Graph Transformation, Vol. 1: Foundations. World Scientific, Singapore, 1997.Google Scholar
  23. [SPvE93]
    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

Copyright information

© Springer-Verlag Berlin Heidelberg 2002

Authors and Affiliations

  • Hans-Jörg Kreowski
    • 1
  1. 1.Department of Computer ScienceUniversity of BremenBremenGermany

Personalised recommendations