TY  - JOUR
A1  - Lambers, Leen
A1  - Born, Kristopher
A1  - Kosiol, Jens
A1  - Strüber, Daniel
A1  - Taentzer, Gabriele
T1  - Granularity of conflicts and dependencies in graph transformation systems
BT  - a two-dimensional approach
JF  - Journal of Logical and Algebraic Methods in Programming
N2  - Conflict and dependency analysis (CDA) is a static analysis for the detection of conflicting and dependent rule applications in a graph transformation system. The state-of-the-art CDA technique, critical pair analysis, provides all potential conflicts and dependencies in minimal context as critical pairs, for each pair of rules. Yet, critical pairs can be hard to understand; users are mainly interested in core information about conflicts and dependencies occurring in various combinations. In this paper, we present an approach to conflicts and dependencies in graph transformation systems based on two dimensions of granularity. The first dimension refers to the overlap considered between the rules of a given rule pair; the second one refers to the represented amount of context information about transformations in which the conflicts occur. We introduce a variety of new conflict notions, in particular, conflict atoms, conflict reasons, and minimal conflict reasons, relate them to the existing conflict notions of critical pairs and initial conflicts, and position all of these notions within our granularity approach. Finally, we introduce dual concepts for dependency analysis. As we discuss in a running example, our approach paves the way for an improved CDA technique. (C) 2018 Elsevier Inc. All rights reserved.
KW  - Graph transformation (double pushout approach)
KW  - Parallel independence
KW  - Critical pair analysis (CPA)
Y1  - 2018
U6  - https://doi.org/10.1016/j.jlamp.2018.11.004
SN  - 2352-2208
VL  - 103
SP  - 105
EP  - 129
PB  - Elsevier
CY  - New York
ER  -