V. Adlakha and V. Kulkarni, A Classified Bibliography Of Research On Stochastic Pert Networks: 1966-1987, INFOR: Information Systems and Operational Research, vol.27, issue.3, 1987.
DOI : 10.1080/03155986.1989.11732098

F. Baccelli, G. Cohen, G. J. Olsder, and J. P. Quadrat, Synchronization and Linearity, 1992.

F. Baccelli, A. Jean-marie, and Z. Liu, A survey on solution methods for task graph models, Proceedings of the 2nd QMIPS Workshop, 1993.

H. Braker, Algorithms and Applications in Timed Discrete Event Systems, 1993.

P. Chretienne, Les Réseaux de Petri Temporisés, 1983.

G. Cohen, D. Dubois, J. P. Quadrat, and M. Viot, A linear system-theoretic view of discreteevent processes and its use for performance evaluation in manufacturing, IEEE Trans. Automatic Control, pp.30210-220, 1985.

A. Darte, L. Khachiyan, and Y. Robert, LINEAR SCHEDULING IS NEARLY OPTIMAL, Parallel Processing Letters, vol.01, issue.02, pp.73-81, 1991.
DOI : 10.1142/S0129626491000021
URL : https://hal.archives-ouvertes.fr/hal-00857050

A. Darte, F. Vivien, and L. Lyon, Automatic parallelization based on multi-dimensional scheduling, 1994.
URL : https://hal.archives-ouvertes.fr/hal-00857084

S. Gaubert, P. Butkovi?, and R. Cuninghame-green, Minimal (max,+) Realization of Convex Sequences, SIAM Journal on Control and Optimization, vol.36, issue.1, pp.137-147, 1998.
DOI : 10.1137/S036301299528534X

B. Gaujal, Parallélisme et simulation de systèmessystèmes`systèmesàsystèmesàévénements discrets, 1994.

B. Gaujal, A. Jean-marie, and J. Mairesse, Minimal representation of uniform recurrence equations, 1995.

B. Gaujal and A. J. Marie, Computational issues in recursive stochastic systems, pp.209-230, 1998.
DOI : 10.1017/CBO9780511662508.012

M. Gondran and M. Minoux, Graphes et algorithmes, Engl. transl. Graphs and Algorithms, 1979.

C. Hanen and A. Munier, A study of the cyclic scheduling problem on parallel processors, Discrete Applied Mathematics, vol.57, issue.2-3, pp.167-192, 1995.
DOI : 10.1016/0166-218X(94)00102-J

R. Karp, R. Miller, and S. Winograd, The Organization of Computations for Uniform Recurrence Equations, Journal of the ACM, vol.14, issue.3, pp.563-590, 1967.
DOI : 10.1145/321406.321418

C. Leiserson and J. Saxe, Retiming synchronous circuitry, Algorithmica, vol.9, issue.No. 1, pp.5-35, 1991.
DOI : 10.1007/BF01759032
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.368.3222

J. Mairesse, Stabilité des systèmessystèmes`systèmesàsystèmesàévénements discrets stochastiques. Approche algébrique, 1995.

T. Murata, Petri nets: Properties, analysis and applications, Proceedings of the IEEE, pp.541-580, 1989.
DOI : 10.1109/5.24143

G. J. Olsder, On the Characteristic Equation and Minimal Realizations for Discrete-Event Dynamic Systems, Proc. 7-th Int. Conf. on Anal. and Optim. of Systems, pp.189-201, 1986.
DOI : 10.1007/BFb0007557

N. Pippenger, Advances in pebbling, Proc. ICALP, number 140 in LNCS, pp.407-417, 1982.
DOI : 10.1007/BFb0012787

R. Sethi, Complete Register Allocation Problems, SIAM Journal on Computing, vol.4, issue.3, pp.226-248, 1975.
DOI : 10.1137/0204020
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.221.7491

N. Shenoy and R. , Efficient implementation of retiming, Proc. ICCAD 1994, 1994.

B. Remark, Game M 4 can be adapted to be played on a finite binary tree (for more details, see the proof of Proposition B.2) In this case, the minimal number of pebbles is known as the Strahler's number. This number appears in various fields ranging from hydrology and combinatorics to molecular biology