To the top

Page Manager: Webmaster
Last update: 9/11/2012 3:13 PM

Tell a friend about this page
Print version

Granularity of conflicts … - University of Gothenburg, Sweden Till startsida
To content Read more about how we use cookies on

Granularity of conflicts and dependencies in graph transformation systems: A two-dimensional approach

Journal article
Authors L. Lambers
K. Born
J. Kosiol
Daniel Strüber
G. Taentzer
Published in Journal of Logical and Algebraic Methods in Programming
Volume 103
Pages 105-129
ISSN 2352-2208
Publication year 2019
Published at Department of Computer Science and Engineering (GU)
Pages 105-129
Language en
Keywords Graph transformation (double pushout approach), Parallel independence, Critical pair analysis (CPA), Computer Science, Science & Technology - Other Topics, OCEEDINGS5th European Conference on Model Driven Architecture - Foundations and Applications, OCEEDINGS10th International Conference on Model Driven Engineering Languages and Systems, SEP, AF 2018. Proceedings: LNCS 10887Graph Transformation. 11th International Conference, ICGT 2018, lando, fl, p105
Subject categories Computer and Information Science


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.

Page Manager: Webmaster|Last update: 9/11/2012

The University of Gothenburg uses cookies to provide you with the best possible user experience. By continuing on this website, you approve of our use of cookies.  What are cookies?