%0 Journal Article %1 kuster_06_definition %A Küster, Jochen M. %D 2006 %J Software and Systems Modeling %K model_transformation _hardcopy 2006 statecharts _folder_2 csp %N 3 %P 233--259 %R 10.1007/s10270-006-0018-8 %T Definition and validation of model transformations %U http://dx.doi.org/10.1007/s10270-006-0018-8 %V V5 %X With model transformations becoming more widely used, there is an increasing need for approaches focussing on a systematic development of model transformations. Although a number of approaches for specifying model transformations exist, none of them focusses on systematically validating model transformations with respect to termination and confluence. Termination and confluence ensure that a model transformation always produces a unique result. Also called functionality, these properties are important requirements for practical applicatons of model transformations. In this paper, we introduce our approach to model transformation. Using and extending results from the theory of graph transformation, we investigate termination and confluence properties of model transformations specified in our approach. We establish a set of criteria for termination and confluence to be checked at design time by static analysis of the transformation rules and the underlying metamodels. Moreover, the criteria are formulated in such a way that they require less experience with the theory of graph transformation. Our concepts are illustrated by a running example of a model tranformation from statecharts to the process algebra Communicating Sequential Processes.

@article{kuster_06_definition, abstract = {With model transformations becoming more widely used, there is an increasing need for approaches focussing on a systematic development of model transformations. Although a number of approaches for specifying model transformations exist, none of them focusses on systematically validating model transformations with respect to termination and confluence. Termination and confluence ensure that a model transformation always produces a unique result. Also called functionality, these properties are important requirements for practical applicatons of model transformations. In this paper, we introduce our approach to model transformation. Using and extending results from the theory of graph transformation, we investigate termination and confluence properties of model transformations specified in our approach. We establish a set of criteria for termination and confluence to be checked at design time by static analysis of the transformation rules and the underlying metamodels. Moreover, the criteria are formulated in such a way that they require less experience with the theory of graph transformation. Our concepts are illustrated by a running example of a model tranformation from statecharts to the process algebra Communicating Sequential Processes.}, added-at = {2009-02-11T20:57:37.000+0100}, author = {K"{u}ster, Jochen M.}, biburl = {https://www.bibsonomy.org/bibtex/2286d5c88df3de872e8e1000420e9eb46/leonardo}, citeulike-article-id = {887601}, doi = {10.1007/s10270-006-0018-8}, interhash = {35cfc50919473419e3da9945243d4ef0}, intrahash = {286d5c88df3de872e8e1000420e9eb46}, journal = {Software and Systems Modeling}, keywords = {model_transformation _hardcopy 2006 statecharts _folder_2 csp}, number = 3, pages = {233--259}, posted-at = {2006-10-06 23:25:54}, priority = {5}, timestamp = {2009-02-11T20:57:37.000+0100}, title = {Definition and validation of model transformations}, url = {http://dx.doi.org/10.1007/s10270-006-0018-8}, volume = {V5}, year = 2006 }