Commutative Event Sourcing vs. Triple Graph Grammars

01/21/2021
by   Sebastian Copei, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/15/2023

Generating Semantic Graph Corpora with Graph Expansion Grammar

We introduce Lovelace, a tool for creating corpora of semantic graphs. T...
research
06/29/2009

Restricted Global Grammar Constraints

We investigate the global GRAMMAR constraint over restricted classes of ...
research
12/07/2020

Describing the syntax of programming languages using conjunctive and Boolean grammars

A classical result by Floyd ("On the non-existence of a phrase structure...
research
12/20/2016

Grammar rules for the isiZulu complex verb

The isiZulu verb is known for its morphological complexity, which is a s...
research
03/05/2011

Teraflop-scale Incremental Machine Learning

We propose a long-term memory design for artificial general intelligence...
research
09/08/2017

Gigamachine: incremental machine learning on desktop computers

We present a concrete design for Solomonoff's incremental machine learni...
research
12/03/2020

Encoding Incremental NACs in Safe Graph Grammars using Complementation

In modelling complex systems with graph grammars (GGs), it is convenient...

Please sign up or login with your details

Forgot password? Click here to reset