@inproceedings{RKE08,
Title = {{ Deriving Bisimulation Congruences in the Presence of Negative Application Conditions}},
Author = {Rangel, G. and K\"onig, B. and Ehrig, H.},
Booktitle = {Proc. Foundations of Software Science and Computational Structures (FOSSACS'08)},
Pages = {413-427},
Year = {2008},
Isbn = {978-3-540-78497-5},
Doi = {10.1007/978-3-540-78499-9},
Location = {Budapest, Hungary},
Volume = {4962},
Editor = {R. Amadio},
Publisher = {SPRINGER},
Series = {LNCS},
Abstract = {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.},
Url = {http://www.springerlink.com/content/e950520638346408/},
Keywords = {bisimilarity, bisimulation congruence, graph transformation, negative application condition}
}