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. 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.
KeywordsCoverability Problem Expressive Power Time Automaton Silent Action Relative Expressiveness
Unable to display preview. Download preview PDF.
- 6.Bouyer, P., Haddad, S., Reynier, P.-A.: Timed Petri nets and timed automata: On the discriminating power of Zeno sequences. In: Research Report LSV-06-06, ENS de Cachan, France (2006)Google Scholar
- 7.Bouyer, P., Haddad, S., Reynier, P.-A.: Timed unfoldings of networks of timed automata. In: Research Report LSV-06-09, ENS de Cachan, France (2006)Google Scholar
- 8.Girault, C., Valk, R. (eds.): Petri Nets for Systems Engineering. Springer, Heidelberg (2002)Google Scholar
- 9.Mahata, P.: Model Checking Parameterized Timed Systems. PhD thesis, Dept. Information Technology, Uppsala University, Sweden (2005)Google Scholar