C. Hanen and A. Munier, Cyclic scheduling on parallel processors: An overview, 1994.

M. Middendorf and V. G. Timkovsky, On scheduling cycle shops: classification, complexity and approximation, Journal of Scheduling, vol.25, issue.2, pp.135-169, 2002.
DOI : 10.1002/jos.95

E. A. Lee and D. G. Messerschmitt, Synchronous data flow, Proceedings of the IEEE, vol.75, issue.9, 1987.
DOI : 10.1109/PROC.1987.13876

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
URL : http://doi.org/10.1016/s0022-0000(71)80013-2

P. Chrétienne, Les réseaux de petri temporisés, 1983.

C. V. Ramamoorthy and G. S. Ho, Performance evaluation of asynchronous concurrent systems using petri nets, IEEE Transactions on Software Engineering, vol.6, issue.5, pp.440-449, 1980.

S. Gaubert, An algebraic method for optimizing resources in timed event graphs, 9th conference on Analysis and Optimization of Systems, 1990.
DOI : 10.1007/BFb0120116

A. Giua, A. Piccaluga, and C. Seatzu, Firing rate optimization of cyclic timed event graphs, Automatica, vol.38, issue.1, 2002.

S. Laftit, J. Proth, and X. Xie, Optimization of invariant criteria for event graphs, IEEE Transactions on Automatic Control, vol.37, issue.5, 1989.

O. Marchetti, Dimensionnement des mémoires pour systèmes embarqués, 2006.

E. Teruel, P. Chrzastowski-wachtel, J. M. Colom, and M. Silva, On weighted T-systems, Proocedings of the 13th Internationnal Conference on Application and Theory of Petri Nets, 1992.
DOI : 10.1007/3-540-55676-1_20

A. Munier, Régime asymptotique optimal d'un graphe d'événements temporisé généralisé: application à un problème d'assemblage, RAIRO- Automatique Productique Informatique Industrielle, pp.487-513, 1993.

N. Sauer, Marking optimization of weighted marked graph, Discrete Event Dynamic Systems, vol.13, issue.3, pp.245-262, 2003.
DOI : 10.1023/A:1024055724914

R. Govindarajan and G. Gao, Rate-optimal shcedule for multi-rate dsp computations, Journal of VLSI Signal Processing, issue.9, pp.211-235, 1995.
DOI : 10.1007/bf02407086
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.42.1773

R. Govindarajan, G. R. Gao, and P. Desai, Minimizing memory requirements in rate-optimal schedule in regular dataflow networks, Journal of VLSI Signal Processing, vol.31, issue.3, 2002.

S. Stuijk, M. Geilen, and T. Basten, Exploring trade-offs in buffer requirements and throughput constraints for synchronous dataflow graphs, Proceedings of the 43rd annual conference on Design automation , DAC '06, 2006.
DOI : 10.1145/1146909.1147138

A. H. Ghamarian, M. Geilen, T. Basten, and S. Stuijk, Parametric throughput analysis of synchronous data flow graphs, DATE, pp.116-121, 2008.

A. Benabid, C. Hanen, O. Marchetti, and A. M. Kordon, Periodic schedules for unitary timed weighted event graphs, Conference ROADEF'08, pp.17-31, 2008.
URL : https://hal.archives-ouvertes.fr/hal-01299167

R. Reiter, Scheduling Parallel Computations, Journal of the ACM, vol.15, issue.4, pp.590-599, 1968.
DOI : 10.1145/321479.321485

M. Wiggers, M. Bekooij, P. Jansen, and G. Smit, Efficient computation of buffer capacities for multi-rate real-time systems with back-pressure, Proceedings of the 4th international conference on Hardware/software codesign and system synthesis , CODES+ISSS '06, pp.10-15, 2006.
DOI : 10.1145/1176254.1176260

O. Marchetti and A. Munier-kordon, Minimizing Place Capacities of Weighted Event Graphs for Enforcing Liveness, Discrete Event Dynamic Systems, pp.91-109, 2008.
DOI : 10.1007/s10626-007-0035-y
URL : https://hal.archives-ouvertes.fr/hal-01195977

M. H. Wiggers, M. J. Bekooij, P. G. Jansen, and G. J. Smit, Efficient Computation of Buffer Capacities for Cyclo-Static Real-Time Systems with Back-Pressure, 13th IEEE Real Time and Embedded Technology and Applications Symposium (RTAS'07)
DOI : 10.1109/RTAS.2007.12

O. Marchetti and A. Munier-kordon, A sufficient condition for the liveness of weighted event graphs, European Journal of Operational Research, vol.197, issue.2, pp.6-2005, 2005.
DOI : 10.1016/j.ejor.2008.07.037
URL : https://hal.archives-ouvertes.fr/hal-01197183

T. H. Cormen, C. E. Leiseerson, R. Rivest, and C. Stein, Introduction to Algorithms, 1990.

M. R. Dantzig and W. Blattner, Finding a cycle in a graph with minimum cost to time ratio with applications to a ship routing problem, Theory of graphs, P.Rosenthiel, Ed. Dunod, pp.77-83, 1966.

M. Gondran and M. Minoux, Graphs and algorithms, 1984.
URL : https://hal.archives-ouvertes.fr/hal-01304880

A. Dasdan, S. Irani, and R. K. Gupta, Efficient algorithms for optimum cycle mean and optimum cost to time ratio problems, Design Automation Conference, pp.37-42, 1999.