Reference : Transformation Systems with Incremental Negative Application Conditions

	Document type :	Scientific congresses, symposiums and conference proceedings : Paper published in a book
	Discipline(s) :	Engineering, computing & technology : Computer science
	To cite this reference:	http://hdl.handle.net/10993/3930

Title :	Transformation Systems with Incremental Negative Application Conditions
Language :	English
Author, co-author :	Corradini, Andrea []
	Heckel, Reiko []
	Hermann, Frank [University of Luxembourg > Interdisciplinary Centre for Security, Reliability and Trust (SNT) > >]
	Gottmann, Susann [University of Luxembourg > Interdisciplinary Centre for Security, Reliability and Trust (SNT) > >]
	Nachtigall, Nico [University of Luxembourg > Interdisciplinary Centre for Security, Reliability and Trust (SNT) > >]
Publication date :	2013
Main document title :	Recent Trends in Algebraic Development Techniques
Publisher :	Springer
Collection and collection volume :	Lecture Notes in Computer Science Volume, Volume 7841
Pages :	127-142
Peer reviewed :	Yes
Audience :	International
ISBN :	978-3-642-37634-4
Event name :	Int. Workshop on Recent Trends in Algebraic Development Techniques
Event date :	from 07-06-2012 to 10-06-2012
Event organizer :	UCM, Spain
Event place (city) :	Salamanca
Event country :	Spain
Keywords :	[en] graph transformation ; negative application conditions ; switch equivalence
Abstract :	[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.
Permalink :	http://hdl.handle.net/10993/3930
DOI :	10.1007/978-3-642-37635-1_8
Other URL :	http://link.springer.com/chapter/10.1007%2F978-3-642-37635-1_8
Mentions required by the publisher for OA :	The final publication is available at link.springer.com

	File(s) associated to this reference
	Fulltext file(s): File Commentary Version Size Access Limited access 10.1007_978-3-642-37635-1_8(1).pdf Publisher postprint 956.59 kB Request a copy

All documents in ORBi^lu are protected by a user license.

 

University of Luxembourg Library |  Feedback |  Legal notices Site Map