Termination Criteria for Model Transformation
نویسندگان
چکیده
Model Transformation has become central to most software engineering activities. It refers to the process of modifying a (usually graphical) model for the purpose of analysis (by its transformation to some other domain), optimization, evolution, migration or even code generation. In this work, we show our approach to express model transformation based on graph transformation. This framework offers visual and formal techniques based on rules, in such a way that model transformations can be subject to analysis. Previous results on graph transformation are extended by proving the termination of a transformation if the rules applied meet certain criteria. We show the suitability of the approach by an example in which we translate a simplified version of Statecharts into Petri nets for functional correctness analysis.
منابع مشابه
Termination Criteria for DPO Transformations with Injective Matches
Reasoning about graph and model transformation systems is an important means to underpin model-driven software engineering, such as Model-Driven Architecture (MDA) and Model Integrated Computing (MIC). Termination criteria for graph and model transformation systems have become a focused area recently. This paper provides termination criteria for graph and model transformation systems with injec...
متن کاملExecution Properties of a Visual Control Flow Language
Graph rewriting-based model processing is a widely used technique for model transformation. Especially visual model transformations can be expressed by graph transformations, since graphs are well-suited to describe the underlying structures of graphical models. Model transformations often need to follow an algorithm that requires a strict control over the execution sequence of the transformati...
متن کاملTermination of High-Level Replacement Units with Application to Model Transformation
Visual rewriting techniques are increasingly used to model transformations of systems speci ed through diagrammatic sentences. Graph transformations, in particular, are a widespread formalism with several applications, from parsing to model animation or transformation. Although a wealth of rewriting models have been proposed, di ering in the expressivity of the types of rules and in the complex...
متن کاملHigh-level replacement units and their termination properties
Visual rewriting techniques, in particular graph transformations, are increasingly used to model transformations of systems specified through diagrammatic sentences. Several rewriting models have been proposed, differing in the expressivity of the types of rules and in the complexity of the rewriting mechanism; yet, for many of them, basic results concerning the formal properties of these model...
متن کاملPreserving Termination of Tabled
We provide a rst investigation of the specialisation and transformation of tabled logic programs through unfolding. We show that | surprisingly | unfolding, even determinate, can worsen the termination behaviour in the context of tabling. We therefore establish two criteria which ensure that such mishaps are avoided. We also brieey discuss the innuence of some other transformation techniques on...
متن کامل