Modeling Successively Connected Repetitive Subgraphs

  • Authors:
  • Anne-Thérèse Körtgen

  • Affiliations:
  • Department of Computer Science 3, RWTH Aachen University, Aachen, Germany D-52074

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

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this contribution, we introduce an extension of the graph transformation language PROGRES that allows to specify repetitive subgraphs in a compact and comprehensible way. They can be pattern-matched as well as created. Unlike other approaches, the extension supports specifying successively connected repetitive subgraphs, i.e. inter-connections among the repeated instances of the subgraphs are expressed by edges in the graph pattern. The need for this modeling feature arose during a case study with the software company innotec developing tools for data handling in chemical engineering development processes. In this paper, we introduce syntax and semantics of the extension by giving a translation of extended PROGRES transformations into plain PROGRES. Furthermore, we show the application of this modeling feature within our project dealing with consistency maintenance.