Keywords: Model transformation, CPN, Verification
Astract: Model-Driven Engineering (MDE) places models in the center of the software lifecycle. Model transformations play a vital role in this context whereas several model transformation languages and types of model transformations are available. This diploma theseis only addressed the issue of the model-to-model transformation (M2M). All this languages or approaches have the problem that they are not easy to understand respectively irreproducible. This makes them hard to debug and to analyse. This problem excites from the execution of the transformation in the form of a black-box which hides the operational sematic.
Therefore there are only marginal informations about the transformation process. A comprehensive analysis is important because errors in model transformations can appear on various points for instance on the source and target metamodel, source and target model and on the transformation logic. All this has a direct consequence to the correctness of the transformation and all following steps in the software lifecycle. The main problem of the MDE is currently the so far only unsatisfying answered question of analysing model transformations.
This diploma thesis pickes up the described problems in the analysis of model transformations and tries on the basis of transformation nets to go into detail of the veri cation. The transformation net formalism is based on coloured petri nets which offer a set of analysis methods. This thesis explores if the mentioned analysis methodes can be applied after the reduction of transformation nets to coloured petri nets and in which kind transformation net speci fics have an impact on this process. Beyond that this thesis investigates the support of widespread and already in industrial environment used tools for coloured petri nets. As a final step the already existing "Transformations On Petri Nets In Color" prototype for transformation nets gets extended to support analytical properties for model transformations.

Keywords:
Astract: Model-Driven Engineering places models as first-class artifacts throughout the software lifecycle requiring the availability of proper transformation languages. Although numerous approaches are available, they lack convenient facilities for supporting debugging and understanding of the transformation logic. This is because execution engines operate on a low level of abstraction, hide the operational semantics of a transformation, scatter metamodels, models, transformation logic, and trace information across different artifacts, and provide limited verification support. To tackle these problems, we propose a Domain-Specific Language (DSL) on top of Colored Petri Nets (CPNs)-called Transformation Nets-for the execution and debugging of model transformations on a high level of abstraction. This formalism makes the afore hidden operational semantics explicit by providing a runtime model in terms of places, transitions and tokens, integrating all artifacts involved into a homogenous view. Moreover, the formal underpinnings of CPNs enable comprehensive verification of model transformations.

Keywords:
Astract: In optimistic versioning, multiple developers are allowed to modify an artifact at the same time. On the one hand this approach increases productivity as the development process is never stalled due to locks on an artifact. On the other hand conflicts may arise when it comes to merging the different modifications into one consolidated version. In general, the resolution of such conflicts is not only cumbersome, but also error-prone. Especially if the artifacts under version control are models, little support is provided by standard versioning systems. In this paper we present the enhanced versioning process of the model versioning system AMOR. We show how AMOR is configured in order to obtain a precise conflict report which allows the recommendation of automatically executable resolution patterns. The user of AMOR chooses either one of the recommendations or performs manual resolution. The manual resolution may be in collaboration with other developers and allows to infer new resolution patterns which may be applied in similar situations.

Keywords:
Astract: During the last decade several approaches have been proposed for easing the burden of writing model transformation rules manually. Among them are Model Transformation By-Demonstration (MTBD) approaches which record actions performed on example models to derive general operations. A current restriction of MTBD is that until now they are only available for in-place transformations, but not for model-to-model (M2M) transformations. In this paper, we extend our MTBD approach, which is designed for in-place transformations, to also support M2M transformations. In particular, we propose to demonstrate each transformation rule by modeling a source model fragment and a corresponding target model fragment. From these example pairs, the applied edit operations are computed which are input for a semi-automatic process for deriving the general transformation rules. For showing the applicability of the approach, we developed an Eclipse-based prototype supporting the generation of ATL code out of EMF-based example models.

Keywords:
Astract: Model transformations play a key role in the vision of Model-Driven Engineering. Nevertheless, mechanisms like abstraction, variation and composition for specifying and applying reusable model transformations - like urgently needed for resolving recurring structural heterogeneities - are insufficiently supported so far. Therefore, we propose to specify model transformations by a set of pre-defined mapping operators (MOps), each resolving a certain kind of structural heterogeneity. Firstly, these MOps can be used in the context of arbitrary metamodels since they abstract from concrete metamodel types. Secondly, MOps can be tailored to resolve certain structural heterogeneities by means of black-box reuse. Thirdly, based on a systematic set of kernel MOps resolving basic heterogeneities, composite ones can be built in order to deal with more complex scenarios. Finally, an extensible library of MOps is proposed, allowing for automatically executable mapping specifications since every MOp exhibits a clearly defined operational semantics.