TY  - JOUR
AU  - Rosa Velardo, Fernando
AU  - Frutos Escrig, David De
PY  - 2011
DO  - 10.1016/j.tcs.2011.05.007
SN  - 0304-3975
UR  - https://hdl.handle.net/20.500.14352/43727
T2  - Theoretical Computer Science
AB  - 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...
LA  - eng
M2  - 4439
PB  - Elsevier Science
KW  - Petri nets
KW  - Pure names
KW  - Well-structured transition systems
KW  - Reachability
KW  - Boundedness
TI  - Decidability and complexity of Petri nets with unordered data
TY  - journal article
VL  - 412
ER  -