Borrowed contexts for attributed graphs

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 syst...

Descripción completa

Detalles Bibliográficos
Autores: Orejas Valdés, Fernando|||0000-0002-3023-4006, Boronat Moll, Artur, Mylonakis Pascual, Nicolás|||0000-0002-2535-8573
Tipo de recurso: informe técnico
Fecha de publicación:2012
País:España
Institución:Universitat Politècnica de Catalunya (UPC)
Repositorio:UPCommons. Portal del coneixement obert de la UPC
Idioma:inglés
OAI Identifier:oai:upcommons.upc.edu:2117/91290
Acceso en línea:https://hdl.handle.net/2117/91290
Access Level:acceso abierto
Palabra clave:Graph transformation
Àrees temàtiques de la UPC::Informàtica::Informàtica teòrica
id ES_3c9dec22ea666afbcb6fbe3e3b16debc
oai_identifier_str oai:upcommons.upc.edu:2117/91290
network_acronym_str ES
network_name_str España
repository_id_str
spelling Borrowed contexts for attributed graphsOrejas Valdés, Fernando|||0000-0002-3023-4006Boronat Moll, ArturMylonakis Pascual, Nicolás|||0000-0002-2535-8573Graph transformationÀrees temàtiques de la UPC::Informàtica::Informàtica teòricaBorrowed 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.20122012-01-0120162016-10-31reporthttp://purl.org/coar/resource_type/c_93fcVoRhttp://purl.org/coar/version/c_970fb48d4fbd8a85info:eu-repo/semantics/reportapplication/pdfhttps://hdl.handle.net/2117/91290reponame:UPCommons. Portal del coneixement obert de la UPCinstname:Universitat Politècnica de Catalunya (UPC)Inglésengopen accesshttp://purl.org/coar/access_right/c_abf2info:eu-repo/semantics/openAccessoai:upcommons.upc.edu:2117/912902026-05-27T15:37:01Z
dc.title.none.fl_str_mv Borrowed contexts for attributed graphs
title Borrowed contexts for attributed graphs
spellingShingle Borrowed contexts for attributed graphs
Orejas Valdés, Fernando|||0000-0002-3023-4006
Graph transformation
Àrees temàtiques de la UPC::Informàtica::Informàtica teòrica
title_short Borrowed contexts for attributed graphs
title_full Borrowed contexts for attributed graphs
title_fullStr Borrowed contexts for attributed graphs
title_full_unstemmed Borrowed contexts for attributed graphs
title_sort Borrowed contexts for attributed graphs
dc.creator.none.fl_str_mv Orejas Valdés, Fernando|||0000-0002-3023-4006
Boronat Moll, Artur
Mylonakis Pascual, Nicolás|||0000-0002-2535-8573
author Orejas Valdés, Fernando|||0000-0002-3023-4006
author_facet Orejas Valdés, Fernando|||0000-0002-3023-4006
Boronat Moll, Artur
Mylonakis Pascual, Nicolás|||0000-0002-2535-8573
author_role author
author2 Boronat Moll, Artur
Mylonakis Pascual, Nicolás|||0000-0002-2535-8573
author2_role author
author
dc.subject.none.fl_str_mv Graph transformation
Àrees temàtiques de la UPC::Informàtica::Informàtica teòrica
topic Graph transformation
Àrees temàtiques de la UPC::Informàtica::Informàtica teòrica
description 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.
publishDate 2012
dc.date.none.fl_str_mv 2012
2012-01-01
2016
2016-10-31
dc.type.none.fl_str_mv report
http://purl.org/coar/resource_type/c_93fc
VoR
http://purl.org/coar/version/c_970fb48d4fbd8a85
dc.type.openaire.fl_str_mv info:eu-repo/semantics/report
format report
dc.identifier.none.fl_str_mv https://hdl.handle.net/2117/91290
url https://hdl.handle.net/2117/91290
dc.language.none.fl_str_mv Inglés
eng
language_invalid_str_mv Inglés
language eng
dc.rights.none.fl_str_mv open access
http://purl.org/coar/access_right/c_abf2
dc.rights.openaire.fl_str_mv info:eu-repo/semantics/openAccess
rights_invalid_str_mv open access
http://purl.org/coar/access_right/c_abf2
eu_rights_str_mv openAccess
dc.format.none.fl_str_mv application/pdf
dc.source.none.fl_str_mv reponame:UPCommons. Portal del coneixement obert de la UPC
instname:Universitat Politècnica de Catalunya (UPC)
instname_str Universitat Politècnica de Catalunya (UPC)
reponame_str UPCommons. Portal del coneixement obert de la UPC
collection UPCommons. Portal del coneixement obert de la UPC
repository.name.fl_str_mv
repository.mail.fl_str_mv
_version_ 1869406386967805952
score 15,300719

Similares en LA Referencia