Ehrig, HartmutKönig, Barbara2004-05-102016-03-312004-05-102016-03-312004111442540http://nbn-resolving.de/urn:nbn:de:bsz:93-opus-18579http://elib.uni-stuttgart.de/handle/11682/2550http://dx.doi.org/10.18419/opus-2533Motivated 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.eninfo:eu-repo/semantics/openAccessBisimulation , Transitionssystem , Graphersetzungssystem004graph rewriting , graph transformation , bisimulation , transition systemsworkingPaper2013-07-05