Decidability Problems in Petri Nets with Names and Replication
Fernando Rosa-Velardo, David de Frutos Escrig · Fundamenta Informaticae · 2010
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)