2008-01: Deriving Bisimulation Congruences in the Presence of Negative Application Conditions

Derivate 19061

1.34 MB in one file, last changed at 22.11.2012

File list / details

FileFiles changed onSize
tr_dbg_2008_1.pdf21.02.2008 16:17:221.34 MB
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 an example in terms of blade server systems in order to illustrate the theory.
Permalink | Share/Save
Wissenschaftliche Texte » Heft, Band
Fakultät / Institut:
Fakultät für Ingenieurwissenschaften » Informatik und Angewandte Kognitionswissenschaft » Informatik » Theoretische Informatik
Dewey Dezimal-Klassifikation:
000 Informatik, Informationswissenschaft, allgemeine Werke » 000 Informatik, Wissen, Systeme » 004 Datenverarbeitung; Informatik
computer science, bisimulation, graph transformation, negative application conditions
Collection / Status:
E-Publications / Document published
Document created on:
Files changed on:
Technischer Bericht Nr. 2008-01 ISSN 1863-8554 Abteilung für Informatik und Angewandte Kognitionswissenschaft Fakultät für Ingenieurwissenschaften Universität Duisburg-Essen