Universidad Complutense de Madrid
E-Prints Complutense

Forward analysis for petri nets with name creation



Downloads per month over past year

Rosa Velardo, Fernando and Frutos Escrig, David de (2010) Forward analysis for petri nets with name creation. In Applications and Theory of Petri Nets : 31st International Conference, PETRI NETS 2010, Braga, Portugal, June 21-25, 2010. Proceedings. Lecture notes in computer science (6128). Springer, pp. 185-205. ISBN 978-3-642-13674-0

[img] PDF
Restringido a Repository staff only


Official URL: http://link.springer.com/content/pdf/10.1007%2F978-3-642-13675-7_12.pdf



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 ν-APNs 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 ν-APNs, 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.

Item Type:Book Section
Subjects:Sciences > Computer science
ID Code:20928
Deposited On:19 Apr 2013 08:39
Last Modified:31 Aug 2018 08:11

Origin of downloads

Repository Staff Only: item control page