PLEXUS: Tools for analyzing graph grammars

Model-Checking of Infinite Graphs Defined by Graph Grammars

Electronic Notes in Theoretical Computer Science ◽

10.1016/s1571-0661(05)01231-4 ◽

2000 ◽

Vol 5 ◽

pp. 1 ◽

Cited By ~ 2

Author(s):

O BURKART ◽

Y QUEMENER

Keyword(s):

Model Checking ◽

Infinite Graphs ◽

Graph Grammars

Download Full-text

On the Expressiveness of Context-Sensitive Graph Grammars

Journal of Software ◽

10.3724/sp.j.1001.2012.04085 ◽

2012 ◽

Vol 23 (7) ◽

pp. 1635-1655 ◽

Cited By ~ 1

Author(s):

Yang ZOU ◽

Jian LÜ ◽

Chun CAO ◽

Hao HU ◽

Wei SONG ◽

...

Keyword(s):

Graph Grammars ◽

Context Sensitive

Download Full-text

Schema Compliant Consistency Management via Triple Graph Grammars and Integer Linear Programming

Formal Aspects of Computing ◽

10.1007/s00165-021-00557-0 ◽

2021 ◽

Author(s):

Nils Weidmann ◽

Anthony Anjorin

Keyword(s):

Linear Programming ◽

Integer Linear Programming ◽

Experimental Evaluation ◽

Graph Grammars ◽

Model Driven Engineering ◽

Rule Based ◽

Consistency Management ◽

Model Driven ◽

Triple Graph Grammars ◽

Domain Constraints

AbstractIn the field of Model-Driven Engineering, Triple Graph Grammars (TGGs) play an important role as a rule-based means of implementing consistency management. From a declarative specification of a consistency relation, several operations including forward and backward transformations, (concurrent) synchronisation, and consistency checks can be automatically derived. For TGGs to be applicable in realistic application scenarios, expressiveness in terms of supported language features is very important. A TGG tool is schema compliant if it can take domain constraints, such as multiplicity constraints in a meta-model, into account when performing consistency management tasks. To guarantee schema compliance, most TGG tools allow application conditions to be attached as necessary to relevant rules. This strategy is problematic for at least two reasons: First, ensuring compliance to a sufficiently expressive schema for all previously mentioned derived operations is still an open challenge; to the best of our knowledge, all existing TGG tools only support a very restricted subset of application conditions. Second, it is conceptually demanding for the user to indirectly specify domain constraints as application conditions, especially because this has to be completely revisited every time the TGG or domain constraint is changed. While domain constraints can in theory be automatically transformed to obtain the required set of application conditions, this has only been successfully transferred to TGGs for a very limited subset of domain constraints. To address these limitations, this paper proposes a search-based strategy for achieving schema compliance. We show that all correctness and completeness properties, previously proven in a setting without domain constraints, still hold when schema compliance is to be additionally guaranteed. An implementation and experimental evaluation are provided to support our claim of practical applicability.

Download Full-text