TU Darmstadt / ULB / TUbiblio

Improved Conflict Detection for Graph Transformation with Attributes

Kulcsar, Geza ; Deckwerth, Frederik ; Lochau, Malte ; Varró, Gergely ; Schürr, Andy
Rensink, Arend ; Zambon, Eduardo (eds.) (2015):
Improved Conflict Detection for Graph Transformation with Attributes.
In: Electronic Proceedings in Theoretical Computer Science, 181, In: Graphs as Models, pp. 97-112,
Graphs as Models, GaM 2015, [Conference or Workshop Item]

Abstract

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.

Item Type: Conference or Workshop Item
Erschienen: 2015
Editors: Rensink, Arend ; Zambon, Eduardo
Creators: Kulcsar, Geza ; Deckwerth, Frederik ; Lochau, Malte ; Varró, Gergely ; Schürr, Andy
Title: Improved Conflict Detection for Graph Transformation with Attributes
Language: English
Abstract:

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.

Book Title: Graphs as Models
Series: Electronic Proceedings in Theoretical Computer Science
Series Volume: 181
Divisions: 18 Department of Electrical Engineering and Information Technology
18 Department of Electrical Engineering and Information Technology > Institute of Computer Engineering > Real-Time Systems
Zentrale Einrichtungen
LOEWE > LOEWE-Zentren > CASED – Center for Advanced Security Research Darmstadt
DFG-Collaborative Research Centres (incl. Transregio) > Collaborative Research Centres > CRC 1053: MAKI – Multi-Mechanisms Adaptation for the Future Internet
DFG-Collaborative Research Centres (incl. Transregio) > Collaborative Research Centres > CRC 1053: MAKI – Multi-Mechanisms Adaptation for the Future Internet > A: Construction Methodology > Subproject A1: Modelling
DFG-Collaborative Research Centres (incl. Transregio) > Collaborative Research Centres > CRC 1053: MAKI – Multi-Mechanisms Adaptation for the Future Internet > A: Construction Methodology
18 Department of Electrical Engineering and Information Technology > Institute of Computer Engineering
DFG-Collaborative Research Centres (incl. Transregio) > Collaborative Research Centres
LOEWE
DFG-Collaborative Research Centres (incl. Transregio)
LOEWE > LOEWE-Zentren
Event Title: Graphs as Models, GaM 2015
Date Deposited: 19 May 2015 07:10
URL / URN: http://dx.doi.org/10.4204/EPTCS.181.7
PPN:
Export:
Suche nach Titel in: TUfind oder in Google
Send an inquiry Send an inquiry

Options (only for editors)
Show editorial Details Show editorial Details