Transformation Systems with Incremental Negative Application Conditions - Recent Trends in Algebraic DevelopmentTechniques Access content directly
Conference Papers Year : 2013

Transformation Systems with Incremental Negative Application Conditions

Andrea Corradini
  • Function : Author
  • PersonId : 1003773
Reiko Heckel
  • Function : Author
  • PersonId : 1003778
Frank Hermann
  • Function : Author
  • PersonId : 1003779
Susann Gottmann
  • Function : Author
  • PersonId : 1003780
Nico Nachtigall
  • Function : Author
  • PersonId : 1003781


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.
Fichier principal
Vignette du fichier
978-3-642-37635-1_8_Chapter.pdf (970.09 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01485982 , version 1 (09-03-2017)





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⟩
93 View
54 Download



Gmail Facebook X LinkedIn More