Achieving Rule Interoperability Using Chains of Model Transformations

2009 ◽  
pp. 249-259 ◽  
Author(s):  
Marcos Didonet Del Fabro ◽  
Patrick Albert ◽  
Jean Bézivin ◽  
Frédéric Jouault
Keyword(s):  
Model Transformations

scholarly journals Termination Analysis of Model Transformations by Petri Nets

2006 ◽  
pp. 260-274 ◽  
Author(s):  
Dániel Varró ◽  
Szilvia Varró–Gyapay ◽  
Hartmut Ehrig ◽  
Ulrike Prange ◽  
Gabriele Taentzer
Keyword(s):  
Petri Nets ◽  
Model Transformations ◽  
Termination Analysis

scholarly journals Agile validation of model transformations using compound F-Alloy specifications

2018 ◽  
Vol 162 ◽  
pp. 55-75 ◽  
Author(s):  
Loïc Gammaitoni ◽  
Pierre Kelsen ◽  
Qin Ma
Keyword(s):  
Model Transformations

scholarly journals Model-driven engineering city spaces via bidirectional model transformations

2021 ◽  
Author(s):  
Ennio Visconti ◽  
Christos Tsigkanos ◽  
Zhenjiang Hu ◽  
Carlo Ghezzi
Keyword(s):  
Software Engineering ◽  
Physical Space ◽  
Relevant Information ◽  
Domain Model ◽  
International Standards ◽  
Model Transformations ◽  
Context Analysis ◽  
Support Design ◽  
Programming Technique ◽  
Graph Theoretic

AbstractEngineering cyber-physical systems inhabiting contemporary urban spatial environments demands software engineering facilities to support design and operation. Tools and approaches in civil engineering and architectural informatics produce artifacts that are geometrical or geographical representations describing physical spaces. The models we consider conform to the CityGML standard; although relying on international standards and accessible in machine-readable formats, such physical space descriptions often lack semantic information that can be used to support analyses. In our context, analysis as commonly understood in software engineering refers to reasoning on properties of an abstracted model—in this case a city design. We support model-based development, firstly by providing a way to derive analyzable models from CityGML descriptions, and secondly, we ensure that changes performed are propagated correctly. Essentially, a digital twin of a city is kept synchronized, in both directions, with the information from the actual city. Specifically, our formal programming technique and accompanying technical framework assure that relevant information added, or changes applied to the domain (resp. analyzable) model are reflected back in the analyzable (resp. domain) model automatically and coherently. The technique developed is rooted in the theory of bidirectional transformations, which guarantees that synchronization between models is consistent and well behaved. Produced models can bootstrap graph-theoretic, spatial or dynamic analyses. We demonstrate that bidirectional transformations can be achieved in practice on real city models.

Applying CIM-to-PIM model transformations for the service-oriented development of information systems

2011 ◽  
Vol 53 (1) ◽  
pp. 87-105 ◽  
Author(s):  
Valeria De Castro ◽  
Esperanza Marcos ◽  
Juan Manuel Vara
Keyword(s):  
Information Systems ◽  
Model Transformations ◽  
Service Oriented

A NOVEL APPROACH TO VERIFY GRAPH SCHEMA-BASED SOFTWARE SYSTEMS

2009 ◽  
Vol 19 (06) ◽  
pp. 857-870 ◽  
Author(s):  
VAHID RAFE ◽  
ADEL T. RAHMANI
Keyword(s):  
Graph Transformation ◽  
Behavioral Modeling ◽  
Model Transformations ◽  
Software Systems ◽  
Hierarchical Systems ◽  
Input Language ◽  
Novel Approach ◽  
Graph Schema ◽  
Transformation Systems ◽  
Graph Transformation Systems

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.

Sign in / Sign up

Export Citation Format

Share Document