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

E. Levner and V. Kats, A parametric critical path problem and an application for cyclic scheduling, Discrete Applied Mathematics, vol.87, issue.1-3, pp.149-158, 1998.
DOI : 10.1016/S0166-218X(98)00054-7
URL : https://doi.org/10.1016/s0166-218x(98)00054-7

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

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

P. Serafini and W. Ukovich, A Mathematical Model for Periodic Scheduling Problems, SIAM Journal on Discrete Mathematics, vol.2, issue.4, pp.550-558, 1989.
DOI : 10.1137/0402049

G. Cohen, P. Moller, J. Quadrat, and M. Viot, Algebraic tools for theperformance evaluation of discrete event systems, IEEE Proceeding: special issue on Discrete Event Systems, pp.39-58, 1989.
DOI : 10.1109/5.21069
URL : http://www-rocq.inria.fr/scilab/quadrat/IEEEProc89.pdf

J. Peterson, Petri Net Theory and the Modeling of Systems, 1981.

G. Cavory, R. Dupas, and G. Goncalves, A genetic approach to solving the problem of cyclic job shop scheduling with linear constraints, European Journal of Operational Research, vol.161, issue.1, pp.929-954, 2005.
DOI : 10.1016/j.ejor.2003.03.001

B. Trouillet, A. Benasser, and J. Gentina, Transformation of the cyclic scheduling problem of a large class of FMS into the search of an optimized initial marking of a linearizable weighted T-system, Sixth International Workshop on Discrete Event Systems, 2002. Proceedings., p.83, 2002.
DOI : 10.1109/WODES.2002.1167673

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

M. Benazouz, O. Marchetti, A. Munier-kordon, and P. Urard, A polynomial algorithm for the computation of buffer capacities with throughput constraint for embedded system design, 2009 International Conference on Computers & Industrial Engineering, pp.690-695, 2009.
DOI : 10.1109/ICCIE.2009.5223822
URL : https://hal.archives-ouvertes.fr/hal-00368683

R. Govindarajan and G. R. Gao, Rate-optimal schedule for multi-rate DSP computations, Journal of VLSI signal processing systems for signal, image and video technology, vol.40, issue.3, pp.211-235, 1995.
DOI : 10.1145/123465.123481
URL : http://144.16.67.13/~govind/papers/JVLSI-95.ps.gz

S. S. Bhattacharyya and E. A. Lee, Looped schedules for dataflow descriptions of multirate signal processing algorithms, Formal Methods in System Design, pp.183-205, 1994.
DOI : 10.1007/BF01383830
URL : http://ptolemy.thomson-csf.fr/mirrors/ptolemy.eecs.berkeley.edu/ptolemy/papers/loop_schedules.ps.Z

A. Munier, Régime asymptotique optimal d'un graphe d'´ evénements temporisé généralisé: applicationàapplication`applicationà un probì emed'assemblage, RAIRO-Automatique Productique Informatique Industrielle, pp.487-513, 1993.

M. Hartmann and C. Arguelles, Transience Bounds for Long Walks, Mathematics of Operations Research, vol.24, issue.2, pp.414-439, 1999.
DOI : 10.1287/moor.24.2.414

F. Bacelli, G. Cohen, G. J. Olsder, and J. Quadrat, Synchronisation and Linearity: an Algebra for Discrete Event Systems, 1992.

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

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.
DOI : 10.1109/tse.1980.230492

R. Ramchandani, Analysis of asynchronous systems by timed petri nets, 1973.

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

P. Brucker and T. Kampmeyer, Tabu Search Algorithms for Cyclic Machine Scheduling Problems, Journal of Scheduling, vol.2, issue.4, pp.303-322, 2005.
DOI : 10.1287/ijoc.2.1.4

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.532-540, 2009.
DOI : 10.1016/j.ejor.2008.07.037
URL : https://hal.archives-ouvertes.fr/hal-01197183

R. M. Karp and R. E. Miller, Properties of a Model for Parallel Computations: Determinacy, Termination, Queueing, SIAM Journal on Applied Mathematics, vol.14, issue.6, pp.1390-1411, 1966.
DOI : 10.1137/0114108

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

T. Cormen, C. Leiserson, and R. Rivest, Introduction to Algorithms, 1990.

G. Dantzig, W. Blattner, and M. Rao, 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.
DOI : 10.21236/AD0646553

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

M. Gondran, Lesprobì emes de ratio minimum en optimisation combinatoire, pp.1-3433, 1980.

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.
DOI : 10.1109/dac.1999.781227
URL : http://www.ics.uci.edu/~irani/pubs/cycle_dac.ps

O. Marchetti-received-the and M. S. , degree in Computer Science and Operation Research and the Ph, 2003.