Please use this identifier to cite or link to this item: http://dx.doi.org/10.18419/opus-2533
Authors: Ehrig, Hartmut
König, Barbara
Title: Deriving bisimulation congruences in the DPO approach to graph rewriting. Long version
Issue Date: 2004
metadata.ubs.publikation.typ: Arbeitspapier
Series/Report no.: Technischer Bericht / Universität Stuttgart, Fakultät Informatik, Elektrotechnik und Informationstechnik;2004,1
URI: http://nbn-resolving.de/urn:nbn:de:bsz:93-opus-18579
http://elib.uni-stuttgart.de/handle/11682/2550
http://dx.doi.org/10.18419/opus-2533
Abstract: Motivated by recent work on the derivation of labelled transitions and bisimulation congruences from unlabelled reaction rules, we show how to solve this problem in the DPO (double-pushout) approach to graph rewriting. Unlike in previous approaches, we consider graphs as objects, instead of arrows, of the category under consideration. This allows us to present a very simple way of deriving labelled transitions (called rewriting steps with borrowed context) which smoothly integrates with the DPO approach, has a very constructive natureand requires only a minimum of category theory. The core part of this paper is the proof sketch that the bisimilarity based on rewriting with borrowed contexts is a congruence relation.
Appears in Collections:05 Fakultät Informatik, Elektrotechnik und Informationstechnik

Files in This Item:
File Description SizeFormat 
TR-2004-01.pdf1,06 MBAdobe PDFView/Open


Items in OPUS are protected by copyright, with all rights reserved, unless otherwise indicated.