Decidability of properties of timed-arc Petri nets



Downloads per month over past year

Frutos Escrig, David de and Valero Ruiz, Valentín and Marroquín Alonso, Olga (2000) Decidability of properties of timed-arc Petri nets. In Application and Theory of Petri Nets 2000 : 21st International Conference, ICATPN 2000 Aarhus, Denmark, June 26–30, 2000 Proceedings. Lecture notes in computer science (1825). Springer, pp. 187-206. ISBN 978-3-540-67693-5

[thumbnail of Frutos18springer.pdf]

Official URL:


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.

Item Type:Book Section
Uncontrolled Keywords:Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.); Decidability of theories and sets of sentences
Subjects:Sciences > Computer science
ID Code:20695
Deposited On:08 Apr 2013 11:34
Last Modified:10 Aug 2018 08:31

Origin of downloads

Repository Staff Only: item control page