31,842 research outputs found
Refactoring of Model Transformations
Model-to-model transformations between visual languages are often defined by typed, attributed graph transformation systems. Here, the source and target languages of the model transformation are given by type graphs (or meta models),
and the relation between source and target model elements is captured by graph transformation rules. On the other hand, refactoring is a technique to improve the structure of a model in order to make it easier to comprehend, more maintainable
and amenable to change. Refactoring can be defined by graph transformation rules, too. In the context of model transformation, problems arise when models of the source language of a model transformation become subject to refactoring. It may well be the case that after the refactoring, the model transformation rules are no longer applicable because the refactoring induced structural changes in the models. In this paper, we consider a graph-transformation-based evolution of model transformations
which adapts the model transformation rules to the refactored models.
In the main result, we show that under suitable assumptions, the evolution leads to an adapted model transformation which is compatible with refactoring of the source and target models. In a small case study, we apply our techniques to a well-known
model transformation from statecharts to Petri nets
Evolution of Model Transformations by Model Refactoring: Long Version
Model-to-model transformations between visual languages are often defined by typed, attributed graph transformation systems. Here, the source and target languages of the model transformation are given by type graphs (or meta models), and the relation between source and target model elements is captured by graph transformation rules. On the other hand, refactoring is a technique to improve the structure of a model in order to make it easier to comprehend, more maintainable and amenable to change. Refactoring can be defined by graph transformation rules, too. In the context of model transformation, problems arise when models of the source language of a model transformation become subject to refactoring. It may well be the case that after the refactoring, the model transformation rules are no longer applicable because the refactoring induced structural changes in the models. In this paper, we consider a graph-transformation-based evolution of model transformations which adapts the model transformation rules to the refactored models. In the main result, we show that under suitable assumptions, the evolution leads to an adapted model transformation which is compatible with refactoring of the source and target models. In a small case study, we apply our techniques to a well-known model transformation from statecharts to Petri nets
GMF: A Model Migration Case for the Transformation Tool Contest
Using a real-life evolution taken from the Graphical Modeling Framework, we
invite submissions to explore ways in which model transformation and migration
tools can be used to migrate models in response to metamodel adaptation.Comment: In Proceedings TTC 2011, arXiv:1111.440
PORGY: a Visual Analytics Platform for System Modelling and Analysis Based on Graph Rewriting
PORGY is a visual environment for rule-based modelling based on port graphs and port graph rewrite rules whose application is steered by rewriting strategies. The focus of this demonstration is the visual and interactive features offered by PORGY, which facilitate an exploratory approach to model, simu- late and analyse different ways of applying the rules while recording the model evolution, as well as tracking and plotting system parameters
Counterpart semantics for a second-order mu-calculus
We propose a novel approach to the semantics of quantified Ό-calculi, considering models where states are algebras; the evolution relation is given by a counterpart relation (a family of partial homomorphisms), allowing for the creation, deletion, and merging of components; and formulas are interpreted over sets of state assignments (families of substitutions, associating formula variables to state components). Our proposal avoids the limitations of existing approaches, usually enforcing restrictions of the evolution relation: the resulting semantics is a streamlined and intuitively appealing one, yet it is general enough to cover most of the alternative proposals we are aware of
- âŠ