Simulating Set-Valued Transformations with Algorithmic Graph Transformation Languages

  • Authors:
  • Christian Fuss;Verena E. Tuttlies

  • Affiliations:
  • Computer Science 3 (Software Engineering), RWTH Aachen University, Aachen, Germany 52074;Computer Science 3 (Software Engineering), RWTH Aachen University, Aachen, Germany 52074

  • Venue:
  • Applications of Graph Transformations with Industrial Relevance
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

Abstract

PROGRES is one of the most mature graph transformation languages currently available. It offers many language features, also some for non-homomorphic transformations, e.g. set-nodes. Nevertheless, the language does not offer a comfortable possibility to work with complex set-valued structures. However, these are often useful when modeling complex systems, e.g. simulation systems, models-of-computation, or product lines using multiplicity variation points. We introduce the notion of set-valued transformations to PROGRES, define their syntax and semantics and show how they can be simulated using basic language constructs offered by most algorithmic graph transformation languages with a rich set of control structures.