Universidad Complutense de Madrid
E-Prints Complutense

Accelerations for the coverability set of Petri nets with names

Impacto

Downloads

Downloads per month over past year

Rosa Velardo, Fernando and Martos Salgado, María Rosa and Frutos Escrig, David de (2011) Accelerations for the coverability set of Petri nets with names. Fundamenta informaticae, 113 (3-4). pp. 313-341. ISSN 0169-2968

[img] PDF
Restringido a Repository staff only

260kB

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


URLURL Type
http://www.iospress.nl/Publisher


Abstract

Pure names are identifiers with no relation between them, except equality and inequality. In previous works we have extended P/T nets with the capability of creating and managing pure names, obtaining ν-PNs and proved that they are strictly well structured (WSTS), so that coverability and boundedness are decidable. Here we use the framework recently developed by Finkel and Goubault-Larrecq for forward analysis for WSTS, in the case of ν-PNs, to compute the cover, that gives a good over approximation of the set of reachable markings. We prove that the least complete domain containing the set of markings is effectively representable. Moreover, we prove that in the completion we can compute least upper bounds of simple loops. Therefore, a forward Karp-Miller procedure that computes the cover is applicable. However, we prove that in general the cover is not computable, so that the procedure is non-terminating in general. As a corollary, we obtain the analogous result for Transfer Data nets and Data Nets. Finally, we show that a slight modification of the forward analysis yields decidability of a weak form of boundedness called width-boundedness, and identify a subclass of ν-PN that we call dw-bounded ν-PN, for which the cover is computable.


Item Type:Article
Uncontrolled Keywords:Petri nets, pure names, infinite state systems, decidability, well structured transition systems, forward analysis, accelerations
Subjects:Sciences > Computer science
ID Code:20622
Deposited On:02 Apr 2013 11:25
Last Modified:31 Aug 2018 08:56

Origin of downloads

Repository Staff Only: item control page