87 research outputs found
Modelling and Analysis Using GROOVE
In this paper we present case studies that describe how the graph transformation tool GROOVE has been used to model problems from a wide variety of domains. These case studies highlight the wide applicability of GROOVE in particular, and of graph transformation in general. They also give concrete templates for using GROOVE in practice. Furthermore, we use the case studies to analyse the main strong and weak points of GROOVE
Model transformation by graph transformation: A comparative study
This is an electronic version of the paper presented at the Model Transformation in Practice, held in Montego Bay on 2005Graph transformation has been widely used for expressing
model transformations. Especially transformations of visual models can
be naturally formulated by graph transformations, since graphs are well
suited to describe the underlying structures of models. Based on a common
sample model transformation, four different model transformation
approaches are presented which all perform graph transformations. At
first, a basic solution is presented and crucial points of model transformations
are indicated. Subsequent solutions focus mainly on the indicated
problems. Finally, a first comparison of the chosen approaches to model
transformation is presented where the main ingredients of each approach
are summarized
Generic Search Plans for Matching Advanced Graph Patterns
In the current paper, we present search plans which can guide pattern
matching for advanced graph patterns with edge identities, containment
constraints, type variables, negative application conditions, attribute
conditions, and injectivity constraints. Based on a generic search graph
representation, all search plan operations (e.g. checking the existence of
an edge, or extending a matching candidate by navigating along an edge) are
uniformly represented as special predicates with heuristically assigned
costs. Finally, an executable search plan is defined as an appropriate
ordering of these predicates. As a main consequence, attribute, injectivity,
and negative application conditions can be checked early (but not
unnecessarily early) in the pattern matching process to cut off infeasible
matching candidates at the right time
Model Instantiation and Type Checking in UMLX
OMG's MDA initiative encourages the use of meta-model based transformations and re-usable specifications. We discuss how Graphical Transformation Notations such as UMLX reduce opportunities for errors in this programming domain
Model Transformations in MT
Model transformations are recognised as a vital aspect of Model Driven Development,but current approaches cover only a small part of the possible spectrum. In this paper I present the MT model transformation which shows how a QVT-like language can be extended with novel pattern matching constructs, how tracing information can be automatically constructed and visualized, and how the transformed model is pruned of extraneous elements. As MT is implemented as a DSL within the Converge language, this paper also demonstrates how a general purpose language can be embedded in a model transformation language, and how DSL development can aid experimentation and exploration of new parts of the model transformation spectrum
Refactoring of UML models using AGG
Model refactoring is an emerging research topic that is heavily inspired
by refactoring of object-oriented programs. Current-day UML modeling environments provide poor support for evolving UML models and applying refactoring techniques at model level. As UML models are intrinsically graph-based in nature we propose to use graph transformations to specify and apply model refactoring. More in particular, we use a specific graph transformation tool, AGG, and provide recommendations of how AGG may be improved to better support model refactoring. These recommendations are based on a small experiment that we have carried out with refactoring of UML class diagrams and state machines
- …