Sciweavers

APN
2009
Springer

Decidability Results for Restricted Models of Petri Nets with Name Creation and Replication

14 years 27 days ago
Decidability Results for Restricted Models of Petri Nets with Name Creation and Replication
In previous works we defined ν-APNs, an extension of P/T nets with the capability of creating and managing pure names. We proved that, though reachability is undecidable, coverability remains decidable for them. We also extended P/T nets with the capability of nets to replicate themselves, creating a new component, initially marked in some fixed way, obtaining g-RN systems. We proved that these two extensions of P/T nets are equivalent, so that g-RN systems have undecidable reachability and decidable coverability. Finally, for the class of the so called ν-RN systems, P/T nets with both name creation and replication, we proved that they are Turing complete, so that also coverability turns out to be undecidable. In this paper we study how can we restrict the models of ν-APNs (and, therefore, g-RN systems) and ν-RN systems in order to keep decidability of reachability and coverability, respectively. We prove that if we forbid synchronizations between the different components in a g...
Fernando Rosa Velardo, David de Frutos-Escrig
Added 25 May 2010
Updated 25 May 2010
Type Conference
Year 2009
Where APN
Authors Fernando Rosa Velardo, David de Frutos-Escrig
Comments (0)