@InProceedings{LEO06a,
AUTHOR = {Lambers, Leen and Ehrig, Hartmut and Orejas, Fernando},
TITLE = {{Conflict Detection for Graph Transformation with Negative Application Conditions}},
YEAR = {2006},
MONTH = {September},
BOOKTITLE = {Proc. Third International Conference on Graph Transformation (ICGT'06)},
VOLUME = {4178},
PAGES = {61--76},
SERIES = {Lecture Notes in Computer Science},
ADDRESS = {Natal, Brazil},
PUBLISHER = {Springer},
PDF = {uploads/pdf/LEO06a_conflictDetectionNACs.pdf},
OPTacc_pdf = {},
ABSTRACT = {This paper introduces a new theory needed for the purpose of conflict detection for graph transformation with negative application conditions (NACs). Main results are the formulation of a conflict notion for graph transformation with NACs and a conflict characterization derived from it. A critical pair definition is introduced and completeness of the set of all critical pairs is shown. This means that for each conflict, occuring in a graph transformation system with NACs, there exists a critical pair expressing the same conflict in a minimal context. Moreover a necessary and sufficient condition is presented for parallel independence of graph transformation systems with NACs. In order to facilitate the implementation of the critical pair construction for a graph transformation system with NACs a correct construction is formulated. Finally, it is discussed how to continue with the development of conflict detection and analysis techniques in the near future. }
}