Bitte benutzen Sie diese Kennung, um auf die Ressource zu verweisen:
http://dx.doi.org/10.18419/opus-2533
Langanzeige der Metadaten
DC Element | Wert | Sprache |
---|---|---|
dc.contributor.author | Ehrig, Hartmut | de |
dc.contributor.author | König, Barbara | de |
dc.date.accessioned | 2004-05-10 | de |
dc.date.accessioned | 2016-03-31T07:58:27Z | - |
dc.date.available | 2004-05-10 | de |
dc.date.available | 2016-03-31T07:58:27Z | - |
dc.date.issued | 2004 | de |
dc.identifier.other | 111442540 | de |
dc.identifier.uri | http://nbn-resolving.de/urn:nbn:de:bsz:93-opus-18579 | de |
dc.identifier.uri | http://elib.uni-stuttgart.de/handle/11682/2550 | - |
dc.identifier.uri | http://dx.doi.org/10.18419/opus-2533 | - |
dc.description.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. | en |
dc.language.iso | en | de |
dc.relation.ispartofseries | Technischer Bericht / Universität Stuttgart, Fakultät Informatik, Elektrotechnik und Informationstechnik;2004,1 | de |
dc.rights | info:eu-repo/semantics/openAccess | de |
dc.subject.classification | Bisimulation , Transitionssystem , Graphersetzungssystem | de |
dc.subject.ddc | 004 | de |
dc.subject.other | graph rewriting , graph transformation , bisimulation , transition systems | en |
dc.title | Deriving bisimulation congruences in the DPO approach to graph rewriting. Long version | en |
dc.type | workingPaper | de |
dc.date.updated | 2013-07-05 | de |
ubs.fakultaet | Fakultät Informatik, Elektrotechnik und Informationstechnik | de |
ubs.institut | Institut für Formale Methoden der Informatik | de |
ubs.opusid | 1857 | de |
ubs.publikation.typ | Arbeitspapier | de |
ubs.schriftenreihe.name | Technischer Bericht / Universität Stuttgart, Fakultät Informatik, Elektrotechnik und Informationstechnik | de |
Enthalten in den Sammlungen: | 05 Fakultät Informatik, Elektrotechnik und Informationstechnik |
Dateien zu dieser Ressource:
Datei | Beschreibung | Größe | Format | |
---|---|---|---|---|
TR-2004-01.pdf | 1,06 MB | Adobe PDF | Öffnen/Anzeigen |
Alle Ressourcen in diesem Repositorium sind urheberrechtlich geschützt.