Realizing Bidirectional Graph Transformations From Bidirectional Tree Transformations
نویسندگان
چکیده
Bidirectional transformations are useful to maintain consistency between source data and target data. So far, researchers have proposed several theories and tools for bidirectional transformations on tree structures. However, as far as we know, there is no widely-recognized theory for bidirectional transformations on graphs. In this paper, we propose an approach to constructing bidirectional graph transformations from existing bidirectional tree transformations and show how they can be useful to support better consistency and traceability between different models in software development.
منابع مشابه
MATHEMATICAL ENGINEERING TECHNICAL REPORTS A Compositional Approach to Bidirectional Model Transformation
Model-driven architecture is a discipline in software engineering that aims to develop, maintain and evolve software by performing model transformations. Many attempts have been made on introducing bidirectionality to model transformation to enable better consistency and traceability between different models. However, the existing approaches are ad-hoc without clear updating semantics, hardly s...
متن کاملGRACE TECHNICAL REPORTS An Algebraic Approach to Bidirectional Model Transformation
Bidirectional model transformation plays an important role in maintaining consistency between two models, and has many potential applications in software development, including model synchronization, round-trip engineering, software evolution, multiple-view software development, and reverse engineering. However, unclear bidirectional semantics, weak bidirectionalization method, and lack of syst...
متن کاملToward Bidirectionalization of ATL with GRoundTram
ATL is a language for describing model transformations currently in uni-direction. In our previous work we have shown that transformations of graph structures given in some form can be bidirectionalized and have implemented a system called GRoundTram system for bidirectional graph transformations. We say a transformation t is bidirectionalized when we obtain a backward transformation t′ so that...
متن کاملPotsdam: Semantic Dependency Parsing by Bidirectional Graph-Tree Transformations and Syntactic Parsing
We present the Potsdam systems that participated in the semantic dependency parsing shared task of SemEval 2014. They are based on linguistically motivated bidirectional transformations between graphs and trees and on utilization of syntactic dependency parsing. They were entered in both the closed track and the open track of the challenge, recording a peak average labeled F1 score of 78.60.
متن کاملUnderstanding bidirectional transformations with TGGs and JTL
In Model-Driven Engineering bidirectional model transformations emerged as an important ingredient to cope with scenarios such as change propagation, synchronization and to keep consistent system views whenever changes occurring on some view have to be propagated over the others. However, bidirectional mappings open a number of intricate issues that have been only partially solved by research. ...
متن کامل