Reference : Transformation Systems with Incremental Negative Application Conditions |
Scientific congresses, symposiums and conference proceedings : Paper published in a book | |||
Engineering, computing & technology : Computer science | |||
http://hdl.handle.net/10993/3930 | |||
Transformation Systems with Incremental Negative Application Conditions | |
English | |
Corradini, Andrea ![]() | |
Heckel, Reiko ![]() | |
Hermann, Frank ![]() | |
Gottmann, Susann ![]() | |
Nachtigall, Nico ![]() | |
2013 | |
Recent Trends in Algebraic Development Techniques | |
Springer | |
Lecture Notes in Computer Science Volume, Volume 7841 | |
127-142 | |
Yes | |
International | |
978-3-642-37634-4 | |
Int. Workshop on Recent Trends in Algebraic Development Techniques | |
from 07-06-2012 to 10-06-2012 | |
UCM, Spain | |
Salamanca | |
Spain | |
[en] graph transformation ; negative application conditions ; switch equivalence | |
[en] 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 beincremental. 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. | |
http://hdl.handle.net/10993/3930 | |
10.1007/978-3-642-37635-1_8 | |
http://link.springer.com/chapter/10.1007%2F978-3-642-37635-1_8 | |
The final publication is available at link.springer.com |
File(s) associated to this reference | ||||||||||||||
Fulltext file(s):
| ||||||||||||||
All documents in ORBilu are protected by a user license.