Construction of Integrity Preserving Triple Graph Grammars

  • Anthony Anjorin
  • Andy Schürr
  • Gabriele Taentzer
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7562)

Abstract

Triple Graph Grammars (TGGs) are a rule-based technique of specifying a consistency relation over a source, correspondence, and target domain, which can be used for bidirectional model transformation.

A current research challenge is increasing the expressiveness of TGGs by ensuring that global constraints in the involved domains are not violated by the transformation. Negative Application Conditions (NACs) can be used to enforce this property, referred to as schema compliance.

In previous work, we have presented a polynomial control algorithm for integrity preserving TGGs, using NACs only to ensure schema compliance, meaning that, for efficiency reasons, the usage of NACs must be restricted appropriately. In this paper, we apply the well-known translation of global constraints to application conditions for a given TGG and set of global constraints. We show that the derived set of NACs is indeed sufficient and necessary to ensure schema compliance, i.e., that the TGG together with the derived NACs is integrity preserving by construction.

Keywords

bidirectional transformation triple graph grammars schema compliance integrity preservation negative application conditions 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • Anthony Anjorin
    • 1
  • Andy Schürr
    • 2
  • Gabriele Taentzer
    • 3
  1. 1.Graduate School of Computational EngineeringTechnische Universität DarmstadtGermany
  2. 2.Real-Time Systems LabTechnische Universität DarmstadtGermany
  3. 3.Fachbereich Mathematik und InformatikPhilipps-Universität MarburgGermany

Personalised recommendations