Universidad Complutense de Madrid
E-Prints Complutense

Decidability and complexity of Petri nets with unordered data



Downloads per month over past year

Rosa Velardo, Fernando and Frutos Escrig, David de (2011) Decidability and complexity of Petri nets with unordered data. Theoretical Computer Science, 412 (34). pp. 4439-4451. ISSN 0304-3975

[thumbnail of Frutos03elsevier.pdf] PDF
Restringido a Repository staff only


Official URL: http://www.sciencedirect.com/science/article/pii/S0304397511003896


We prove several decidability and undecidability results for ν-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 ν-PN strictly surpasses that of P/T nets. We encode ν-PN into Petri Data Nets, so that coverability, termination and boundedness are decidable. Moreover, we obtain Ackermann-hardness results for all our decidable decision problems. Then we consider two properties, width-boundedness and depth-boundedness, that factorize boundedness. Width-boundedness has already been proven to be decidable. Here we prove that its complexity is also non-primitive recursive. Then we prove undecidability of depth-boundedness. Finally, we prove that the corresponding “place version” of all the boundedness problems is undecidable for ν-PN. These results carry over to Petri Data Nets.

Item Type:Article
Uncontrolled Keywords:Petri nets; Pure names; Well-structured transition systems; Reachability; Boundedness
Subjects:Sciences > Computer science
ID Code:20624
Deposited On:02 Apr 2013 11:50
Last Modified:31 Aug 2018 07:50

Origin of downloads

Repository Staff Only: item control page