Efficient Conflict Detection in Graph Transformation Systems by Essential Critical Pairs

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 possesses a unique conflict reason and thus represents each confl...

• Type: Journal
• Year: 2008
• Where: ENTCS
• Authors: Leen Lambers, Hartmut Ehrig, Fernando Orejas
• Keywords: Conflict Detection, Critical Pair, ENTCS 2008, ENTCS 2010, Essential Critical Pairs