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

@inproceedings{Bouyer2006TimedPN,
  title={Timed Petri Nets and Timed Automata: On the Discriminating Power of Zeno Sequences},
  author={Patricia Bouyer and Serge Haddad and Pierre-Alain Reynier},
  booktitle={ICALP},
  year={2006}
}
Timed Petri nets and timed automata are two standard models f or the analysis of realtime systems. We study in this paper their relationship, and prove in particular that they are incomparable w.r.t. language equivalence. In fact, we s tudy the more general model of timed Petri nets with read-arcs ( RA-TdPN), already introduced in [17], which unifies both models of timed Petri nets and of timed automata, and pro ve that the coverability problem remains decidable for this model. Then, we… CONTINUE READING