direkt zum Inhalt springen

direkt zum Hauptnavigationsmenü

Sie sind hier

TU Berlin

Inhalt des Dokuments

Publications Prof. Hartmut Ehrig (TFS)

Bisimulation Verification for the DPO Approach with Borrowed Contexts
Zitatschlüssel RKE07
Autor Rangel, G. and König, B. and Ehrig, H.
Buchtitel Workshop on Graph Transformation and Visual Modelling Techniques (GT-VMT'07)
Jahr 2007
ISBN ISSN 1863-2122
Herausgeber Ehrig, K. and Giese, H.
Verlag Electronic Communications of the EASST
Zusammenfassung Bisimilarity is the most widespread notion of behavioral equivalence and hence algorithms for bisimulation checking are of fundamental importance for verifying that two systems are behaviorally equivalent (seen from the perspective of the environment). We investigate this problem in the context of behavioral equivalences of graphs and graph transformation systems, where the extension of the DPO approach to borrowed contexts provides us with a formal basis for reasoning about bisimilarity of graphs. In this paper we extend Hirschkoff's on-the-fly algorithm for bisimulation checking, enabling it to verify whether two graphs are bisimilar with respect to a given set of productions. We then apply this framework to refactoring problems and ver- ify instances of a model transformation which describes the minimization of deterministic finite automata.
Link zur Publikation Download Bibtex Eintrag

Zusatzinformationen / Extras


Schnellnavigation zur Seite über Nummerneingabe