M. Akian, S. Gaubert, and C. Walsh, Discrete max-plus spectral theory, Idempotent Mathematics and Mathematical Physics, pp.53-78, 2005.
DOI : 10.1090/conm/377/06984
URL : https://hal.archives-ouvertes.fr/inria-00000968

H. Attiya, V. Gramoli, and A. Milani, A Provably Starvation-Free Distributed Directory Protocol, SSS 2010, pp.405-419, 2010.
DOI : 10.1007/978-3-642-16023-3_33
URL : https://hal.archives-ouvertes.fr/hal-00992698

B. Awerbuch, Complexity of network synchronization, Journal of the ACM, vol.32, issue.4, pp.804-823, 1985.
DOI : 10.1145/4221.4227

V. C. Barbosa and E. Gafni, Concurrency in heavily loaded neighborhood-constrained systems, ACM Transactions on Programming Languages and Systems, vol.11, issue.4, pp.562-584, 1989.
DOI : 10.1145/69558.69560

A. Bouillard and B. Gaujal, Coupling Time of a (max,plus) Matrix, Workshop on Max-Plus Algebra at the 1st IFAC Symposium on System Structure and Control, 2001.
URL : https://hal.archives-ouvertes.fr/inria-00100573

C. Busch and S. Tirthapura, Analysis of Link Reversal Routing Algorithms, SIAM Journal on Computing, vol.35, issue.2, pp.305-326, 2005.
DOI : 10.1137/S0097539704443598

K. M. Chandy and J. Misra, The drinking philosophers problem, ACM Transactions on Programming Languages and Systems, vol.6, issue.4, pp.632-646, 1984.
DOI : 10.1145/1780.1804

B. Charron-bost, M. Függer, and T. Nowak, New Transience Bounds for Long Walks (2012) arXiv:1209, p.3342

B. Charron-bost, M. Függer, J. L. Welch, and J. Widder, Full Reversal Routing as a Linear Dynamical System, SIROCCO 2011, pp.101-112, 2011.
DOI : 10.1007/BFb0022451

B. Charron-bost, M. Függer, J. L. Welch, and J. Widder, Partial is Full, SIROCCO 2011, pp.113-124, 2011.
DOI : 10.1007/978-3-642-05434-1_10

G. Cohen, D. Dubois, J. Quadrat, and M. Viot, Analyse du comportement périodique de systèmes de production par la théorie des dio¨?desdio¨?des, INRIA Research Report, vol.191, 1983.

D. Dubois and K. E. Stecke, Dynamic Analysis of Repetitive Decision-Free Discrete Event Processes: The Algebra of Timed Marked Graphs and Algorithmic Issues

S. Even and S. Rajsbaum, The use of a synchronizer yields the maximum computation rate in distributed networks, Theory of Computing Systems, vol.5, issue.9, pp.447-474, 1997.
DOI : 10.1007/BF02679457

E. M. Gafni and D. P. Bertsekas, Asymptotic optimality of shortest path routing algorithms, IEEE Transactions on Information Theory, vol.33, issue.1, pp.83-90, 1987.
DOI : 10.1109/TIT.1987.1057274

Y. Malka and S. Rajsbaum, Analysis of distributed algorithms based on recurrence relations, WDAG 1991, pp.242-253, 1992.
DOI : 10.1007/BFb0022451

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

K. Nachtigall, Powers of matrices over an extremal algebra with applications to periodic graphs, Mathematical Methods of Operations Research, vol.2, issue.1, pp.87-102, 1997.
DOI : 10.1007/BF01199464

H. Schneider and M. H. Schneider, Max-Balancing Weighted Directed Graphs and Matrix Scaling, Mathematics of Operations Research, vol.16, issue.1, pp.208-222, 1991.
DOI : 10.1287/moor.16.1.208

G. Soto-y-koelemeijer, On the Behaviour of Classes of Min-Max-Plus Systems, 2003.

S. Tirthapura and M. Herlihy, Self-stabilizing distributed queuing, IEEE Transactions on Parallel and Distributed Systems, vol.17, issue.7, pp.646-655, 2006.
DOI : 10.1109/TPDS.2006.94
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.134.6443