Decision problems for petri nets with names

We prove several decidability and undecidability results for nu-PN, an extension of P/T nets with pure name creation and name management. We give a simple proof of undecidability of reachability, by reducing reachability in nets with inhibitor arcs to it. Thus, the expressive power of nu-PN strictly...

Descripción completa

Detalles Bibliográficos
Autores: Rosa Velardo, Fernando, Frutos Escrig, David De
Tipo de recurso: libro
Fecha de publicación:2010
País:España
Institución:Universidad Complutense de Madrid (UCM)
Repositorio:Docta Complutense
OAI Identifier:oai:docta.ucm.es:20.500.14352/68747
Acceso en línea:https://hdl.handle.net/20.500.14352/68747
Access Level:acceso abierto
Palabra clave:004
Informática (Informática)
1203.17 Informática
id ES_4835cff53b375eccda72684961fcafda
oai_identifier_str oai:docta.ucm.es:20.500.14352/68747
network_acronym_str ES
network_name_str España
repository_id_str
spelling Decision problems for petri nets with namesRosa Velardo, FernandoFrutos Escrig, David De004Informática (Informática)1203.17 InformáticaWe prove several decidability and undecidability results for nu-PN, an extension of P/T nets with pure name creation and name management. We give a simple proof of undecidability of reachability, by reducing reachability in nets with inhibitor arcs to it. Thus, the expressive power of nu-PN strictly surpasses that of P/T nets. We prove that nu-PN are Well Structured Transition Systems. In particular, we obtain decidability of coverability and termination, so that the expressive power of Turing machines is not reached. Moreover, they are strictly Well Structured, so that the boundedness problem is also decidable. We consider two properties, width-boundedness and depth-boundedness, that factorize boundedness. Width-boundedness has already been proven to be decidable. We prove here undecidability of depth-boundedness. Finally, we obtain Ackermann-hardness results for all our decidable decision problems.Arxiv.orgUniversidad Complutense de Madrid20102010-01-0120102010-01-01bookhttp://purl.org/coar/resource_type/c_2f33AOhttp://purl.org/coar/version/c_b1a7d7d4d402bcceinfo:eu-repo/semantics/bookapplication/pdfhttps://hdl.handle.net/20.500.14352/68747reponame:Docta Complutenseinstname:Universidad Complutense de Madrid (UCM)open accesshttp://purl.org/coar/access_right/c_abf2info:eu-repo/semantics/openAccessoai:docta.ucm.es:20.500.14352/687472026-06-02T12:44:21Z
dc.title.none.fl_str_mv Decision problems for petri nets with names
title Decision problems for petri nets with names
spellingShingle Decision problems for petri nets with names
Rosa Velardo, Fernando
004
Informática (Informática)
1203.17 Informática
title_short Decision problems for petri nets with names
title_full Decision problems for petri nets with names
title_fullStr Decision problems for petri nets with names
title_full_unstemmed Decision problems for petri nets with names
title_sort Decision problems for petri nets with names
dc.creator.none.fl_str_mv Rosa Velardo, Fernando
Frutos Escrig, David De
author Rosa Velardo, Fernando
author_facet Rosa Velardo, Fernando
Frutos Escrig, David De
author_role author
author2 Frutos Escrig, David De
author2_role author
dc.contributor.none.fl_str_mv Universidad Complutense de Madrid
dc.subject.none.fl_str_mv 004
Informática (Informática)
1203.17 Informática
topic 004
Informática (Informática)
1203.17 Informática
description We prove several decidability and undecidability results for nu-PN, an extension of P/T nets with pure name creation and name management. We give a simple proof of undecidability of reachability, by reducing reachability in nets with inhibitor arcs to it. Thus, the expressive power of nu-PN strictly surpasses that of P/T nets. We prove that nu-PN are Well Structured Transition Systems. In particular, we obtain decidability of coverability and termination, so that the expressive power of Turing machines is not reached. Moreover, they are strictly Well Structured, so that the boundedness problem is also decidable. We consider two properties, width-boundedness and depth-boundedness, that factorize boundedness. Width-boundedness has already been proven to be decidable. We prove here undecidability of depth-boundedness. Finally, we obtain Ackermann-hardness results for all our decidable decision problems.
publishDate 2010
dc.date.none.fl_str_mv 2010
2010-01-01
2010
2010-01-01
dc.type.none.fl_str_mv book
http://purl.org/coar/resource_type/c_2f33
AO
http://purl.org/coar/version/c_b1a7d7d4d402bcce
dc.type.openaire.fl_str_mv info:eu-repo/semantics/book
format book
dc.identifier.none.fl_str_mv https://hdl.handle.net/20.500.14352/68747
url https://hdl.handle.net/20.500.14352/68747
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.publisher.none.fl_str_mv Arxiv.org
publisher.none.fl_str_mv Arxiv.org
dc.source.none.fl_str_mv reponame:Docta Complutense
instname:Universidad Complutense de Madrid (UCM)
instname_str Universidad Complutense de Madrid (UCM)
reponame_str Docta Complutense
collection Docta Complutense
repository.name.fl_str_mv
repository.mail.fl_str_mv
_version_ 1869407345082105856
score 15.300724

Similares en LA Referencia