Conflict detection for graph transformation with negative application conditions

  • 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., Technical University Catalonia, Barcelona, Spain

  • Venue:
  • ICGT'06 Proceedings of the Third international conference on Graph Transformations
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

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.