TY  - JOUR
AU  - Rosa Velardo, Fernando
AU  - Frutos Escrig, David De
PY  - 2010
DO  - 10.3233/FI-2010-368
SN  - 0169-2968
UR  - https://hdl.handle.net/20.500.14352/43729
T2  - Fundamenta informaticae
AB  - In this paper we study decidability of several extensions of P/T nets with name creation and/or replication. In particular, we study how to restrict the models of RN systems (P/T nets extended with replication, for which reachability is undecidable)...
LA  - eng
M2  - 291
PB  - IOS Press
KW  - Petri nets
KW  - Pure names
KW  - Infinite state systems
KW  - Decidability
KW  - Multithreading
KW  - Security
KW  - Choreography
TI  - Decidability problems in Petri nets with names and replication
TY  - journal article
VL  - 105
ER  -