Techniques for automatic verification of real-time systems
Techniques for automatic verification of real-time systems
Model checking of systems with many identical timed processes
Theoretical Computer Science
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
Automata For Modeling Real-Time Systems
ICALP '90 Proceedings of the 17th International Colloquium on Automata, Languages and Programming
ICATPN '01 Proceedings of the 22nd International Conference on Application and Theory of Petri Nets
Verifying Progress in Timed Systems
ARTS '99 Proceedings of the 5th International AMAST Workshop on Formal Methods for Real-Time and Probabilistic Systems
Undecidable problems in unreliable computations
Theoretical Computer Science - Latin American theoretical informatics
On Non-Decidability of Reachability for Timed-Arc Petri Nets
PNPM '99 Proceedings of the The 8th International Workshop on Petri Nets and Performance Models
LICS '04 Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science
Journal of Computer and System Sciences
Decidability of properties of timed-arc Petri nets
ICATPN'00 Proceedings of the 21st international conference on Application and theory of petri nets
Timed Petri nets and timed automata: On the discriminating power of zeno sequences
Information and Computation
When are Timed Automata weakly timed bisimilar to Time Petri Nets?
Theoretical Computer Science
Timed petri nets and timed automata: on the discriminating power of zeno sequences
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part II
On the expressive power of timed automata and time petri nets
VECoS'08 Proceedings of the Second international conference on Verification and Evaluation of Computer and Communication Systems
| Hi-index | 0.00 |
We consider Timed Petri Nets (TPNs) : extensions of Petri nets in which each token is equipped with a real-valued clock. We consider the following three verification problems for TPNs. (i) Zenoness: whether there is an infinite computation from a given marking which takes only a finite amount of time. We show decidability of zenoness for TPNs, thus solving an open problem from [dFERA00]. (ii) Token Liveness: whether a token is alive in a marking, i.e., whether there is a computation from the marking which eventually consumes the token.We show decidability of the problem by reducing it to the coverability problem,which is decidable for TPNs. (iii)Boundedness: whether the size of the reachable markings is bounded. We consider two versions of the problem; namely semantic boundedness where only live tokens are taken into consideration in the markings,and syntactic boundedness where also dead tokens are considered. We show undecidability of semantic boundedness, while we prove that syntactic boundedness is decidable through an extension of the Karp-Miller algorithm.