An invariant-based method for the analysis of declarative model-to-model transformations

The final publication is available at Springer via http://dx.doi.org/10.1007/978-3-540-87875-9_3Proceedings of 11th International Conference, MoDELS 2008, Toulouse, France, September 28 - October 3, 2008In this paper we propose a method to derive OCL invariants from declarative specifications of model-to-model transformations. In particular we consider two of the most prominent approaches for specifying such transformations: Triple Graph Grammars and QVT. Once the specification is expressed in the form of invariants, the transformation developer can use such description to verify properties of the original transformation (e.g. whether it defines a total, surjective or injective function), and to validate the transformation by the automatic generation of valid pairs of source and target models.Work supported by the Spanish Ministry of Education and Science, projects MOSAIC (TSI2005-08225-C07-06), MODUWEB (TIN2006-09678) and TIN2005-06053, and an UOC-IN3 research gran

Triple patterns: Compact specifications for the generation of operational triple graph grammar rules

Proceedings of the Sixth International Workshop on Graph Transformation and Visual Modeling Techniques (GT-VMT 2007)Triple Graph Grammars (TGGs) allow the specification of high-level rules modelling the synchronized creation of elements in two graphs related through a correspondence graph. Low-level operational rules are then derived to manipulate concrete graphs. However, TGG rules may become unnecessarily verbose when elements have to be replicated from one graph to the other, and their actual derivation cannot exploit the presence of reoccurring patterns. Moreover they do not take advantage from situations in which a normal creation grammar for one of the graphs exists, from which TGG operational rules can be derived to build the other graph. We present an approach to generating TGG operational rules from normal ones, reducing the information needed to derive them, through the definition of Triple Patterns, a high-level, compact, declarative, and visual notation for the description of admissible structures in a triple graph. Patterns can be expressed with respect to classes defined in a meta-model, and instantiated with derived classes at the model level, thus exploiting the inheritance hierarchies. The application of the generated rules results into the (synchronized or batch) creation of the structures specified in the patterns. We illustrate these concepts by showing their application to the synchronized incremental construction of visual models and of their semantics.This work has been partially sponsored by the Spanish Ministry of Education and Science with projects MOSAIC (TSI2005-08225-C07-06) and MODUWEB (TIN 2006-09678), and the EC’s Human Potential Programme under contract HPRN-CT-2002-00275, SegraVis. The authors gratefully thank the referees for their useful suggestion

Triple Patterns: Compact Specifications for the Generation of Operational Triple Graph Grammar Rules

Triple Graph Grammars (TGGs) allow the specification of high-level rules modelling the synchronized creation of elements in two graphs related through a correspondence graph. Low-level operational rules are then derived to manipulate concrete graphs. However, TGG rules may become unnecessarily verbose when elements have to be replicated from one graph to the other, and their actual derivation cannot exploit the presence of reoccurring patterns. Moreover they do not take advantage from situations in which a normal creation grammar for one of the graphs exists, from which TGG operational rules can be derived to build the other graph. We present an approach to generating TGG operational rules from normal ones, reducing the information needed to derive them, through the definition of Triple Patterns, a high-level, compact, declarative, and visual notation for the description of admissible structures in a triple graph. Patterns can be expressed with respect to classes defined in a meta-model, and instantiated with derived classes at the model level, thus exploiting the inheritance hierarchies. The application of the generated rules results into the (synchronized or batch) creation of the structures specified in the patterns. We illustrate these concepts by showing their application to the synchronized incremental construction of visual models and of their semantics

Pattern-based model-to-model transformation: Handling attribute conditions

