1. A study of the recoverability of computing systems;Merlin,1974
2. Complexity of some problems in Petri nets;Jones;Theor. Comput. Sci.,1977
3. Weak time Petri nets strike back!;Reynier,2009
4. Decidable classes of unbounded Petri nets with time and urgency;Akshay,2016
5. Dynamical properties of timed automata;Puri;In DEDS,2000