Model Transformation Using Graph Transactions

  • Authors:

  • Leila Ribeiro;Luciana Foss;Bruno Silva;Daltro Nunes

  • Affiliations:

  • Instituto de Informática, Universidade Federal do Rio Grande do Sul, Porto Alegre, Brazil 91501-970;Instituto de Informática, Universidade Federal do Rio Grande do Sul, Porto Alegre, Brazil 91501-970;Instituto de Informática, Universidade Federal do Rio Grande do Sul, Porto Alegre, Brazil 91501-970;Instituto de Informática, Universidade Federal do Rio Grande do Sul, Porto Alegre, Brazil 91501-970

  • Venue:
  • ICSR '09 Proceedings of the 11th International Conference on Software Reuse: Formal Foundations of Reuse and Domain Engineering
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

Model transformations are central to model driven software engineering. The main aim of defining a model transformation is to reuse this model by adapting it to a new situation or context (aims of transformation include synthesis, reverse engineering, migration, optimization, refactoring, etc). Given two metamodels T 1 and T 2 a model transformation takes as input a model of T 1 and delivers as result a corresponding model with respect to T 2. Since many modelling languages are diagrammatic (like class-diagrams, message sequence charts, state charts), it is natural to use graphs as a formal basis to describe metamodels of these languages. Rules that transform graphs can be used to describe the transformation process. Here we propose the use graph grammars with transactions to describe model transformations. The notion of (graph) transaction can be very useful in proving essential properties of model transformation, like termination, confluence and correctness.