Decidability of Safety Properties of Timed Multiset Rewriting
FTRTFT '02 Proceedings of the 7th International Symposium on Formal Techniques in Real-Time and Fault-Tolerant Systems: Co-sponsored by IFIP WG 2.2
Properties of Distributed Timed-Arc Petri Nets
FST TCS '01 Proceedings of the 21st Conference on Foundations of Software Technology and Theoretical Computer Science
ICATPN '01 Proceedings of the 22nd International Conference on Application and Theory of Petri Nets
Towards a Notion of Distributed Time for Petri Nets
ICATPN '01 Proceedings of the 22nd International Conference on Application and Theory of Petri Nets
Translating TPAL Specifications into Timed-Arc Petri Nets
ICATPN '02 Proceedings of the 23rd International Conference on Applications and Theory of Petri Nets
A translation of TPALp into a class of timed-probabilistic Petri nets
Theoretical Computer Science
On the Expressiveness of Mobile Synchronizing Petri Nets
Electronic Notes in Theoretical Computer Science (ENTCS)
Timed Petri nets and timed automata: On the discriminating power of zeno sequences
Information and Computation
Comparing the Expressiveness of Timed Automata and Timed Extensions of Petri Nets
FORMATS '08 Proceedings of the 6th international conference on Formal Modeling and Analysis of Timed Systems
Minimal Cost Reachability/Coverability in Priced Timed Petri Nets
FOSSACS '09 Proceedings of the 12th International Conference on Foundations of Software Science and Computational Structures: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009
Weak Time Petri Nets Strike Back!
CONCUR 2009 Proceedings of the 20th International Conference on Concurrency Theory
An Efficient Translation of Timed-Arc Petri Nets to Networks of Timed Automata
ICFEM '09 Proceedings of the 11th International Conference on Formal Engineering Methods: Formal Methods and Software Engineering
Decidability of properties of timed-arc Petri nets
ICATPN'00 Proceedings of the 21st international conference on Application and theory of petri nets
Verification of timed-arc Petri nets
SOFSEM'11 Proceedings of the 37th international conference on Current trends in theory and practice of 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
Timed-arc petri nets vs. networks of timed automata
ICATPN'05 Proceedings of the 26th international conference on Applications and Theory of Petri Nets
Decidability of zenoness, syntactic boundedness and token-liveness for dense-timed petri nets
FSTTCS'04 Proceedings of the 24th international conference on Foundations of Software Technology and Theoretical Computer Science
Robustness of time petri nets under architectural constraints
FORMATS'12 Proceedings of the 10th international conference on Formal Modeling and Analysis of Timed Systems
The right timing: reflections on the modeling and analysis of time
PETRI NETS'13 Proceedings of the 34th international conference on Application and Theory of Petri Nets and Concurrency
| Hi-index | 0.00 |
Timed-arc Petri nets are not Turing powerful, because, in particular, they cannot simulate a counter with test on zero. Thus, we could think that this model does not extend significantly the expressiveness of untimed Petri nets. But this is not true; in this paper we show that the differences between them are big enough to make the reachability problem undecidable. We also define dead tokens as those that cannot be used for firing any transitions in the future and we present some particular cases where we can identify them on this kind of timed nets.