Improved Conflict Detection for Graph Transformation with Attributes

Géza Kulcsár
(Technische Universität Darmstadt Real-Time Systems Lab)
Frederik Deckwerth
(Technische Universität Darmstadt Real-Time Systems Lab)
Malte Lochau
(Technische Universität Darmstadt Real-Time Systems Lab)
Gergely Varró
(Technische Universität Darmstadt Real-Time Systems Lab)
Andy Schürr
(Technische Universität Darmstadt Real-Time Systems Lab)

In graph transformation, a conflict describes a situation where two alternative transformations cannot be arbitrarily serialized. When enriching graphs with attributes, existing conflict detection techniques typically report a conflict whenever at least one of two transformations manipulates a shared attribute. In this paper, we propose an improved, less conservative condition for static conflict detection of graph transformation with attributes by explicitly taking the semantics of the attribute operations into account. The proposed technique is based on symbolic graphs, which extend the traditional notion of graphs by logic formulas used for attribute handling. The approach is proven complete, i.e., any potential conflict is guaranteed to be detected.

In Arend Rensink and Eduardo Zambon: Proceedings Graphs as Models (GaM 2015), London, UK, 11-12 April 2015, Electronic Proceedings in Theoretical Computer Science 181, pp. 97–112.
Published: 10th April 2015.

ArXived at: https://dx.doi.org/10.4204/EPTCS.181.7 bibtex PDF
References in reconstructed bibtex, XML and HTML format (approximated).
Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org