Skip to Main content Skip to Navigation
New interface
Conference papers

Transformation Systems with Incremental Negative Application Conditions

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.
Document type :
Conference papers
Complete list of metadata
Contributor : Hal Ifip Connect in order to contact the contributor
Submitted on : Thursday, March 9, 2017 - 3:33:48 PM
Last modification on : Tuesday, February 26, 2019 - 10:55:14 AM
Long-term archiving on: : Saturday, June 10, 2017 - 2:40:20 PM


Files produced by the author(s)


Distributed under a Creative Commons Attribution 4.0 International License



Andrea Corradini, Reiko Heckel, Frank Hermann, Susann Gottmann, Nico Nachtigall. Transformation Systems with Incremental Negative Application Conditions. 21th InternationalWorkshop on Algebraic Development Techniques (WADT), Jun 2012, Salamanca, Spain. pp.127-142, ⟨10.1007/978-3-642-37635-1_8⟩. ⟨hal-01485982⟩



Record views


Files downloads