Skip to main content
SpringerLink
Log in

Confluence of Typed Attributed Graph Transformation Systems

  • Conference paper
  • First Online:
Book cover Graph Transformation (ICGT 2002)

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

Included in the following conference series:

Abstract

The issue of confluence is of major importance for the successful application of attributed graph transformation, such as automated translation of UML models into semantic domains. Whereas termination is undecidable in general and must be established by carefully designing the rules, local confluence can be shown for term rewriting and graph rewriting using the concept of critical pairs. In this paper, we discuss typed attributed graph transformation using a new simplified notion of attribution. For this kind of attributed graph transformation systems we establish a definition of critical pairs and prove a critical pair lemma, stating that local confluence follows from confluence of all critical pairs.

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. P. Bottoni, A. Schürr, and G. Taentzer. Efficient Parsing of Visual Languages based on Critical Pair Analysis and Contextual Layered Graph Transformation. In Proc. IEEE Symposium on Visual Languages, September 2000. Long version available as technical report SI-2000-06, University of Rom.

    Google Scholar 

  2. A. Corradini, U. Montanari, and F. Rossi. Graph processes. In Fundamenta Informaticae, volume 26(3,4), pages 241–266, 1996.

    MATH  MathSciNet  Google Scholar 

  3. H. Ehrig. Embedding theorems in the algebraic theory of graph grammars. In LNCS 56, pages 245–255. Springer, 1977.

    Google Scholar 

  4. H. Ehrig. Introduction to the Algebraic Theory of Graph Grammars (A Survey). In Graph Grammars and their Application to Computer Science and Biology. Springer LNCS 73, 1979.

    Google Scholar 

  5. H. Ehrig, M. Pfender, and H.J. Schneider. Graph grammars: an algebraic approach. In 14th Annual IEEE Symposium on Switching and Automata Theory, pages 167–180. IEEE, 1973.

    Google Scholar 

  6. G. Engels, R. Heckel, and J. M. Küster. Rule-based specification of behavioral consistency based on the UML meta-model. In M. Gogolla and C. Kobryn, editors, Proc. 4th Intl. Conference on The Unified Modeling Language (UML’ 02), Toronto, Canada, October, 2001, volume 2185 of LNCS, pages 272–287. Springer, 2001.

    Google Scholar 

  7. C. Ermel, M. Rudolf, and G. Taentzer. The AGG-Approach: Language and Tool Environment. In H. Ehrig, G. Engels, H.-J. Kreowski, and G. Rozenberg, editors, Handbook of Graph Grammars and Computing by Graph Transformation, volume 2: Applications, Languages and Tools, pages 551–603. World Scientific, 1999. See also http://tfs.cs.tu/berlin.de/agg.

  8. Formal Systems Europe (Ltd). Failures-Divergence-Refinement: FDR2 User Manual, 1997.

    Google Scholar 

  9. J. H. Hausmann, R. Heckel, and G. Taentzer. Detection of Conflicting Functional Requirements in a Use Case-Driven Approach. In Proc. 24th Intl. Conference on Software Engineering, Orlando, FL, 2002. ACM/IEEE Computer Society.

    Google Scholar 

  10. R. Heckel, J.M. Küster, and G. Taentzer. Towards automatic translation of UML models into semantic domains. In H.-J. Kreowski, editor, Proc. ETAPS’02 Workshop on Application of Graph Transformation (AGT’02), Grenoble, France, April 2002.

    Google Scholar 

  11. C. A. R. Hoare. Communicating Sequential Processes. Prentice Hall, 1985.

    Google Scholar 

  12. H.-J. Kreowski. Manipulation von Graphmanipulationen. PhD thesis, FB13, 1978.

    Google Scholar 

  13. S. Kuske. A formal semantics of UML state machines based on structured graph transformation. In M. Gogolla and C. Kobryn, editors, Proc. UML 2001, Toronto, Kanada, volume 2185 of LNCS. Springer-Verlag, 2001.

    Google Scholar 

  14. M. Löwe, M. Korff, and A. Wagner. An algebraic framework for the transformation of attributed graphs. In Term Graph Rewriting: Theory and Practice, pages 185–199. John Wiley & Sons Ltd, 1993.

    Google Scholar 

  15. M. H. A. Newman. On theories with a combinatorial definition of’ equivalence’. In Annals of Mathematics, 43(2), pages 223–243, 1942.

    Article  MathSciNet  Google Scholar 

  16. J. Padberg and G. Taentzer. Embedding of derivations in high-level replacement systems. Technical Report 93/9, Technical University of Berlin, Computer Science Department, 1993.

    Google Scholar 

  17. D. Plump. Hypergraph Rewriting: Critical Pairs and Undecidability of Confluence. In M.R Sleep, M.J. Plasmeijer, and M. C.J.D. van Eekelen, editors, Term Graph Rewriting, pages 201–214. Wiley, 1993.

    Google Scholar 

  18. D. Plump. Term graph rewriting. In G. Engels, H.-J. Kreowski, and G. Rozenberg, editors, Handbook of Graph Grammars and Computing by Graph Transformation, Volume 2: Applications, Languages, and Tools, pages 3–62. World Scientific, 1999.

    Google Scholar 

  19. D. Varro, G. Varro, and A. Pataricza. Designing the Automatic Transformation of Visual Languages. Science of Computer Programming, 44(2), 2002.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University of Paderborn, Paderborn, Germany

    Reiko Heckel & Jochen Malte Küster

  2. Technical University of Berlin, Berlin, Germany

    Reiko Heckel & Jochen Malte Küster

Authors
  1. Reiko Heckel
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jochen Malte Küster
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Gabriele Taentzer
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Dipartimento di Informatica, Università di Pisa, Corso Italia 40, 56125, Pisa, Italy

    Andrea Corradini

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

    Hartmut Ehrig

  3. Computer Science Department, University of Bremen, Bibliothekstraße 1, 28359, Bremen, Germany

    Hans -Jörg Kreowski

  4. Leiden Institute of Advanced Computer Science, Leiden University, Niels Bohrweg 1, 2333, CA Leiden, The Netherlands

    Grzegorz Rozenberg

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Heckel, R., Küster, J.M., Taentzer, G. (2002). Confluence of Typed Attributed Graph Transformation Systems. In: Corradini, A., Ehrig, H., Kreowski, H.J., Rozenberg, G. (eds) Graph Transformation. ICGT 2002. Lecture Notes in Computer Science, vol 2505. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45832-8_14

Download citation

  • DOI: https://doi.org/10.1007/3-540-45832-8_14

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-44310-0

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation