Deciding bisimilarity is P-complete

On finite labelled transition systems, the problems of deciding strong bisimilarity, observation equivalence, and observation congruence are P-complete under many-one NC-reducibility. As a consequence, algorithms for automated analysis of finite state systems based on bisimulation seem to be inheren...

Descripción completa

Detalles Bibliográficos
Autores: Balcázar Navarro, José Luis|||0000-0003-4248-4528, Gabarró Vallès, Joaquim|||0000-0003-3771-2813, Santha, Miklos
Tipo de recurso: informe técnico
Fecha de publicación:1990
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/327610
Acceso en línea:https://hdl.handle.net/2117/327610
Access Level:acceso abierto
Palabra clave:Modality (Logic)
CCS
Bisimilarity
P-completeness
many-one NC-reductions
Modalitat (Lògica)
Àrees temàtiques de la UPC::Informàtica
id ES_ca90b29f41bac20ed4da1bdb9a02fae8
oai_identifier_str oai:upcommons.upc.edu:2117/327610
network_acronym_str ES
network_name_str España
repository_id_str
spelling Deciding bisimilarity is P-completeBalcázar Navarro, José Luis|||0000-0003-4248-4528Gabarró Vallès, Joaquim|||0000-0003-3771-2813Santha, MiklosModality (Logic)CCSBisimilarityP-completenessmany-one NC-reductionsModalitat (Lògica)Àrees temàtiques de la UPC::InformàticaOn finite labelled transition systems, the problems of deciding strong bisimilarity, observation equivalence, and observation congruence are P-complete under many-one NC-reducibility. As a consequence, algorithms for automated analysis of finite state systems based on bisimulation seem to be inherently sequential in the following sense: the design of an efficient parallel algorithm to solve any of these problems will require an exceedingly hard algorithmic breakthrough.19901990-01-0120202020-07-24reporthttp://purl.org/coar/resource_type/c_93fcVoRhttp://purl.org/coar/version/c_970fb48d4fbd8a85info:eu-repo/semantics/reportapplication/pdfhttps://hdl.handle.net/2117/327610reponame:UPCommons. Portal del coneixement obert de la UPCinstname:Universitat Politècnica de Catalunya (UPC)Inglésengopen accesshttp://purl.org/coar/access_right/c_abf2Attribution-NonCommercial-NoDerivs 3.0 Spainhttp://creativecommons.org/licenses/by-nc-nd/3.0/es/info:eu-repo/semantics/openAccessoai:upcommons.upc.edu:2117/3276102026-05-27T15:37:01Z
dc.title.none.fl_str_mv Deciding bisimilarity is P-complete
title Deciding bisimilarity is P-complete
spellingShingle Deciding bisimilarity is P-complete
Balcázar Navarro, José Luis|||0000-0003-4248-4528
Modality (Logic)
CCS
Bisimilarity
P-completeness
many-one NC-reductions
Modalitat (Lògica)
Àrees temàtiques de la UPC::Informàtica
title_short Deciding bisimilarity is P-complete
title_full Deciding bisimilarity is P-complete
title_fullStr Deciding bisimilarity is P-complete
title_full_unstemmed Deciding bisimilarity is P-complete
title_sort Deciding bisimilarity is P-complete
dc.creator.none.fl_str_mv Balcázar Navarro, José Luis|||0000-0003-4248-4528
Gabarró Vallès, Joaquim|||0000-0003-3771-2813
Santha, Miklos
author Balcázar Navarro, José Luis|||0000-0003-4248-4528
author_facet Balcázar Navarro, José Luis|||0000-0003-4248-4528
Gabarró Vallès, Joaquim|||0000-0003-3771-2813
Santha, Miklos
author_role author
author2 Gabarró Vallès, Joaquim|||0000-0003-3771-2813
Santha, Miklos
author2_role author
author
dc.subject.none.fl_str_mv Modality (Logic)
CCS
Bisimilarity
P-completeness
many-one NC-reductions
Modalitat (Lògica)
Àrees temàtiques de la UPC::Informàtica
topic Modality (Logic)
CCS
Bisimilarity
P-completeness
many-one NC-reductions
Modalitat (Lògica)
Àrees temàtiques de la UPC::Informàtica
description On finite labelled transition systems, the problems of deciding strong bisimilarity, observation equivalence, and observation congruence are P-complete under many-one NC-reducibility. As a consequence, algorithms for automated analysis of finite state systems based on bisimulation seem to be inherently sequential in the following sense: the design of an efficient parallel algorithm to solve any of these problems will require an exceedingly hard algorithmic breakthrough.
publishDate 1990
dc.date.none.fl_str_mv 1990
1990-01-01
2020
2020-07-24
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/327610
url https://hdl.handle.net/2117/327610
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
Attribution-NonCommercial-NoDerivs 3.0 Spain
http://creativecommons.org/licenses/by-nc-nd/3.0/es/
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
Attribution-NonCommercial-NoDerivs 3.0 Spain
http://creativecommons.org/licenses/by-nc-nd/3.0/es/
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_ 1869419490499887104
score 15,301603

Similares en LA Referencia