Confluence of Typed Attributed Graph Transformation Systems

  • Reiko Heckel
  • Jochen Malte Küster
  • Gabriele Taentzer
Conference paper

DOI: 10.1007/3-540-45832-8_14

Volume 2505 of the book series Lecture Notes in Computer Science (LNCS)
Cite this paper as:
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

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2002

Authors and Affiliations

  • Reiko Heckel
    • 1
    • 2
  • Jochen Malte Küster
    • 1
    • 2
  • Gabriele Taentzer
  1. 1.University of PaderbornPaderbornGermany
  2. 2.Technical University of BerlinBerlinGermany