Filters








1,084 Hits in 3.7 sec

Correctness of Incremental Model Synchronization with Triple Graph Grammars [chapter]

Fernando Orejas, Elvira Pino
2014 Lecture Notes in Computer Science  
In this case, we say that these models are consistently integrated. Triple Graph Grammars (TGGs), defined by Schürr, are a general and powerful tool to describe (bidirectional) model transformations.  ...  Moreover, we present a general incremental synchronization procedure and we show its correctness, completeness and incrementality.  ...  Acknowledgements The authors would like to thank the reviewers of this paper, whose comments have contributed to improve it.  ... 
doi:10.1007/978-3-319-08789-4_6 fatcat:riqg3t56qbfj7kgwsfbamse6he

Avoiding unnecessary information loss: correct and efficient model synchronization based on triple graph grammars

Lars Fritsche, Jens Kosiol, Andy Schürr, Gabriele Taentzer
2020 International Journal on Software Tools for Technology Transfer (STTT)  
Triple graph grammars (TGGs) specify model consistency by means of rules that describe how to create consistent pairs of models.  ...  As a proof of concept, we have implemented this synchronization process in eMoflon, a state-of-the-art model transformation tool with inherent support of bidirectionality.  ...  Acknowledgements This work was partially funded by the German Research Foundation (DFG) project "Triple Graph Grammars (TGG) 2.0".  ... 
doi:10.1007/s10009-020-00588-7 fatcat:4cj3xkcg35bxhamxignc7vfs3e

Avoiding Unnecessary Information Loss: Correct and Efficient Model Synchronization Based on Triple Graph Grammars [article]

Lars Fritsche, Jens Kosiol, Andy Schürr, Gabriele Taentzer
2020 arXiv   pre-print
Triple Graph Grammars (TGGs) specify model consistency by means of rules that describe how to create consistent pairs of models.  ...  As a proof of concept, we have implemented this synchronization process in eMoflon, a state-of-the-art model transformation tool with inherent support of bidirectionality.  ...  Acknowledgments This work was partially funded by the German Research Foundation (DFG) project "Triple Graph Grammars (TGG) 2.0".  ... 
arXiv:2005.14510v1 fatcat:o4rgnwowvva7bkkylccgos4jy4

Incremental Concurrent Model Synchronization using Triple Graph Grammars [chapter]

Fernando Orejas, Elvira Pino, Marisa Navarro
2020 Lecture Notes in Computer Science  
Specifically, based on the Triple Graph Grammar approach, we propose an incremental algorithm CSynch for solving conflicts and repairing consistency.  ...  Model Synchronization is the process of restoring consistency after the update of one or several of the models.  ...  -To specify the class of consistent triple graphs we use a (triple graph) grammar, i.e., a triple graph is consistent if it can be generated from a given start graph (typically, the empty graph) using  ... 
doi:10.1007/978-3-030-45234-6_14 fatcat:navkq56h5bcozhrkmbnvre3xua

A graph-based algorithm for consistency maintenance in incremental and interactive integration tools

Simon M. Becker, Sebastian Herold, Sebastian Lohmann, Bernhard Westfechtel
2007 Journal of Software and Systems Modeling  
The algorithm is based on graphs, which are used as the data model for representing the models to be integrated, and graph transformation rules, which describe the modifications of the graphs to be performed  ...  Throughout the development process, the system to be built is modeled from different perspectives, on different levels of abstraction, and with different intents.  ...  Acknowledgments This work was in part funded by the CRC 476 IMPROVE of the Deutsche Forschungsgemeinschaft (DFG).  ... 
doi:10.1007/s10270-006-0045-5 fatcat:5z5cpxrksbhc5cvkkfcmx6q3su

Rule Execution in Graph-Based Incremental Interactive Integration Tools [chapter]

Simon M. Becker, Sebastian Lohmann, Bernhard Westfechtel
2004 Lecture Notes in Computer Science  
Graph transformations are well suited for modeling the operations provided for maintaining inter-document consistency.  ...  In this paper, we describe a novel approach to rule execution for graph-based integration tools operating interactively and incrementally.  ...  Furthermore, the authors gratefully acknowledge the fruitful cooperation with Innotec.  ... 
doi:10.1007/978-3-540-30203-2_4 fatcat:bs2d5gczljghbnrmxs2k4w7xsu

Efficient Model Synchronization by Automatically Constructed Repair Processes [chapter]

Lars Fritsche, Jens Kosiol, Andy Schürr, Gabriele Taentzer
2019 Lecture Notes in Computer Science  
Triple Graph Grammars (TGGs) specify model consistency by means of rules.  ...  Model synchronization, i.e., the task of restoring consistency between two interrelated models after a model change, is a challenging task.  ...  The model synchronization process is based on an incremental graph pattern matcher that tracks all matches that dis-/appear due to model changes.  ... 
doi:10.1007/978-3-030-16722-6_7 fatcat:5u57cjoe5rg55m2prnziv6mzem

Model synchronization based on triple graph grammars: correctness, completeness and invertibility

Frank Hermann, Hartmut Ehrig, Fernando Orejas, Krzysztof Czarnecki, Zinovy Diskin, Yingfei Xiong, Susann Gottmann, Thomas Engel
2013 Journal of Software and Systems Modeling  
Triple graph grammars (TGGs) have been used successfully to analyze correctness and completeness of bidirectional model transformations, but a corresponding formal approach to model synchronization has  ...  This paper closes this gap by providing a formal synchronization framework with bidirectional update propagation operations.  ...  35 Laws for correct and (weak) invertible synchronization frameworks Definition 3.3 (TGG Model Framework) Let TGG = (TG, ∅, TR) be a triple graph grammar with empty start graph ∅ and triple type graph  ... 
doi:10.1007/s10270-012-0309-1 fatcat:cmx65sgm75burhgtsgavmdyjcy

