Timed Pétri nets and timed automata are two standard models for the analysis of real-time systems. In this paper, we prove that they are incomparable for the timed language equivalence. Thus we propose an extension of timed Petri nets with read-arcs (RA-TdPN), whose coverability problem is decidable. We also show that this model unifies timed Petri nets and timed automata. 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, e.g. on the power of non-deterministic clock resets. © Springer-Verlag Berlin Heidelberg 2006.
CITATION STYLE
Bouyer, P., Haddad, S., & Reynier, P. A. (2006). Timed petri nets and timed automata: On the discriminating power of zeno sequences. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4052 LNCS, pp. 420–431). Springer Verlag. https://doi.org/10.1007/11787006_36
Mendeley helps you to discover research relevant for your work.