Universidad Complutense de Madrid
E-Prints Complutense

Decidability problems in Petri nets with names and replication



Downloads per month over past year

Rosa Velardo, Fernando and Frutos Escrig, David de (2010) Decidability problems in Petri nets with names and replication. Fundamenta informaticae, 105 (3). pp. 291-317. ISSN 0169-2968

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


Official URL: http://iospress.metapress.com/content/w7873089r71556h3/fulltext.pdf


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) and ν-RN systems (RN extended with name creation, which are Turing-complete, so that coverability is undecidable), in order to obtain decidability of reachability and coverability, respectively. We prove that if we forbid synchronizations between the different components in a RN system, then reachability is still decidable. Similarly, if we forbid name communication between the different components in a ν-RN system, or restrict communication so that it is allowed only for a given finite set of names, we obtain decidability of coverability. Finally, we consider a polyadic version of ν-PN (P/T nets extended with name creation), that we call pν-PN, in which tokens are tuples of names. We prove that pν-PN are Turing complete, and discuss how the results obtained for ν-RN systems can be translated to them.

Item Type:Article
Uncontrolled Keywords:Petri nets, pure names, infinite state systems, decidability, multithreading, security, choreography
Subjects:Sciences > Computer science
ID Code:20644
Deposited On:04 Apr 2013 08:48
Last Modified:31 Aug 2018 08:02

Origin of downloads

Repository Staff Only: item control page