A. Parosh, R. Abdulla, and . Mayr, Priced Timed Petri Nets, Logical Methods in Computer Science, vol.9, issue.4, p.2013

R. Alur, S. L. Torre, and G. J. Pappas, Optimal paths in weighted timed automata, Theoretical Computer Science, vol.318, issue.3, pp.297-322, 2004.
DOI : 10.1016/j.tcs.2003.10.038
URL : https://doi.org/10.1016/j.tcs.2003.10.038

G. Behrmann, A. Fehnker, T. Hune, K. Larsen, P. Pettersson et al., Minimum-Cost Reachability for Priced Timed Automata, BRICS Report Series, vol.8, issue.3, pp.147-161, 2001.
DOI : 10.7146/brics.v8i3.20457
URL : http://www.brics.dk//RS/01/3/BRICS-RS-01-3.pdf

G. Behrmann, K. G. Larsen, and J. I. Rasmussen, Optimal scheduling using priced timed automata, ACM SIGMETRICS Performance Evaluation Review, vol.32, issue.4, pp.34-40, 2005.
DOI : 10.1145/1059816.1059823

B. Berthomieu and M. Diaz, Modeling and verification of time dependent systems using time Petri nets, IEEE Transactions on Software Engineering, vol.17, issue.3, pp.259-273, 1991.
DOI : 10.1109/32.75415

B. Berthomieu and M. Menasche, An enumerative approach for analyzing time petri nets, IFIP Congress, pp.41-46, 1983.

H. Boucheneb and J. Mullins, Analyse des réseaux temporels : Calcul des classes en O(n 2 ) et des temps de chemin en O(m × n). TSI. Technique et science informatiques, pp.435-459, 2003.
DOI : 10.3166/tsi.22.435-459

P. Bourdil and B. Berthomieu, Symmetry reduction for time Petri net state classes, Science of Computer Programming, vol.132, pp.209-225, 2016.
DOI : 10.1016/j.scico.2016.08.008
URL : https://hal.archives-ouvertes.fr/hal-01561994

P. Bouyer, M. Colange, and N. Markey, Symbolic Optimal Reachability in Weighted Timed Automata, Proceedings of the 28th International Conference on Computer Aided Verification (CAV'16), pp.513-530, 2016.
DOI : 10.1023/A:1010972524021
URL : http://arxiv.org/pdf/1602.00481

D. L. Dill, Timing assumptions and verification of finite-state concurrent systems, Proc. Int, pp.197-212, 1989.
DOI : 10.1007/3-540-52148-8_17

K. Larsen, G. Behrmann, E. Brinksma, A. Fehnker, T. Hune et al., As Cheap as Possible: Effcient Cost-Optimal Reachability for Priced Timed Automata, Lecture Notes in Computer Science, vol.2102, pp.493-505, 2001.
DOI : 10.1007/3-540-44585-4_47
URL : https://ris.utwente.nl/ws/files/12827332/fulltext.pdf

D. Lime, O. H. Roux, C. Seidner, and L. Traonouez, Romeo: A Parametric Model-Checker for Petri Nets with Stopwatches, 15th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, pp.54-57, 2009.
DOI : 10.1007/11513988_41
URL : http://people.rennes.inria.fr/Louis-Marie.Traonouez/publications/tacas09.pdf

A. Marcone, Fine analysis of the quasi-orderings on the power set, Order, vol.18, issue.4, pp.339-347, 2001.
DOI : 10.1023/A:1013952225669

J. I. Rasmussen, K. G. Larsen, and K. Subramani, On using priced timed automata to achieve optimal scheduling, Formal Methods in System Design, vol.29, issue.1, pp.97-114, 2006.
DOI : 10.1007/s10703-006-0014-1