A precedence-driven approach for concurrent model synchronization scenarios using triple graph grammars

Fritsche, Lars; Kosiol, Jens; Möller, Adrian; Schürr, Andy; Taentzer, Gabriele

doi:10.1145/3426425.3426931

Cited by 9 publications

(10 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…It turns out that these can be built as GCRs from their basic rules but not as mere concurrent rules. Additionally, we introduced short-cut rules for more effective model synchronization [15,16,13] and showed here that short-cut rules are special GCRs. Hence, these works suggest that GCRs can capture typical properties of model edit operators.…”

Section: Related Workmentioning

confidence: 98%

“…This means, we lift that construction from its very specific setting (adhesive categories and monotonic, plain rules) to a far more general one (M-adhesive categories and general rules with application conditions). This is of practical relevance as, in application-oriented work on incremental model synchronization, we are already employing short-cut rules in more general settings (namely, we compute short-cut rules from monotonic rules with application conditions rewriting typed attributed triple graphs, which constitute an adhesive HLR category that is not adhesive) [15,16,13].…”

Section: Proposition 1 (A Concurrent Rule Is a Gcr) Given A Concurren...mentioning

confidence: 99%

“…We introduced short-cut rules as a special kind of sequential rule composition to construct (complex) edit rules from monotonic rules defining a grammar [14], and applied them to improve triple graph grammar-based model synchronization processes [15,16,13]. A short-cut rule composes a rule which only deletes (i.e., the inverse rule of a monotonic rule) with a monotonic rule into a single rule whose application has the same effect.…”

Section: A2 Short-cut Rulesmentioning

confidence: 99%

“…In addition, a rule that reuses model elements instead of deleting and recreating them is often applicable more frequently since necessary context does not get lost: Considering the doublepushout approach to graph transformation, a rule with higher reuse satisfies the dangling edge condition more often in general. These properties allowed us to employ short-cut rules to improve model synchronization processes [15,16,13]. Our construction of GCRs provides the possibility of reusing elements when sequentially composing arbitrary rules.…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

A Generalized Concurrent Rule Construction for Double-Pushout Rewriting

Kosiol,

Taentzer

2021

Preprint

Self Cite

View full text Add to dashboard Cite

Double-pushout rewriting is an established categorical approach to the rule-based transformation of graphs and graph-like objects. One of its standard results is the construction of concurrent rules and the Concurrency Theorem pertaining to it: The sequential application of two rules can equivalently be replaced by the application of a concurrent rule and vice versa. We extend and generalize this result by introducing generalized concurrent rules (GCRs). Their distinguishing property is that they allow identifying and preserving elements that are deleted by their first underlying rule and created by the second one. We position this new kind of composition of rules among the existing ones and obtain a Generalized Concurrency Theorem for it. We conduct our work in the same generic framework in which the Concurrency Theorem has been presented, namely double-pushout rewriting in M-adhesive categories via rules equipped with application conditions.

show abstract

Section: Related Workmentioning

confidence: 98%

Section: Proposition 1 (A Concurrent Rule Is a Gcr) Given A Concurren...mentioning

confidence: 99%

Section: A2 Short-cut Rulesmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

A Generalized Concurrent Rule Construction for Double-Pushout Rewriting

Kosiol,

Taentzer

2021

Preprint

Self Cite

View full text Add to dashboard Cite

show abstract

“…As far as we are aware of, this problem is only recently addressed by Triple Graph Grammar tools cf. [8]. Actually, [9] explicitly mentions this problem and puts it in future work.…”

Section: Collaborative Editing and Merge Conflictsmentioning

confidence: 98%

Commutative Event Sourcing vs. Triple Graph Grammars

Copei,

Zündorf

2021

Preprint

View full text Add to dashboard Cite

This paper proposes Commutative Event Sourcing as a simple and reliable mechanism for model synchronisation, bidirectional model to model transformations, incremental updates, and collaborative editing. Commutative Event Sourcing is a restricted form of a Triple Graph Grammar where the rules or editing commands are either overwriting or commutative. This restriction gets rid of a lot of Triple Graph Grammar complexity and it becomes possible to implement model synchronisation manually. Thus, you are not restricted to Java as your programming language and you do not need to use a proprietary library, framework, or tool. You do not even have to dig into graph grammar theory.

show abstract

A Generalized Concurrent Rule Construction for Double-Pushout Rewriting

Kosiol

Taentzer

2021

Graph Transformation

View full text Add to dashboard Cite

A precedence-driven approach for concurrent model synchronization scenarios using triple graph grammars

Cited by 9 publications

References 10 publications

A Generalized Concurrent Rule Construction for Double-Pushout Rewriting

A Generalized Concurrent Rule Construction for Double-Pushout Rewriting

Commutative Event Sourcing vs. Triple Graph Grammars

A Generalized Concurrent Rule Construction for Double-Pushout Rewriting

Contact Info

Product

Resources

About