M. Alanyali and B. Hajek, Analysis of Simple Algorithms for Dynamic Load Balancing, Mathematics of Operations Research, pp.230-238, 1995.
DOI : 10.1287/moor.22.4.840

M. Alanyali and B. Hajek, On load balancing in erlang networks Stochastic Networks: Theory and, pp.215-230, 1996.

C. Allauzen, Une caract??risation simple des nombres de Sturm, Journal de Th??orie des Nombres de Bordeaux, vol.10, issue.2, pp.237-241, 1998.
DOI : 10.5802/jtnb.226

E. Altman, B. Gaujal, and A. Hordijk, Balanced sequences and optimal routing, Journal of the ACM, vol.47, issue.4, pp.752-775, 2000.
DOI : 10.1145/347476.347482

URL : https://hal.archives-ouvertes.fr/hal-00005853

E. and H. B. Gaujal, A new factorization of mechanical words, 2004.
URL : https://hal.archives-ouvertes.fr/inria-00071413

F. Baccelli, G. Cohen, G. J. Olsder, and J. Quadrat, Synchronization and Linearity: an algebra for discrete event systems, 1992.

J. Bernoulli, Recueil pour les astronomes, A Berlin, vol.1, pp.255-284

J. Berstel and A. Luca, Sturmian words, Lyndon words and trees, Theoretical Computer Science, vol.178, issue.1-2, pp.171-203, 1997.
DOI : 10.1016/S0304-3975(96)00101-6

URL : https://hal.archives-ouvertes.fr/hal-00619479

J. Berstel and P. Séébold, Sturmian Words, Algebraic Combinatorics on Words. Chap. 2, 2001.
URL : https://hal.archives-ouvertes.fr/hal-00620780

J. Boucaron and J. Millo, Compositionality of Statically Scheduled IP, Electronic Notes in Theoretical Computer Science, vol.200, issue.1, pp.71-87, 2008.
DOI : 10.1016/j.entcs.2008.02.007

J. Boucaron, J. Millo, R. , and S. , Latency-insensitive design and central repetitive scheduling, Fourth ACM and IEEE International Conference on Formal Methods and Models for Co-Design, 2006. MEMOCODE '06. Proceedings., pp.175-183, 2006.
DOI : 10.1109/MEMCOD.2006.1695923

URL : https://hal.archives-ouvertes.fr/inria-00071374

J. Boucaron, J. Millo, R. , and S. , Formal methods for scheduling of latencyinsensitive designs, EURASIP journal on embedded system, 2007.
URL : https://hal.archives-ouvertes.fr/hal-00784464

J. Carlier and P. Chrétienne, Problème d'ordonnancement: modélisation, complexité, algorithmes, 1988.

L. Carloni, K. Mcmillan, and A. Sangiovanni-vincentelli, Theory of latency-insensitive design, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, vol.20, issue.9, pp.1059-1076, 2001.
DOI : 10.1109/43.945302

A. Cohen, L. Mandel, F. Plateau, and M. Pouzet, Abstraction of Clocks in Synchronous Data-Flow Systems, The Sixth ASIAN Symposium on Programming Languages and Systems, 2008.
DOI : 10.1016/0167-6423(91)90001-E

URL : https://hal.archives-ouvertes.fr/hal-01257274

F. Commoner, A. W. Holt, S. Even, and A. Pnueli, Marked directed graphs, Journal of Computer and System Sciences, vol.5, issue.5, pp.511-523, 1971.
DOI : 10.1016/S0022-0000(71)80013-2

J. Desel and J. Esparza, Free choice Petri nets, 1995.
DOI : 10.1017/CBO9780511526558

E. Laurier, Op??rations sur les mots de Christoffel, Journal de Th??orie des Nombres de Bordeaux, vol.11, issue.1, pp.111-132, 1999.
DOI : 10.5802/jtnb.241

D. Matzke, Will physical scalability sabotage performance gains? Computer, pp.37-39, 1997.
DOI : 10.1109/2.612245

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=

C. Ramchandani, Analysis of Asynchronous Concurrent Systems by Timed Petri Nets, 1974.