Diagrammatic Development of Domain Specific Modelling Languages with WebDPF

Author(s):  
Fazle Rabbi ◽  
Yngve Lamo ◽  
Ingrid Chieh Yu ◽  
Lars Michael Kristensen

Domain specific modelling languages reduce the effort required to specify systems by providing higher level abstractions. Although this is a promising approach for reducing the complexity of system specifications, creating a new domain specific modelling language is a complex task. WebDPF is a web-based metamodelling tool that aims to reduce the effort required to develop domain specific modelling languages. The proposed technique is based on model transformations which enhances a modelling language with auto-completion. WebDPF supports multilevel metamodelling, diagrammatic specification of model constraints, and development, simulation and analysis of model transformation systems. The authors study the termination of the underlying model transformation systems and provide sufficient condition for termination. The tool is equipped with a scalable model navigation facility that enables a modeler to deal with large models.

Author(s):  
Artur Boronat

Abstract When model transformations are used to implement consistency relations between very large models, incrementality plays a cornerstone role in detecting and resolving inconsistencies efficiently when models are updated. Given a directed consistency relation between two models, the problem studied in this work consists in propagating model changes from a source model to a target model in order to ensure consistency while minimizing computational costs. The mechanism that enforces such consistency is called consistency maintainer and, in this context, its scalability is a required non-functional requirement. State-of-the-art model transformation engines with support for incrementality normally rely on an observer pattern for linking model changes, also known as deltas, to the application of model transformation rules, in so-called dependencies, at run time. These model changes can then be propagated along an already executed model transformation. Only a few approaches to model transformation provide domain-specific languages for representing and storing model changes in order to enable their use in asynchronous, event-based execution environments. The principal contribution of this work is the design of a forward change propagation mechanism for incremental execution of model transformations, which decouples dependency tracking from change propagation using two innovations. First, the observer pattern-based model is replaced with dependency injection, decoupling domain models from consistency maintainers. Second, a standardized representation of model changes is reused, enabling interoperability with EMF-compliant tools, both for defining model changes and for processing them asynchronously. This procedure has been implemented in a model transformation engine, whose performance has been evaluated experimentally using the VIATRA CPS benchmark. In the experiments performed, the new transformation engine shows gains in the form of several orders of magnitude in the initial phase of the incremental execution of the benchmark model transformation and change propagation is performed in real time for those model sizes that are processable by other tools and, in addition, is able to process much larger models.


Author(s):  
Harald Kühn ◽  
Marion Murzek ◽  
Gerhard Specht ◽  
Srdjan Zivkovic

Public and private organisations have a high rate of interaction, i.e. all their external business processes are de-facto inter-organisational. Besides traditional non-functional aspects, inter-organisational processes demand a high rate of interoperability. The authors present a model-driven development process explicitly considering interoperability levels as development process phases. Applying this development process has shown that it substantially raises the interoperability awareness for all associated actors. To further improve “common sense” between the involved actors, we use an integrated modelling language approach. For this, the metamodels of the used modelling languages are integrated using metamodel integration based on metamodel mappings and integration rules. The approach is demonstrated by integrating BPMN-based business process modelling and CCTS-based data modelling into a consolidated modelling language. Considering the integrated metamodel, the authors apply model transformation to re-use model information along the described development phases, e.g. business process definitions are used to generate skeletons for executable workflows and business document definitions are used to generate data model definitions and associated data schemata. The application of the model-driven development process, the metamodel integration as well as the model transformation is illustrated by a case study of electronic VAT statement transaction.


2014 ◽  
Vol 24 (4) ◽  
Author(s):  
DÉNES BISZTRAY ◽  
REIKO HECKEL

In model transformations, where source models are automatically translated into target models or code, termination is necessary for the transformation to be well defined. There are a number of specific termination criteria that can be used when specifying model transformations by graph transformation, though termination is undecidable in general. Unfortunately, and particularly for large and heterogeneous specifications, it is often not possible to use a single termination criterion. In this paper, we propose an approach that applies different criteria to suitable subsets of rules so that termination can be shown locally using the most suitable technique for each subset. Global termination then follows if certain causal dependencies between rules in different subsets are acyclic. The theory is developed at the level of typed attributed graphs, and is motivated and illustrated by a case study translating UML activity diagrams to CSP.


2020 ◽  
Vol 19 (5) ◽  
pp. 1083-1106
Author(s):  
Ran Wei ◽  
Athanasios Zolotas ◽  
Horacio Hoyos Rodriguez ◽  
Simos Gerasimou ◽  
Dimitrios S. Kolovos ◽  
...  

Abstract UML profiles offer an intuitive way for developers to build domain-specific modelling languages by reusing and extending UML concepts. Eclipse Papyrus is a powerful open-source UML modelling tool which supports UML profiling. However, with power comes complexity, implementing non-trivial UML profiles and their supporting editors in Papyrus typically requires the developers to handcraft and maintain a number of interconnected models through a loosely guided, labour-intensive and error-prone process. We demonstrate how metamodel annotations and model transformation techniques can help manage the complexity of Papyrus in the creation of UML profiles and their supporting editors. We present Jorvik, an open-source tool that implements the proposed approach. We illustrate its functionality with examples, and we evaluate our approach by comparing it against manual UML profile specification and editor implementation using a non-trivial enterprise modelling language (Archimate) as a case study. We also perform a user study in which developers are asked to produce identical editors using both Papyrus and Jorvik demonstrating the substantial productivity and maintainability benefits that Jorvik delivers.


