C. André, Syntax and semantics of the clock constraint specification language (ccsl), 2009.

R. Gascon, F. Mallet, and J. Deantoni, Logical Time and Temporal Logics: Comparing UML MARTE/CCSL and PSL, 2011 Eighteenth International Symposium on Temporal Representation and Reasoning, pp.141-148, 2011.
DOI : 10.1109/TIME.2011.10
URL : https://hal.archives-ouvertes.fr/inria-00540738

R. Alur and G. Weiss, Regular Specifications of Resource Requirements for Embedded Control Software, 2008 IEEE Real-Time and Embedded Technology and Applications Symposium, pp.159-168, 2008.
DOI : 10.1109/RTAS.2008.13

R. Alur and G. Weiss, Rtcomposer:a framework for real-time components with scheduling interfaces, Proceedings of the 8th ACM international conference on Embedded software, EMSOFT '08, pp.159-168, 2008.

Y. Abdeddaim and D. Masson, Real-Time Scheduling of Energy Harvesting Embedded Systems with Timed Automata, 2012 IEEE International Conference on Embedded and Real-Time Computing Systems and Applications, pp.31-40, 2012.
DOI : 10.1109/RTCSA.2012.21
URL : https://hal.archives-ouvertes.fr/hal-00688069

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

E. Fersman, L. Mokrushin, P. Pettersson, and W. Yi, Schedulability analysis of fixed-priority systems using timed automata, Theoretical Computer Science, vol.354, issue.2, pp.301-317, 2006.
DOI : 10.1016/j.tcs.2005.11.019

E. Fersman, P. Krcal, P. Pettersson, and W. Yi, Task automata: Schedulability, decidability and undecidability, Information and Computation, vol.205, issue.8, pp.1149-1172, 2007.
DOI : 10.1016/j.ic.2007.01.009
URL : http://doi.org/10.1016/j.ic.2007.01.009

C. Courcoubetis, M. Vardi, P. Wolper, and M. Yannakakis, Memory efficient algorithms for the verification of temporal properties, Computer-Aided Verification, pp.233-242, 1991.
DOI : 10.1007/BFb0023737

H. Tauriainen, Nested emptiness search for generalized Buchi automata, Proceedings. Fourth International Conference on Application of Concurrency to System Design, 2004. ACSD 2004., pp.127-154, 2005.
DOI : 10.1109/CSD.2004.1309129

H. Tauriainen, On translating linear temporal logic into alternating and nondeterministic automata, Research Report, vol.83, 2003.

J. Geldenhuys and A. Valmari, More efficient on-the-fly LTL verification with Tarjan's algorithm, Theoretical Computer Science, vol.345, issue.1, pp.60-82, 2005.
DOI : 10.1016/j.tcs.2005.07.004

H. Moritz, A. Knapp, and S. Merz, Truly on-the-fly ltl model checking In Tools and Algorithms for the Construction and Analysis of Systems, Lecture Notes in Computer Science, vol.3440, pp.191-205, 2005.

J. Couvreur, A. Duret-lutz, and D. Poitrenaud, On-the-fly emptiness checks for generalized büchi automata, Model Checking Software, pp.903-903, 2005.