Transformation of Typed Composite Graphs with Inheritance and Containment Structures

  • Authors:
  • Stefan Jurack;Gabriele Taentzer

  • Affiliations:
  • (Correspd.) (We thank Ulrike Golas for her valuable comments on a previous version of this article) Department of Mathematics and Computer Science, Philipps-Universität Marburg, Hans-Meerwein ...;(We thank Ulrike Golas for her valuable comments on a previous version of this article) Department of Mathematics and Computer Science, Philipps-Universität Marburg, Hans-Meerwein-Strasse, 35 ...

  • Venue:
  • Fundamenta Informaticae - Recent Developments in the Theory of Graph Transformation, 2010
  • Year:
  • 2012

Quantified Score

Hi-index 0.00

Visualization

Abstract

Model-driven development (MDD) has become a promising trend in software engineering. The model-driven development of highly complex software systems may lead to large models which deserve a modularization concept to enable their structured development in larger teams. Graphs are a natural way to represent the underlying structure of visual models. Typed graphs with inheritance and containment structures are well suited to describe the essentials of models based on the Eclipse Modeling Framework (EMF). Composite graphs can specify the logical distribution of EMF models and therefore, can form the conceptual basis for composite modeling in model-driven development. This is done based on the formal foundation of distributed graphs. Moreover, this category-theoretical foundation allows for the precise definition of consistent composite graph transformations satisfying all inheritance and containment conditions.