RT Book, Section
T1 Forward analysis for petri nets with name creation
A1 Rosa Velardo, Fernando
A1 Frutos Escrig, David De
A2 Lilius, Johan
A2 Penczek, Wojciech
AB 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.
PB Springer
SN 978-3-642-13674-0
YR 2010
FD 2010
LK https://hdl.handle.net/20.500.14352/45441
UL https://hdl.handle.net/20.500.14352/45441
LA eng
NO Rosa Velardo, F. & Frutos Escrig, D. «Forward Analysis for Petri Nets with Name Creation». Applications and Theory of Petri Nets, editado por Johan Lilius y Wojciech Penczek, vol. 6128, Springer Berlin Heidelberg, 2010, pp. 185-205. DOI.org (Crossref), https://doi.org/10.1007/978-3-642-13675-7_12.
NO Comunidad de Madrid
NO Ministerio de Ciencia, Innovación y Universidades (España)
NO Universidad Complutense de Madrid/Banco de Santander
DS Docta Complutense
RD 8 abr 2025