The final publication is available at Springer via http://dx.doi.org/10.1007/978-3-642-02408-5_7Proceedings of Second International Conference, ICMT 2009, Zurich, Switzerland, June 29-30, 2009Pattern-based model-to-model transformation is a new approach for specifying transformations in a declarative, relational and formal style. The language relies on patterns describing allowed or forbidden relations between two models, which are compiled into operational mechanisms to perform forward and backward transformations. In this paper, we extend the approach for handling attribute conditions expressed in some suitable logic, adapt the operational mechanisms based on graph transformation to relax attribute handling by constraint solving, and discuss heuristics for the compilation of patterns into rules.Work supported by the Spanish Ministry of Science and Innovation, projects METEORIC (TIN2008-02081),MODUWEB (TIN2006-09678) and FORMALISM (TIN2007-66523).Moreover, part of this work was done during a sabbatical leave of the third author at TU Berlin, with financial support from the Ministerio de Ciencia e Innovaci´on (grant ref. PR2008-0185). We thank the referees for their useful comment

Using domain specific languages to capture design knowledge for model-based systems engineering

Design synthesis is a fundamental engineering task that involves the creation of structure from a desired functional specification; it involves both creating a system topology as well as sizing the system's components. Although the use of computer tools is common throughout the design process, design synthesis is often a task left to the designer. At the synthesis stage of the design process, designers have an extensive choice of design alternatives that need to be considered and evaluated. Designers can benefit from computational synthesis methods in the creative phase of the design process. Recent increases in computational power allow automated synthesis methods for rapidly generating a large number of design solutions. Combining an automated synthesis method with an evaluation framework allows for a more thorough exploration of the design space as well as for a reduction of the time and cost needed to design a system. To facilitate computational synthesis, knowledge about feasible system configurations must be captured. Since it is difficult to capture such synthesis knowledge about any possible system, a design domain must be chosen. In this thesis, the design domain is hydraulic systems. In this thesis, Model-Driven Software Development concepts are leveraged to create a framework to automate the synthesis of hydraulic systems will be presented and demonstrated. This includes the presentation of a domain specific language to describe the function and structure of hydraulic systems as well as a framework for synthesizing hydraulic systems using graph grammars to generate system topologies. Also, a method using graph grammars for generating analysis models from the described structural system representations is presented. This approach fits in the context of Model-Based Systems Engineering where a variety of formal models are used to represent knowledge about a system. It uses the Systems Modeling Language developed by The Object Management Group (OMG SysML™) as a unifying language for model definition.M.S.Committee Chair: Paredis, Chris; Committee Member: McGinnis, Leon; Committee Member: Schaefer, Dir

Integrating models and simulations of continuous dynamic system behavior into SysML

Contemporary systems engineering problems are becoming increasingly complex as they are handled by geographically distributed design teams, constrained by the objectives of multiple stakeholders, and inundated by large quantities of design information. According to the principles of model-based systems engineering (MBSE), engineers can effectively manage increasing complexity by replacing document-centric design methods with computerized, model-based approaches. In this thesis, modeling constructs from SysML and Modelica are integrated to improve support for MBSE. The Object Management Group has recently developed the Systems Modeling Language (OMG SysML ) to provide a comprehensive set constructs for modeling many common aspects of systems engineering problems (e.g. system requirements, structures, functions). Complementing these SysML constructs, the Modelica language has emerged as a standard for modeling the continuous dynamics (CD) of systems in terms of hybrid discrete- event and differential algebraic equation systems. The integration of SysML and Modelica is explored from three different perspectives: the definition of CD models in SysML; the use of graph transformations to automate the transformation of SysML CD models into Modelica models; and the integration of CD models and other SysML models (e.g. structural, requirements) through the depiction of simulation experiments and engineering analyses. Throughout the thesis, example models of a car suspension and a hydraulically-powered excavator are used for demonstration. The core result of this work is the provision of modeling abilities that do not exist independently in SysML or Modelica. These abilities allow systems engineers to prescribe necessary system analyses and relate them to stakeholder concerns and other system aspects. Moreover, this work provides a basis for model integration which can be generalized and re-specialized for integrating other modeling formalisms into SysML.M.S.Committee Chair: Chris Paredis; Committee Member: Dirk Schaefer; Committee Member: Russell Pea

Bidirectional model transformations in QVT: semantic issues and open questions

We consider the OMG’s Queries, Views and Transformation