Transformation Systems with Incremental Negative Application ConditionsReport as inadecuate

Transformation Systems with Incremental Negative Application Conditions - Download this document for free, or read online. Document in PDF available to download.

1 Università di Pisa 2 University of Leicester 3 - Université du Luxembourg

Abstract : In several application areas, Graph Transformation Systems GTSs are equipped with Negative Application Conditions NACs that specify -forbidden contexts-, in which the rules shall not be applied. The extension to NACs, however, introduces inhibiting effects among transformation steps that are not local in general, causing a severe problem for a concurrent semantics. In fact, the relation of sequential independence among derivation steps is not invariant under switching, as we illustrate with an example. We first show that this problem disappears if the NACs are restricted to be incremental. Next we present an algorithm that transforms a GTS with arbitrary NACs into one with incremental NACs only, able to simulate the original GTS. We also show that the two systems are actually equivalent, under certain assumptions on NACs.

Keywords : graph transformation concurrent semantics negative application conditions switch equivalence

Author: Andrea Corradini - Reiko Heckel - Frank Hermann - Susann Gottmann - Nico Nachtigall -



Related documents