P. Alessandri and V. Berthé, Three distance theorems and combinatorics on words, pp.103-132, 1998.

B. Gaujal and E. Hyon, Factorization of mechanical words and continued fractions, pp.37-43, 2004.
URL : https://hal.archives-ouvertes.fr/inria-00100134

B. Gaujal and N. Navet, Trafic shaping in real time distributed systems : a low complexity approach, Computer Communication, 1999.

P. Geer, H. W. Mclaughlin, and K. Unsworth, Cellular line : An Introduction, nd Conference on Discrete Mathematics and Computer Science, pp.167-178, 2003.

M. Hamdaoui and P. Ramanathan, A dynamic priority assignment technique for streams with (m, k)-firm deadlines, IEEE Transactions on Computers, vol.44, issue.12, pp.1443-1451, 1995.
DOI : 10.1109/12.477249

C. L. Liu and J. W. Layland, Scheduling algorithms for multiprogramming in hard real-time environment, Journal of the ACM, vol.20, issue.1, pp.40-61, 1973.

M. Lothaire, Algebraic Combinatorics on Words, 2002.
DOI : 10.1017/CBO9781107326019
URL : https://hal.archives-ouvertes.fr/hal-00620608

G. Quan and X. Hu, Enhanced Fixed-priority Scheduling with (m,k)-firm Guarantee, Proc. Of 21st IEEE Real-Time Systems Symposium, pp.79-88, 2000.

P. Ramanathan, Overload management in real-time control applications using (m, k)-firm guarantee, IEEE Transactions on Parallel and Distributed Systems, vol.10, issue.6, pp.549-559, 1999.
DOI : 10.1109/71.774906

Y. Song and A. Koubâa, Gestion dynamique de la Qds temps réel selon (m,k)-firm " Ecole d'été temps réel sept, pp.327-342, 2003.

A. Koubâa and Y. Q. Song, Loss-tolerant QoS using firm constraints in guaranteed rate networks, Proceedings. RTAS 2004. 10th IEEE Real-Time and Embedded Technology and Applications Symposium, 2004., pp.526-533, 2004.
DOI : 10.1109/RTTAS.2004.1317300

. Annexe, Démonstration du théorème 3.10. Montrons tout d'abord que le (m,k) pattern de Ramanathan est un mot mécanique