Triple Graph Grammars or Triple Graph Transformation Systems?

  • Authors:
  • Thomas Buchmann;Alexander Dotor;Bernhard Westfechtel

  • Affiliations:
  • Angewandte Informatik 1, Universität Bayreuth, Bayreuth D-95440;Angewandte Informatik 1, Universität Bayreuth, Bayreuth D-95440;Angewandte Informatik 1, Universität Bayreuth, Bayreuth D-95440

  • Venue:
  • Models in Software Engineering
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

Triple graph grammars have been used to specify consistency maintenance between inter-dependent and evolving models at a high level of abstraction. On a lower level, consistency maintenance may be specified by a triple graph transformation system, which takes care of all operational details required for executing consistency maintenance operations. We present a case study from software configuration management in which we decided to hand-craft a triple graph transformation system rather than to generate it from a triple graph grammar. The case study demonstrates some limitations concerning the kinds of consistency maintenance problems which can be handled by triple graph grammars.