1. Comparison of the expressiveness of timed automata and time Petri nets;Bérard,2005
2. Timed Petri nets and BQOs;Abdulla,2001
3. Decidability of properties of timed-arc Petri nets;de~Frutos Escrig,2000
4. An efficient translation of timed-arc Petri nets to networks of timed automata;Byg,2009
5. P.M. Merlin, A study of the recoverability of computing systems, Ph.D. Thesis, Dep. of Information and Computer Science, University of California, Irvine, CA, 1974.