Modularizing Triple Graph Grammars Using Rule Refinement

  • Anthony Anjorin
  • Karsten Saller
  • Malte Lochau
  • Andy Schürr
Part of the Lecture Notes in Computer Science book series (LNCS, volume 8411)

Abstract

Model transformation plays a central role in Model-Driven Engineering. In application scenarios such as tool integration or view specification, bidirectionality is a crucial requirement. Triple Graph Grammars (TGGs) are a formally founded, bidirectional transformation language, which has been used successfully in various case studies from different applications domains.

In practice, supporting the maintainability of TGGs is a current challenge and existing modularity concepts, e.g., to avoid pattern duplication in TGG rules, are still inadequate. Existing TGG tools either provide no support at all for modularity, or provide limited support with restrictions that are often not applicable.

In this paper, we present and formalize a novel modularity concept for TGGs: Rule refinement, which generalizes existing modularity concepts, solves the problem of pattern duplication, and enables concise, maintainable specifications.

Keywords

model transformation triple graph grammars modularity 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2014

Authors and Affiliations

  • Anthony Anjorin
    • 1
  • Karsten Saller
    • 1
  • Malte Lochau
    • 1
  • Andy Schürr
    • 1
  1. 1.Real-Time Systems LabTechnische Universität DarmstadtGermany

Personalised recommendations