Towards Transformation Rule Composition

نویسندگان

  • Eugene Syriani
  • Márk Asztalos
  • Manuel Wimmer
  • Marouane Kessentini
چکیده

Many model transformation problems require different intermediate transformation steps. For example, platform-specific models (PSM) are often generated from platform-independent models (PIM) by chains of model transformations. This requires the presence of several intermediate meta-models between those of the PIM and the PSM. Thus, most of the effort is needed to define a transformation mechanism for each intermediate step. The solution proposed in this paper is to investigate whether it is possible to generate a single transformation from a chain of transformations, solely involving the initial PIM and final PSM meta-models. The presented work focuses on the composition of transformations at the rule level. We apply the automatic procedure for composing rules in the context of the evolution of the Enterprise Java Beans (EJB) language, transforming UML models into EJB 2.0 models and then to EJB 3.0 models.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Towards Formal Verification of Web Service Composition

Correct notation for specifying the composite service alone is not sufficient to guarantee reliability, thus comes a strong demand on modeling and verifying web services composition languages. This paper presented a formal method of web service composition verification based on Petri net. Focus is given on BPEL4WS specification, of which both behavior semantics and communication semantics are c...

متن کامل

Composition Techniques for Rule-Based Model Transformation Languages

Model transformation languages have matured to a point where people have started experimenting with model transformation definitions themselves in addition to the language they are written in. In addition to the transformation language properties, the properties of model transformation definitions themselves become important, such as scalability, maintainability and reusability. Composition of ...

متن کامل

Pattern composition in graph transformation rules

Graph transformation (GT) frequently serves as a precise underlying specification mechanism for model transformations within and between modeling languages. However, composability of graph transformation rules is typically limited to inter-level rule composition (i.e. rules calling other rules). In the current paper, we introduce intra-level composition for GT rules where the left-hand side and...

متن کامل

Towards a New Algebraic Approach to Graph Transformation. Basic Concepts, Sequentialization and Parallelism: Long Version

This paper presents a new characterization of graph transformation rules for simple digraphs based on boolean matrix algebra. We introduce the concept of coherence, which allows the analysis of potential incompatibilities among rules that take part in a sequence of productions. Concurrency is studied under the interleaving and the explicit parallelism views. For the former, the notion of sequen...

متن کامل

Refinements and Modules for Typed Graph Transformation Systems

Spatial and temporal reenement relations between typed graph transformation systems have been introduced in 6, 7]. In a spatial reenement each rule is reened by an amalgamation of rules while in a temporal reenement it is reened by a sequence of rules: in both cases, the reenement relation supports the modeling of implementation. In the rst part of this paper, we further investigate the propert...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • ECEASST

دوره 42  شماره 

صفحات  -

تاریخ انتشار 2011