Universidad Complutense de Madrid
E-Prints Complutense

Decision problems for petri nets with names



Último año

Rosa Velardo, Fernando y Frutos Escrig, David de (2010) Decision problems for petri nets with names. Otros. Arxiv.org.

[img] PDF

URL Oficial: http://arxiv.org/abs/1011.3964


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.

Tipo de documento:Libro o Monografía (Otros)
Materias:Ciencias > Informática
Código ID:20889
Depositado:17 Abr 2013 09:01
Última Modificación:26 Nov 2014 09:10

Descargas en el último año

Sólo personal del repositorio: página de control del artículo