Timed Petri nets and timed automata: On the discriminating power of zeno sequences

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.

[1]  J. Ouaknine,et al.  On the language inclusion problem for timed automata: closing a decidability gap , 2004, LICS 2004.

[2]  Pritha Mahata.  Model Checking Parameterized Timed Systems , 2005 .

[3]  Patricia Bouyer,et al.  Updatable timed automata , 2004, Theor. Comput. Sci..

[4]  Parosh Aziz Abdulla,et al.  Timed Petri Nets and BQOs , 2001, ICATPN.

[5]  Rajeev Alur,et al.  A Theory of Timed Automata , 1994, Theor. Comput. Sci..

[6]  Józef Winkowski.  Reachability in Contextual Nets , 2002, Fundam. Informaticae.

[7]  Patricia Bouyer,et al.  Timed Unfoldings for Networks of Timed Automata , 2006, ATVA.

[8]  Rüdiger Valk,et al.  Petri nets for systems engineering - a guide to modeling, verification, and applications , 2010 .

[9]  Patricia Bouyer,et al.  Timed Petri nets and timed automata: On the discriminating power of zeno sequences , 2006, Inf. Comput..

[10]  Rüdiger Valk,et al.  Petri Nets for Systems Engineering , 2003, Springer Berlin Heidelberg.

[11]  Jirí Srba.  Timed-Arc Petri Nets vs. Networks of Timed Automata , 2005, ICATPN.

[12]  David de Frutos-Escrig,et al.  On non-decidability of reachability for timed-arc Petri nets , 1999, PNPM.

[13]  M. Diaz,et al.  Modeling and Verification of Time Dependent Systems Using Time Petri Nets , 1991, IEEE Trans. Software Eng..

[14]  Slawomir Lasota,et al.  Alternating timed automata , 2005, TOCL.

[15]  Kenneth L. McMillan,et al.  A technique of state space search based on unfolding , 1995, Formal Methods Syst. Des..

[16]  Alexandre Yakovlev,et al.  Unfolding and Finite Prefix for Nets with Read Arcs , 1998, CONCUR.

[17]  Parosh Aziz Abdulla,et al.  Decidability of Zenoness, Syntactic Boundedness and Token-Liveness for Dense-Timed Petri Nets , 2004, FSTTCS.

[18]  Walter Vogler,et al.  Efficiency of asynchronous systems, read arcs, and the MUTEX-problem , 2002, Theor. Comput. Sci..

[19]  Philippe Schnoebelen,et al.  Model Checking Timed Automata with One or Two Clocks , 2004, CONCUR.

[20]  Joël Ouaknine,et al.  On the decidability of metric temporal logic , 2005, 20th Annual IEEE Symposium on Logic in Computer Science (LICS' 05).

[21]  Francesca Rossi,et al.  Contextual nets , 1995, Acta Informatica.

[22]  Graham Higman,et al.  Ordering by Divisibility in Abstract Algebras , 1952 .