A Static Analysis of Non-confluent Triple Graph Grammars for Efficient Model Transformation [chapter]

Anthony Anjorin, Erhan Leblebici, Andy Schürr, Gabriele Taentzer
2014 Lecture Notes in Computer Science  
Triple Graph Grammars (TGGs) are a well-known bidirectional model transformation language.  ...  This is, however, a strong restriction for transformations with inherent degrees of freedom that should not be limited at design time. eMoflon is a TGG tool that supports non-confluent TGGs, allowing different  ...  Triple Graph Grammars (TGGs) [13] are a formally founded rule-based bidirectional model transformation language, and were used in the CME research project to realize the synchronization of models formulated  ... 
doi:10.1007/978-3-319-09108-2_9 fatcat:3mgtvhhx25ddpiqpvvjd7hy73m

A Comparison of Incremental Triple Graph Grammar Tools

Erhan Leblebici, Anthony Anjorin, Andy Schürr, Stephan Hildebrandt, Jan Rieke, Joel Greenyer
2014 Electronic Communications of the EASST  
Triple Graph Grammars (TGGs) are a graph-based and visual technique for specifying bidirectional model transformation.  ...  In this paper, we close this gap by (i) identifying a set of criteria for a qualitative comparison of TGG tools in the incremental mode, (ii) comparing three prominent incremental TGG tools with regard  ...  Introduction and Motivation Bidirectional model transformation is a viable means of ensuring consistency in a Model-Driven Engineering (MDE) context and Triple Graph Grammars (TGGs) [Sch95] have been  ... 
doi:10.14279/tuj.eceasst.67.939 dblp:journals/eceasst/LeblebiciASHRG14 fatcat:ppm2hb2glzb65fdbb7dwb44gke

Bidirectional Model Transformation with Precedence Triple Graph Grammars [chapter]

Marius Lauder, Anthony Anjorin, Gergely Varró, Andy Schürr
2012 Lecture Notes in Computer Science  
Triple Graph Grammars (TGGs) are a rule-based technique with a formal background for specifying bidirectional model transformation.  ...  This paper, therefore, introduces a new class of TGGs together with a control algorithm that drops a number of practice-relevant restrictions for TGG rules and still has a polynomial runtime complexity  ...  Definition 4 (Triple Graph Grammar) A triple graph grammar T GG := (T G, R) is a pair consisting of a type graph triple TG and a finite set R of TGG rules.  ... 
doi:10.1007/978-3-642-31491-9_22 fatcat:trp3zkz2zzd4beba2ati5pclzu

Preventing Information Loss in Incremental Model Synchronization by Reusing Elements [chapter]

Joel Greenyer, Sebastian Pook, Jan Rieke
2011 Lecture Notes in Computer Science  
In order to solve these issues, we present a novel synchronization technique based on Triple Graph Grammars with improvements regarding the reuse of model elements.  ...  However, the refinement of discipline-specific aspects of the system, for example the implementation of software controllers, still requires disciplinespecific models and tools.  ...  Here, we use a concept called Triple Graph Grammars (TGGs) [14] .  ... 
doi:10.1007/978-3-642-21470-7_11 fatcat:c7o273vetnglhemufbg4ffkz2y

Model Synchronization at Work: Keeping SysML and AUTOSAR Models Consistent [chapter]

Holger Giese, Stephan Hildebrandt, Stefan Neumann
2010 Lecture Notes in Computer Science  
We present the model synchronization algorithm based on triple graph grammars in detail and further exemplify the general approach by means of a model synchronization solution between system engineering  ...  Each model helps in addressing the specific design issue with appropriate notations and at a suitable level of abstraction.  ...  Model Synchronization System Based on Triple Graph Grammars The model transformation system is based on triple graph grammars [29] .  ... 
doi:10.1007/978-3-642-17322-6_24 fatcat:p57kpnvghrethjicgousa7kl4e

A Survey of Triple Graph Grammar Tools

Stephan Hildebrandt, Leen Lambers, Holger Giese, Jan Rieke, Joel Greenyer, Wilhelm Schäfer, Marius Lauder, Anthony Anjorin, Andy Schürr
2013 Electronic Communications of the EASST  
Triple Graph Grammars (TGGs) are a formally founded, bidirectional model transformation language shown by numerous case studies to be promising and useful in practice.  ...  Model transformation plays a central role in Model-Driven Engineering (MDE) and supporting bidirectionality is a current challenge with important applications.  ...  A third model (hence triple graph grammars) is created in the process and can be viewed as a set of traceability links between corresponding model elements from the source and target domains.  ... 
doi:10.14279/tuj.eceasst.57.865 dblp:journals/eceasst/HildebrandtLGRGSLAS13 fatcat:z5x6d6qob5hzteaq4w7rdizmy4

From Model Transformation to Model Integration based on the Algebraic Approach to Triple Graph Grammars

Hartmut Ehrig, Karsten Ehrig, Frank Hermann
2009 Electronic Communications of the EASST  
The overall concept is based on the algebraic approach to triple graph grammars, which are widely used for model transformation.  ...  From the analysis point of view, model integration supports correctness checks of syntactical dependencies between different views and models.  ...  Triple graph grammars are based on triple rules, which allow to generate integrated models G consisting of a source model G S , a target model G T and a connection model G C together with correspondences  ... 
doi:10.14279/tuj.eceasst.10.154 dblp:journals/eceasst/EhrigEH08 fatcat:scfdqlrfofh6bgbid5zl55apjq
« Previous Showing results 1 — 15 out of 1,084 results