Efficient Conflict Detection in Graph Transformation Systems by Essential Critical Pairs

Authors:
Leen Lambers;Hartmut Ehrig;Fernando Orejas
Affiliations:
Institut für Softwaretechnik und Theoretische Informatik, Technische Universität Berlin, Germany;Institut für Softwaretechnik und Theoretische Informatik, Technische Universität Berlin, Germany;Dept. L.S.I., Tech. Univ. Catalonia, Barcelona, Spain
Venue:
Electronic Notes in Theoretical Computer Science (ENTCS)
Year:
2008

Citing 5
Cited 2

Hypergraph rewriting: critical pairs and undecidability of confluence

Term graph rewriting
Detection of conflicting functional requirements in a use case-driven approach: a static analysis technique based on graph transformation

Proceedings of the 24th International Conference on Software Engineering
Efficient Parsing of Visual Languages based on Critical Pair Analysis and Contextual Layered Graph Transformation

VL '00 Proceedings of the 2000 IEEE International Symposium on Visual Languages (VL'00)
Overview of Formal Concepts for Model Transformations Based on Typed Attributed Graph Transformation

Electronic Notes in Theoretical Computer Science (ENTCS)
Efficient Detection of Conflicts in Graph-based Model Transformation

Electronic Notes in Theoretical Computer Science (ENTCS)

Parallelism and Concurrency in Adhesive High-Level Replacement Systems with Negative Application Conditions

Electronic Notes in Theoretical Computer Science (ENTCS)
Attributed graph transformation with inheritance: Efficient conflict detection and local confluence analysis using abstract critical pairs

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

The well-known notion of critical pairs already allows a static conflict detection, which is important for all kinds of applications and already implemented in AGG. Unfortunately the standard construction is not very efficient. This paper introduces the new concept of essential critical pairs allowing a more efficient conflict detection. This is based on a new conflict characterization, which determines for each conflict occuring between the rules of the system the exact conflict reason. This new notion of conflict reason leads us to an optimization of conflict detection. Efficiency is obtained because the set of essential critical pairs is a proper subset of all critical pairs of the system and therefore the set of representative conflicts to be computed statically diminishes. It is shown that for each conflict in the system, there exists an essential critical pair representing it. Moreover each essential critical pair is unique with regard to its conflict reason and thus represents each conflict not only in a minimal, but also in a unique way. Main new results presented in this paper are a characterization of conflicts, completeness and uniqueness of essential critical pairs and a local confluence lemma based on essential critical pairs. The theory of essential critical pairs is the basis to develop and implement a more efficient conflict detection algorithm in the near future.