Decision points for non-determinism in concurrent model synchronization with triple graph grammars

4Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Model synchronization is one of the core activities in model driven engineering. One of the challenges is non-determinism when multiple valid solutions exist. This is exasperated in triple graph based approaches, where additional non-determinism may arise from the alignment of the synchronized changes and the grammar. Non-determinism is often the result of multiple decision points during the synchronization process. Handling these decisions where they occur can reduce the overall complexity of dealing with non-determinism. In this paper we analyse a triple graph based synchronization approach to identify these decisions, extend the approach to clearly separate them and discuss the relation to formal properties of model synchronization.

Cite

CITATION STYLE

APA

Trollmann, F., & Albayrak, S. (2017). Decision points for non-determinism in concurrent model synchronization with triple graph grammars. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10374 LNCS, pp. 35–50). Springer Verlag. https://doi.org/10.1007/978-3-319-61473-1_3

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free