Borrowed contexts for attributed graphs
Visualitza/Obre
Estadístiques de LA Referencia / Recolecta
Inclou dades d'ús des de 2022
Cita com:
hdl:2117/91290
Tipus de documentReport de recerca
Data publicació2012
Condicions d'accésAccés obert
Tots els drets reservats. Aquesta obra està protegida pels drets de propietat intel·lectual i
industrial corresponents. Sense perjudici de les exempcions legals existents, queda prohibida la seva
reproducció, distribució, comunicació pública o transformació sense l'autorització del titular dels drets
Abstract
Borrowed context graph transformation is a simple and powerful technique developed by Ehrig and König that allow us to derive labeled transitions and bisimulation congruences for graph transformation systems or, in general, for pocess calculi that can be defined in terms of graph transformation systems. Moreover, the same authors have also shown how to use this technique for the verification of bisimilarity. In principle, the main results about borrowed context transformation do not apply only to plain graphs, but they are generic in the sense that they apply to all categories tha satisfy certain properties related to the notion of adhesivity. In particular, this is the case of attributed graphs. However, as we show in the paper, the techniques used for checking bisimilarity are not equally generic and, in particular they fail, if we want to apply them to attributed graphs. To solve this problem, in this paper, we define a special notion of symbolic graph bisimulation and show how it can be used to check bisimilarity of attributed graphs.
CitacióOrejas, F., Boronat, A., Mylonakis, N. "Borrowed contexts for attributed graphs". 2012.
Forma partLSI-12-7-R
Fitxers | Descripció | Mida | Format | Visualitza |
---|---|---|---|---|
R12-7.pdf | 494,6Kb | Visualitza/Obre |