Sciweavers

Share
FOSSACS
2008
Springer

Deriving Bisimulation Congruences in the Presence of Negative Application Conditions

8 years 5 months ago
Deriving Bisimulation Congruences in the Presence of Negative Application Conditions
In recent years there have been several approaches for the automatic derivation of labels from an unlabeled reactive system. This can be done in such a way that the resulting bisimilarity is automatically a congruence. One important aspect that has not been studied so far is the treatment of reduction rules with negative application conditions. That is, a rule may only be applied if certain patterns are absent in the vicinity of a left-hand side. Our goal in this paper is to extend the borrowed context framework to label derivation with negative application conditions and to show that bisimilarity remains a congruence. An important application area is graph transformation and we will present a small example in order to illustrate the theory.
Guilherme Rangel, Barbara König, Hartmut Ehri
Added 26 Oct 2010
Updated 26 Oct 2010
Type Conference
Year 2008
Where FOSSACS
Authors Guilherme Rangel, Barbara König, Hartmut Ehrig
Comments (0)
books