Commutative Event Sourcing vs. Triple Graph Grammars

TL;DR

This paper introduces Commutative Event Sourcing, a simplified and reliable approach for model synchronization and transformation that reduces complexity compared to Triple Graph Grammars, enabling manual implementation without specialized tools.

Contribution

It presents Commutative Event Sourcing as a restricted, more accessible variant of Triple Graph Grammars for model synchronization and transformation.

Findings

Simplifies model synchronization by restricting rules to overwriting or commutative operations.

Eliminates the need for proprietary tools or complex graph grammar theory.

Enables manual implementation across various programming languages.

Abstract

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.