direkt zum Inhalt springen

direkt zum Hauptnavigationsmenü

Sie sind hier

TU Berlin

Inhalt des Dokuments

Publications Prof. Hartmut Ehrig (TFS)

Deriving Bisimulation Congruences in the Presence of Negative Application Conditions
Zitatschlüssel RKE08
Autor Rangel, G. and König, B. and Ehrig, H.
Buchtitel Proc. Foundations of Software Science and Computational Structures (FOSSACS'08)
Seiten 413-427
Jahr 2008
ISBN 978-3-540-78497-5
DOI 10.1007/978-3-540-78499-9
Ort Budapest, Hungary
Jahrgang 4962
Herausgeber R. Amadio
Serie LNCS
Zusammenfassung 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.
Link zur Publikation Download Bibtex Eintrag

Zusatzinformationen / Extras


Schnellnavigation zur Seite über Nummerneingabe