RT Book, Section
T1 Decidability of properties of timed-arc Petri nets
A1 Frutos Escrig, David De
A1 Valero Ruiz, Valentín
A1 Marroquín Alonso, Olga
A2 Nielsen, Mogens
A2 Simpson, Dan
AB Timed-arc Petri nets (TAPN’s) are not Turing powerful, because, in particular, they cannot simulate a counter with zero testing. Thus, we could think that this model does not increase significantly the expressiveness of untimed Petri nets. But this is not true; in a previous paper we have shown that the differences between them are big enough to make the reachability problem undecidable. On the other hand, coverability and boundedness are proved now to be decidable. This fact is a consequence of the close interrelationship between TAPN’s and transfer nets, for which similar results have been recently proved. Finally, we see that if dead tokens are defined as those that cannot be used for firing any transition in the future, we can detect these kind of tokens in an effective way.
PB Springer
SN 978-3-540-67693-5
YR 2000
FD 2000
LK https://hdl.handle.net/20.500.14352/60658
UL https://hdl.handle.net/20.500.14352/60658
LA eng
NO Frutos Escrig, D., Valero Ruiz, V. & Marroquín Alonso, O. «Decidability of Properties of Timed-Arc Petri Nets». Application and Theory of Petri Nets 2000, editado por Mogens Nielsen y Dan Simpson, vol. 1825, Springer Berlin Heidelberg, 2000, pp. 187-206. DOI.org (Crossref), https://doi.org/10.1007/3-540-44988-4_12.
DS Docta Complutense
RD 12 abr 2025