Skip to main content Accessibility help
×
Home
Hostname: page-component-55597f9d44-qcsxw Total loading time: 0.21 Render date: 2022-08-19T14:48:50.201Z Has data issue: true Feature Flags: { "shouldUseShareProductTool": true, "shouldUseHypothesis": true, "isUnsiloEnabled": true, "useRatesEcommerce": false, "useNewApi": true } hasContentIssue true

Deriving bisimulation congruences in the DPO approach to graph rewriting with borrowed contexts

Published online by Cambridge University Press:  06 December 2006

HARTMUT EHRIG
Affiliation:
Institut für Softwaretechnik und Theoretische Informatik, Technische Universität Berlin, Germany Email: ehrig@cs.tu-berlin.de
BARBARA KÖNIG
Affiliation:
Institut für Informatik und interaktive Systeme, Universität Duisburg-Essen, 47048 Duisburg, Germany Email: barbara_koenig@uni-due.de

Abstract

Motivated by recent work on the derivation of labelled transitions and bisimulation congruences from unlabelled reaction rules, we show how to address this problem in the DPO (double-pushout) approach to graph rewriting. Unlike the case with previous approaches, we consider graphs as objects, rather than 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 integrates smoothly with the DPO approach, has a very constructive nature and requires only a minimum of category theory. The core part of this paper is the proof that the bisimilarity based on graph rewriting with borrowed contexts is a congruence relation. We will also introduce some proof techniques and compare our approach with the derivation of labelled transitions via relative pushouts.

Type
Paper
Copyright
2006 Cambridge University Press

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Footnotes

This research was partially supported by the DFG project SANDS, the BMBF project DACHIA, the TMR network SEGRAVIS and EPSRC grant R93346/01.
40
Cited by

Save article to Kindle

To save this article to your Kindle, first ensure coreplatform@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about saving to your Kindle.

Note you can select to save to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

Find out more about the Kindle Personal Document Service.

Deriving bisimulation congruences in the DPO approach to graph rewriting with borrowed contexts
Available formats
×

Save article to Dropbox

To save this article to your Dropbox account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you used this feature, you will be asked to authorise Cambridge Core to connect with your Dropbox account. Find out more about saving content to Dropbox.

Deriving bisimulation congruences in the DPO approach to graph rewriting with borrowed contexts
Available formats
×

Save article to Google Drive

To save this article to your Google Drive account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you used this feature, you will be asked to authorise Cambridge Core to connect with your Google Drive account. Find out more about saving content to Google Drive.

Deriving bisimulation congruences in the DPO approach to graph rewriting with borrowed contexts
Available formats
×
×

Reply to: Submit a response

Please enter your response.

Your details

Please enter a valid email address.

Conflicting interests

Do you have any conflicting interests? *