Timed Petri Nets and Timed Automata: On the Discriminating Power of Zeno Sequences
Bouyer, Patricia; Haddad, Serge; Reynier, Pierre-Alain (2006), Timed Petri Nets and Timed Automata: On the Discriminating Power of Zeno Sequences, in Bugliesi, Michele; Preneel, Bart; Sassone, Vladimiro; Wegener, Ingo, Automata, Languages and Programming 33rd International Colloquium, ICALP 2006, Venice, Italy, July 10-14, 2006, Proceedings, Part II, Springer : Berlin, p. 420-431. http://dx.doi.org/10.1007/11787006_36
TypeCommunication / Conférence
Conference titleICALP 2006 33rd International Colloquium on Automata, Languages and Programming
Book titleAutomata, Languages and Programming 33rd International Colloquium, ICALP 2006, Venice, Italy, July 10-14, 2006, Proceedings, Part II
Book authorBugliesi, Michele; Preneel, Bart; Sassone, Vladimiro; Wegener, Ingo
Series titleLecture Notes in Computer Science
Number of pages603
MetadataShow full item record
Abstract (EN)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.
Subjects / Keywordstimed automata; Timed Petri nets
Showing items related by title and author.