Author(s):  
FRANK HERMANN ◽  
HARTMUT EHRIG ◽  
ULRIKE GOLAS ◽  
FERNANDO OREJAS

Triple graph grammars (TGGs) are a well-established concept for the specification and execution of bidirectional model transformations within model driven software engineering. Their main advantage is an automatic generation of operational rules for forward and backward model transformations, which simplifies specification and enhances usability as well as consistency. In this paper we present several important results for analysing model transformations based on the formal categorical foundation of TGGs within the framework of attributed graph transformation systems.Our first main result shows that the crucial properties of correctness and completeness are ensured for model transformations. In order to analyse functional behaviour, we generate a new kind of operational rule, called aforward translation rule. We apply existing results for the analysis of local confluence for attributed graph transformation systems. As additional main results, we provide sufficient criteria for the verification of functional behaviour as well as a necessary and sufficient condition for strong functional behaviour. In fact, these conditions imply polynomial complexity for the execution of the model transformation. We also analyse information and complete information preservation of model transformations, that is, whether a source model can be reconstructed (uniquely) from the target model computed by the model transformation. We illustrate the results for the well-known model transformation example from class diagrams to relational database models.


2010 ◽  
Vol 27 (3) ◽  
pp. 207-216 ◽  
Author(s):  
Luis Iribarne ◽  
Nicolás Padilla ◽  
Javier Criado ◽  
José-Andrés Asensio ◽  
Rosa Ayala

Author(s):  
VAHID RAFE ◽  
ADEL T. RAHMANI

Graph Grammars have recently become more and more popular as a general formal modeling language. Behavioral modeling of dynamic systems and model to model transformations are a few well-known examples in which graphs have proven their usefulness in software engineering. A special type of graph transformation systems is layered graphs. Layered graphs are a suitable formalism for modeling hierarchical systems. However, most of the research so far concentrated on graph transformation systems as a modeling means, without considering the need for suitable analysis tools. In this paper we concentrate on how to analyze these models. We will describe our approach to show how one can verify the designed graph transformation systems. To verify graph transformation systems we use a novel approach: using Bogor model checker to verify graph transformation systems. The AGG-like graph transformation systems are translated to BIR — the input language of Bogor — and Bogor verifies that model against some properties defined by combining LTL and special purpose graph rules. Supporting schema-based and layered graphs characterize our approach among existing solutions for verification of graph transformation systems.


Author(s):  
Jesús Sánchez Cuadrado ◽  
Javier Luis Cánovas Izquierdo ◽  
Jesús García Molina

Domain Specific Languages (DSL) are becoming increasingly more important with the emergence of Model-Driven paradigms. Most literature on DSLs is focused on describing particular languages, and there is still a lack of works that compare different approaches or carry out empirical studies regarding the construction or usage of DSLs. Several design choices must be made when building a DSL, but one important question is whether the DSL will be external or internal, since this affects the other aspects of the language. This chapter aims to provide developers confronting the internal-external dichotomy with guidance, through a comparison of the RubyTL and Gra2MoL model transformations languages, which have been built as an internal DSL and an external DSL, respectively. Both languages will first be introduced, and certain implementation issues will be discussed. The two languages will then be compared, and the advantages and disadvantages of each approach will be shown. Finally, some of the lessons learned will be presented.


2020 ◽  
Vol 5 (4) ◽  
pp. 208
Author(s):  
Euis Sitinur Aisyah ◽  
Ratna Nur Aulia ◽  
Ridhoi Ahmad Ridwan

<p><em>Abstrak - <strong>Sistem pendidikan dan pelatihan pada PMI Kota Tangerang yang berjalan saat ini masih semi komputerisasi. Pengetesan dan penilaian materi masih manual sehingga sering terjadi kesalahan input nilai peserta, memerlukan proses dan waktu yang cukup lama untuk mengetahui kelulusan peserta diklat yang mengakibatkan terlambatnya laporan panitia kepada Kadiv SDM. Metode penelitian yang digunakan terdiri dari wawancara, observasi, dan studi pustaka. Metode analisis menggunakan metode analisis PIECES. Pemodelan sistem dengan menggunakan Unified Modelling Language (UML) untuk menggambarkan secara visualisasi, yang selanjutnya diimplementasikan dengan bahasa pemrograman PHP dengan basis data MySQL-Server sebagai database. Hasil yang didapat dari penelitian ini adalah sebuah sistem aplikasi diklat relawan PMI berbasis web yang terdatabase untuk membantu dalam hal pengelolaan data mulai dari pendaftaran, pemberian materi, keadiran, pengetesan, dan penilaian.</strong></em></p><p><em>Abstract</em> – <strong>The education and training system at the PMI Kota Tangerang that is currently running is still semi-computerized. The testing and evaluation of material are still manual so that there are often input errors in the participants' scores, it requires a long process and time to find out the graduation of the training participants which results in the delay of the committee's report to the Head of HR Division. The research method used consisted of interviews, observation, and literature study. The analytical method uses the PIECES analysis method. Modeling the system using Unified Modeling Language (UML) to visualize, which is then implemented with the PHP programming language with the MySQL-Server database as a database. The results obtained from this study are a web-based PMI volunteer education and training system database that is assisted regarding data management ranging from registration, material delivery, presence, testing, and assessment.</strong></p><p><strong><em>Keywords - </em></strong><em>Education and Training, Systems, Volunteers</em></p>


Sign in / Sign up

Export Citation Format

Share Document