Timed Petri Nets and Timed Automata: On the Discriminating Power of Zeno Sequences | Zendy

Patricia Bouyer | Zendy; Serge Haddad | Zendy; Pierre-Alain Reynier | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Timed Petri Nets and Timed Automata: On the Discriminating Power of Zeno Sequences

Author(s) -

Patricia Bouyer,

Serge Haddad,

Pierre-Alain Reynier

Publication year - 2006

Publication title -

lecture notes in computer science

Language(s) - English

Resource type - Book series

SCImago Journal Rank - 0.249

H-Index - 400

eISSN - 1611-3349

pISSN - 0302-9743

DOI - 10.1007/11787006_36

Subject(s) - petri net , decidability , computer science , zeno's paradoxes , timed automaton , automaton , equivalence (formal languages) , stochastic petri net , expressive power , reachability problem , reachability , theoretical computer science , algorithm , programming language , discrete mathematics , mathematics , geometry

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

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research