Modeling and Verification of Time Dependent Systems Using Time Petri Nets
IEEE Transactions on Software Engineering
Theoretical Computer Science
A technique of state space search based on unfolding
Formal Methods in System Design - Special issue on computer-aided verification (based on CAV'92 workshop)
Efficiency of asynchronous systems, read arcs, and the MUTEX-problem
Theoretical Computer Science
Reachability in contextual nets
Fundamenta Informaticae
Unfolding and Finite Prefix for Nets with Read Arcs
CONCUR '98 Proceedings of the 9th International Conference on Concurrency Theory
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
On the Language Inclusion Problem for Timed Automata: Closing a Decidability Gap
LICS '04 Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science
Theoretical Computer Science
On the Decidability of Metric Temporal Logic
LICS '05 Proceedings of the 20th Annual IEEE Symposium on Logic in Computer Science
Petri Nets for Systems Engineering: A Guide to Modeling, Verification, and Applications
Petri Nets for Systems Engineering: A Guide to Modeling, Verification, and Applications
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
FOSSACS'05 Proceedings of the 8th international conference on Foundations of Software Science and Computation Structures
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
Timed unfoldings for networks of timed automata
ATVA'06 Proceedings of the 4th international conference on Automated Technology for Verification and Analysis
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
Weak Time Petri Nets Strike Back!
CONCUR 2009 Proceedings of the 20th International Conference on Concurrency Theory
TAPAAL: Editor, Simulator and Verifier of Timed-Arc Petri Nets
ATVA '09 Proceedings of the 7th International Symposium on Automated Technology for Verification and Analysis
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
A framework for relating timed transition systems and preserving TCTL model checking
EPEW'10 Proceedings of the 7th European performance engineering conference on Computer performance engineering
Verification of timed-arc Petri nets
SOFSEM'11 Proceedings of the 37th international conference on Current trends in theory and practice of computer science
The Ordinal-Recursive Complexity of Timed-arc Petri Nets, Data Nets, and Other Enriched Nets
LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
Ordinal theory for expressiveness of well-structured transition systems
Information and Computation
| Hi-index | 0.00 |
Timed Petri nets and timed automata are two standard models for the analysis of real-time systems. We study in this paper their relationship, and prove in particular that they are incomparable with respect to language equivalence. In fact, we study the more general model of timed Petri nets with read-arcs (RA-TdPN), already introduced in [J. Srba, Timed-arc petri nets vs. networks of automata, in: Proceedings of the 26th International Conference Application and Theory of Petri Nets (ICATPN 05), Lecture Notes in Computer Science, vol. 3536, Springer, Berlin, 2005, pp. 385-402], which unifies both models of timed Petri nets and of timed automata, and prove that the coverability problem remains decidable for this model. Then, we establish numerous expressiveness results and prove that Zeno behaviours discriminate between several sub-classes of RA-TdPNs. This has surprising consequences on timed automata, for instance, on the power of non-deterministic clock resets.