.. Atomic-register-simulation-specification, 76 B Bounded labeling system, p.96

R. More, 42 Strong fairness, p.32

.. Bounded, 169 Fixed point

/. New, I. Path, and .. , 74 O Output variables, Elementary, p.11

.. Pseudo-stabilization, 60 Fault-tolerant, p.63

.. Spanning-tree, 12 Maximum metric, p.168

.. Weak-stabilization, 61 List of Notations ? Action of g, p.13

.. Member-of-the-system, 13 ? ? uv Communication channel for acknowledgements sent by v to u, 17 ? ? uv Communication channel for messages sent by u to v . . . . . . . . . . . . 17

.. Degree-of-vertex-v, 12 diam(g) Diameter of communication graph g, p.12

. Bibliography, H. Noga-alon, S. Attiya, S. Dolev, M. Dubois et al., Brief announcement: Sharing memory in a self-stabilizing manner, 24th International Symposium on Distributed Computing, p.246, 2010.

H. Noga-alon, S. Attiya, S. Dolev, M. Dubois, S. Potop-butucaru et al., Pragmatic self-stabilization of atomic memory in message-passing systems, 13th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS'11), p.246, 2011.

[. Afek and G. M. Brown, Self-stabilization over unreliable communication media Sharing memory robustly in message-passing systems, Distributed Computing 9th Annual ACM Symposium on Principles of Distributed Computing, pp.27-34, 1990.

[. Attiya, A. Bar-noy, and D. Dolev, Sharing memory robustly in message-passing systems, Journal of the ACM, vol.42, issue.1, pp.124-142, 1995.
DOI : 10.1145/200836.200869

U. Abraham, Self-stabilizing timestamps, Theoretical Computer Science, vol.308, issue.1-3, pp.449-515, 2003.
DOI : 10.1016/S0304-3975(03)00130-0

C. Adgf-+-07-]-emmanuelle-anceaume, H. Delporte-gallet, M. Fauconnier, J. Hurfin, and . Widder, Clock synchronization in the byzantine-recovery failure model, 11th International Conference on Principles of Distributed Systems, pp.90-104, 2007.

[. Anagnostou and V. Hadzilacos, Tolerating transient and permanent failures (extended abstract), 7th International Workshop on Distributed Algorithms (WDAG 1993), pp.174-188, 1993.
DOI : 10.1007/3-540-57271-6_35

S. Awerbuch, Y. Kutten, B. Mansour, G. Patt-shamir, and . Varghese, A Time-Optimal Self-Stabilizing Synchronizer Using A Phase Clock, IEEE Transactions on Dependable and Secure Computing, vol.4, issue.3, pp.180-190, 2007.
DOI : 10.1109/TDSC.2007.1007

[. Afek, S. Kutten, M. Avizienis, J. Laprie, B. Randell et al., Memory-efficient self stabilizing protocols for general networks Basic concepts and taxonomy of dependable and secure computing, 4th International Workshop on Distributed Algorithms, pp.15-28, 1990.

H. Attiya, Robust simulation of shared memory: 20 years after. The Distributed Computing Column of the Bulletin of the European Association for Theoretical Computer Science, pp.99-113, 2010.

H. Attiya and J. Welch, Distributed Computing, Fundamentals , Simulations, and Advanced Topics, 2004.

A. Awerbuch, Complexity of network synchronization Lélia Blin and Franck Butelle. The first approximated distributed algorithm for the minimum degree spanning tree problem on general graphs, Jourhnal of ACM International Journal of Foundations of Computer Science, vol.32, issue.153, pp.804-823507, 1985.

[. Beauquier, S. Cordier, and S. Delaët, Optimum probabilistic self-stabilization on uniform rings Necessary and sufficient conditions for 1-adaptivity, 2nd Workshop on Self-stabilizing Systems 20th IEEE International Conference on Paralle and Distributed SystemsBDKM96] Joffroy Beauquier, Oliver Debas, and Synnöve Kekkonen-Moneta, pp.15-16, 1995.

[. Beauquier, A. Kumar-datta, M. Potop-butucaru, and F. Magniette, Self-Stabilizing Local Mutual Exclusion and Daemon Refinement, Chicago Journal of Theoretical Computer Science, vol.35, issue.53, p.54, 2002.
DOI : 10.1007/3-540-40026-5_15

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

A. Bui, A. Kumar-datta, F. Petit, and V. Villain, Snap-stabilization and PIF in tree networks, Distributed Computing, vol.29, issue.1, pp.3-19, 2007.
DOI : 10.1007/s00446-007-0030-4

C. Berge, Théorie des graphes et ses applications Collection universitaire de mathématiques. Dunod, 1967.

J. E. Burns, M. G. Gouda, and R. E. Miller, Stabilization and pseudo-stabilization, Distributed Computing, pp.35-42, 1993.
DOI : 10.1007/BF02278854

J. Burman and S. Kutten, Time optimal asynchronous selfstabilizing spanning tree, 21st International Symposium on Distributed Computing, pp.92-107, 2007.
DOI : 10.1007/978-3-540-75142-7_10

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

[. Beauquier and S. Kekkonen-moneta, Fault-tolerance and self-stabilization: impossibility results and solutions using self-stabilizing failure detectors, International Journal of Systems Science, vol.32, issue.11, pp.1177-1187, 1997.
DOI : 10.1007/BFb0020419

[. Beauquier and S. Kekkonen-moneta, On FTSS-solvable distributed problems, Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing , PODC '97, pp.64-79, 1997.
DOI : 10.1145/259380.259515

[. Butelle, C. Lavault, and M. Bui, A uniform selfstabilizing minimum diameter tree algorithm (extended abstract), 9th International Workshop on Distributed Algorithms, pp.257-272, 1995.

[. Bloom, Constructing two-writer atomic registers, IEEE Transactions on Computers, vol.37, issue.12, p.75, 1988.
DOI : 10.1109/12.9729

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

M. Ben-or, D. Dolev, and E. N. Hoch, Fast self-stabilizing byzantine tolerant digital clock synchronization Christian Boulinier and Franck Petit. Self-stabilizing wavelets and ?-hops coordination Cross-over composition -enforcement of fairness under unfair adversary, 27th ACM Symposium on Principles of Distributed Computing 22nd IEEE International Symposium on Parallel and Distributed Processing (IPDPS08)BPBJ01] Joffroy Beauquier, Maria Potop-Butucaru, and Colette Johnen 5th International Workshop on Self-Stabilizing Systems, pp.385-394, 2001.

[. Beauquier, M. Potop-butucaru, C. Johnen, J. Blin, M. Potop-butucaru et al., Token-Based Self-Stabilizing Uniform Algorithms, 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems Franck Petit, and Vincent Villain 23rd ACM Symposium on Principles of Distributed Computing Franck Petit, and Vincent Villain. Synchronous vs. asynchronous unison 7th International Symposium on Self- Stabilizing Systems (SSS 2005) 8th International Symposium on Stabilization, Safety, and Security of Distributed Systems, pp.899-921, 2002.
DOI : 10.1006/jpdc.2001.1832

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

Z. Collin and S. Dolev, Self-stabilizing depth-first search, Information Processing Letters, vol.49, issue.6, pp.297-301, 1994.
DOI : 10.1016/0020-0190(94)90103-1

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

A. Cournier, S. Dubois, and V. Villain, A snap-stabilizing point-to-point communication protocol in message-switched networks, 2009 IEEE International Symposium on Parallel & Distributed Processing, pp.1-11, 2009.
DOI : 10.1109/IPDPS.2009.5160997

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

J. Couvreur, N. Francez, M. G. Gouda-gen-huey-chen, M. E. Houle, and M. Kuo, Asynchronous unison (extended abstract) The steiner problem in distributed computing systems, 12th International Conference on Distributed Computing Systems (ICDCS 1992), pp.486-493, 1992.

[. Chaudhuri, M. J. Kosa, and J. L. Welch, One-write algorithms for multivalued regular and atomic registers, Acta Informatica, vol.37, issue.3, pp.161-192, 2000.
DOI : 10.1007/s002360000040

[. Chandy and L. Lamport, Distributed snapshots: determining global states of distributed systems, ACM Transactions on Computer Systems, vol.3, issue.1, pp.63-75, 1985.
DOI : 10.1145/214451.214456

M. Choy and A. K. Singh, Localizing failures in distributed synchronization, IEEE Transactions on Parallel and Distributed Systems, vol.7, issue.7, pp.705-716, 1996.
DOI : 10.1109/71.508250

[. Chandra and S. Toueg, Unreliable failure detectors for reliable distributed systems, Journal of the ACM, vol.43, issue.2, pp.225-267, 1996.
DOI : 10.1145/226643.226647

A. Daliot and D. Dolev, Self-stabilization of Byzantine Protocols, 7th International Symposium on Self-Stabilizing Systems (SSS 2005), pp.48-67, 2005.
DOI : 10.1007/11577327_4

A. Daliot and D. Dolev, Self-stabilizing byzantine agreement, Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing , PODC '06, pp.143-152, 2006.
DOI : 10.1145/1146381.1146405

URL : http://arxiv.org/abs/0908.0160

S. Delaët, S. Devismes, M. Nesterenko, and S. Tixeuil, Snap-stabilization in message-passing systems, Journal of Parallel and Distributed Computing, vol.70, issue.12, pp.1220-1230, 2010.
DOI : 10.1016/j.jpdc.2010.04.002

[. Dolev, S. Dubois, M. Potop-butucaru, and S. Tixeuil, Communication optimalement stabilisante sur canaux non fiables et non fifo, 13èmes Rencontres Francophones sur les Aspects Algorithmiques de Télécommunications, p.246, 2011.
URL : https://hal.archives-ouvertes.fr/inria-00587089

[. Dolev, S. Dubois, M. Potop-butucaru, and S. Tixeuil, Stabilizing data-link over non-FIFO channels with optimal fault-resilience, Information Processing Letters, vol.111, issue.18, pp.912-920, 2011.
DOI : 10.1016/j.ipl.2011.06.010

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

S. Delaët, B. Ducourthial, and S. Tixeuil, Self-Stabilization with r-Operators revisited, Journal of Aerospace Computing, Information, and Communication, vol.3, issue.10, pp.498-514, 2006.
DOI : 10.2514/1.19848

C. Delporte-gallet, S. Devismes, and H. Fauconnier, Stabilizing leader election in partial synchronous systems with crash failures, Journal of Parallel and Distributed Computing, vol.70, issue.1, pp.45-58, 2010.
DOI : 10.1016/j.jpdc.2009.09.004

A. Dasgupta, S. Ghosh, and X. Xiao, Fault containment in weakly stabilizing systems, Theoretical Computer Science, vol.412, issue.33, pp.4297-4311, 2011.
DOI : 10.1016/j.tcs.2011.02.039

S. Dolev and T. Herman, SuperStabilizing protocols for dynamic distributed systems, Proceedings of the fourteenth annual ACM symposium on Principles of distributed computing , PODC '95, p.61, 1997.
DOI : 10.1145/224964.224993

S. Dolev and T. Herman, Dijkstra???s Self-Stabilizing Algorithm in Unsupportive Environments, 5th International Workshop on Self- Stabilizing Systems, pp.67-81, 2001.
DOI : 10.1007/3-540-45438-1_5

D. Dolev and E. N. Hoch, On self-stabilizing synchronous actions despite byzantine attacks Optimal randomized self-stabilizing mutual exclusion in synchronous rings, 21st International Symposium on Distributed Computing Philippe Duchon, Nicolas Hanusse, and Sébastien Tixeuil 18th Symposium on Distributed Computing, pp.193-207, 2004.

W. Edsger and . Dijkstra, A short introduction to the art of programming. circulated privately, p.164, 1971.

W. Edsger and . Dijkstra, Self-stabilizing systems in spite of distributed control, Communication of ACM, vol.17, issue.242, pp.643-644, 1974.

S. Dolev, A. Israeli, and S. Moran, Self-stabilization of dynamic systems assuming only read/write atomicity, 9th Annual ACM Symposium on Principles of Distributed Computing, pp.103-117, 1990.
DOI : 10.1007/BF02278851

S. Dolev, A. Israeli, and S. Moran, Self-stabilization of dynamic systems assuming only read/write atomicity, Distributed Computing, pp.3-16, 1993.
DOI : 10.1007/BF02278851

S. Dolev, A. Israeli, S. Dolev, A. Israeli, and S. Moran, Resource bounds for self-stabilizing message-driven protocols Uniform dynamic self-stabilizing leader election, SIAM Journal on Computing IEEE Transactions on Parallel and Distributed Systems, vol.26, issue.80, pp.273-290, 1997.

K. Ajoy, C. Datta, F. Johnen, V. Petit, and . Villain, Self-stabilizing depth-first token circulation in arbitrary rooted networks . Distributed Computing When consensus meets self-stabilization, Journal of Computer and System Sciences, vol.13, issue.548, pp.207-218, 2000.

[. Dubois, T. Masuzawa, and S. Tixeuil, The impact of topology on byzantine containment in stabilization On byzantine containment properties of the min+1 protocol Autostabilisation et confinement de fautes malicieuses : Optimalité du protocole min+1, 12èmes Rencontres Francophones sur les Aspects Algorithmiques de Télécommunications 24th International Symposium on Distributed Computing (DISC 2010) 12th International Symposium on Stabilization, Safety, and Security of Distributed SystemsDMT11a] Swan Dubois, Toshimitsu Masuzawa, and Sébastien Tixeuil 13èmes Rencontres Francophones sur les Aspects Algorithmiques de Télécommunications Toshimitsu Masuzawa, and Sébastien Tixeuil. Bounding the impact of unbounded attacks in stabilization. IEEE Transactions on Parallel and Distributed SystemsDMT11c] Swan Dubois, Toshimitsu Masuzawa, and Sébastien Tixeuil. Maximum metric spanning tree made byzantine tolerant 25th International Symposium on Distributed Computing, pp.251-251, 2010.

[. Danturi, M. Nesterenko, and S. Tixeuil, Selfstabilizing philosophers with generic conflicts, ACM Transactions of Adaptive and Autonomous Systems, vol.4, issue.53, pp.30-54, 2009.
URL : https://hal.archives-ouvertes.fr/hal-01151770

S. Dolev, Possible and impossible self-stabilizing digital clock synchronization in general graphs. Real-Time Systems, pp.95-107, 1997.

S. Dolev, Self Stabilization, Journal of Aerospace Computing, Information, and Communication, vol.1, issue.6, p.80, 2000.
DOI : 10.2514/1.10141

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

[. Dubois, M. Potop-butucaru, M. Nesterenko, and S. Tixeuil, Self-stabilizing byzantine asynchronous unison, 14th International Conference On Principles Of DIstributed Systems, pp.125-248, 2010.
DOI : 10.1016/j.jpdc.2012.04.001

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

K. Ajoy, M. Datta, S. Potop-butucaru, and . Tixeuil, Selfstabilizing mutual exclusion using unfair distributed scheduler, 14th IEEE International Parallel and Distributed Processing SYmposium, pp.465-470, 2000.

K. Ajoy, M. Datta, S. Potop-butucaru, and . Tixeuil, Selfstabilizing mutual exclusion with arbitrary scheduler Brief announcement: Dynamic FTSS in Asynchronous Systems: the Case of Unison, DPBT09] Swan Dubois, Maria Potop-Butucaru, and Sébastien Tixeuil 23rd International Symposium on Distributed Computing, pp.289-298, 2004.

[. Dubois, M. Potop-butucaru, and S. Tixeuil, Dynamic FTSS in asynchronous systems: The case of unison, Theoretical Computer Science, vol.412, issue.29, pp.3418-3439, 2011.
DOI : 10.1016/j.tcs.2011.02.012

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

S. Devismes, F. Petit, and V. Villain, Autour de l'auto-stabilisation. partie i : Techniques généralisant l'approche, Technique et Science Informatiques, vol.30, pp.1-22, 2011.

S. Devismes, F. Petit, and V. Villain, Autour de l'auto-stabilisation. partie ii : Techniques spécialisant l'approche, Technique et Science Informatiques, vol.30, pp.23-50, 2011.

D. Dolev and N. Shavit, Bounded Concurrent Time-Stamping, SIAM Journal on Computing, vol.26, issue.2, pp.418-455, 1997.
DOI : 10.1137/S0097539790192647

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

[. Ducourthial and S. Tixeuil, Self-stabilization with r-operators. Distributed Computing [DT03] Bertrand Ducourthial and Sébastien Tixeuil. Self-stabilization with path algebra, Theoretical Computer Science, vol.14, issue.2931, pp.147-162, 2001.
DOI : 10.1007/pl00008934

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

S. Dolev and N. Tzachar, Empire of colonies: Self-stabilizing and self-organizing distributed algorithms Weak vs. self vs. probabilistic stabilization, 10th International Conference on Principles of Distributed SystemsDTY08] Stéphane Devismes, Sébastien Tixeuil, and Masafumi Yamashita 28th IEEE International Conference on Distributed Computing Systems, pp.230-243, 2006.

S. Dolev and J. L. Welch, Self-stabilizing clock synchronization in the presence of byzantine faults (abstract), 14th Annual ACM Symposium on Principles of Distributed Computing, pp.256-244, 1995.

S. Dolev and J. L. Welch, Wait-Free Clock Synchronization, Algorithmica, vol.18, issue.4, pp.486-511, 1997.
DOI : 10.1007/PL00009167

S. Dolev and J. L. Welch, Self-stabilizing clock synchronization in the presence of Byzantine faults, Journal of the ACM, vol.51, issue.5, pp.780-799, 2004.
DOI : 10.1145/1017460.1017463

P. Erdös, On a problem in graph theory. The Mathematical Gazette, pp.47220-223, 1963.

M. J. Fischer, N. A. Lynch, and M. Paterson, Impossibility of distributed consensus with one faulty process, Journal of the ACM, vol.32, issue.2, pp.374-382, 1985.
DOI : 10.1145/3149.214121

[. Fribourg, S. Messika, and C. Picaronny, Coupling and self-stabilization, Distributed Computing, vol.25, issue.2, pp.221-232, 2006.
DOI : 10.1007/s00446-005-0142-7

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

M. Fürer and B. Raghavachari, Approximating the minimum degree spanning tree to within one from the optimal degree, 3rd Annual ACM/SIGACT-SIAM Symposium on Discrete Algorithms, pp.317-324, 1992.

C. Felix and . Gärtner, A survey of self-stabilizing spanning-tree construction algorithms, pp.60-249, 2003.

M. Gairing, W. Goddard, S. T. Hedetniemi, P. Kristiansen, A. A. Mcrae-]-sukumar-ghosh et al., Distance-two information in selfstabilizing algorithms Fault-containing self-stabilizing algorithms, 15th ACM Symposium on Principles of Distributed ComputingGGHP07] Sukumar Ghosh, Arobinda Gupta, Ted Herman, and Sriram V. Pemmaraju . Fault-containing self-stabilizing distributed protocols. Distributed Computing, pp.3-4387, 1996.

G. Mohamed, T. Gouda, and . Herman, Stabilizing unison, Information Processing Letters, vol.35, issue.122, pp.171-175, 1990.

G. Mohamed, F. Gouda, . Furman, and . Haddix, The linear alternator, 3rd Workshop on Self-stabilizing Systems (WSS 1997), pp.31-47, 1997.

G. Mohamed, F. Gouda, . Furman, and . Haddix, The alternator. Distributed Computing, pp.21-28, 2007.

W. Goddard, S. T. Hedetniemi, D. P. Jacobs, and V. Trevisan, Distance- k knowledge in self-stabilizing algorithms, Theoretical Computer Science, vol.399, issue.1-2, pp.118-127, 2008.
DOI : 10.1016/j.tcs.2008.02.009

R. G. Gallager, P. A. Humblet, and P. M. Spira, A Distributed Algorithm for Minimum-Weight Spanning Trees, ACM Transactions on Programming Languages and Systems, vol.5, issue.1, pp.66-77, 1983.
DOI : 10.1145/357195.357200

H. Guellati and . Kheddouci, A survey on self-stabilizing algorithms for independence, domination, coloring, and matching in graphs, Journal of Parallel and Distributed Computing, vol.70, issue.4, pp.406-415, 2010.
DOI : 10.1016/j.jpdc.2009.11.006

[. Gawlick, N. A. Lynch, and N. Shavit, Concurrent Timestamping made simple, International Symposium on Theory of Computing and Systems (ISTCS 1992), pp.171-183, 1992.
DOI : 10.1007/BFb0035176

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

G. Mohamed, N. J. Gouda, and . Multari, Stabilizing communication protocols, IEEE Transactions on Computers, vol.40, issue.4, pp.448-458, 1991.

M. G. Gouda, The Theory of Weak Stabilization, 5th International Workshop on Self-Stabilizing Systems, pp.114-123, 2001.
DOI : 10.1007/3-540-45438-1_8

S. Ajei, K. J. Gopal, and . Perry, Unifying self-stabilization and fault-tolerance (preliminary version), 12th Annual ACM Symposium on Principles of Distributed Computing (PODC 1993), pp.195-206, 1993.

[. Guerraoui and L. Rodrigues, Introduction to Reliable Distributed Programming, p.18, 2006.

J. [. Graham and . Spencer, A constructive solution to a tournament problem, Bulletin canadien de math??matiques, vol.14, issue.0, pp.45-48, 1971.
DOI : 10.4153/CMB-1971-007-1

G. Mohamed, M. Gouda, and . Schneider, Maximum flow routing, Joint Conference on Information Sciences, p.164, 1994.

G. Mohamed, M. Gouda, and . Schneider, Stabilization of maximal metric trees, ICDCS Workshop on Self-stabilizing Systems (WSS 1999), pp.10-17, 0201.

G. Mohamed, M. Gouda, and . Schneider, Maximizable routing metrics, IEEE/ACM Transactions on Networks, vol.11, issue.169, pp.663-675, 2003.

. Shing-tsaan, N. Huang, and . Chen, A self-stabilizing algorithm for constructing breadth-first trees, Information Processing Letters, vol.41, issue.165, pp.109-117, 1992.

E. N. Hoch, D. Dolev, and A. Daliot, Self-stabilizing Byzantine Digital Clock Synchronization, 8th International Symposium on Stabilization, Safety, and Security of Distributed Systems, pp.350-362, 2006.
DOI : 10.1007/978-3-540-49823-0_25

T. Herman, Probabilistic self-stabilization, Information Processing Letters, vol.35, issue.2, pp.63-67, 1990.
DOI : 10.1016/0020-0190(90)90107-9

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

T. Herman, A comprehensive bibliography on self-stabilization, p.59, 2002.

T. Herman and S. Ghosh, Stabilizing phase-clocks, Information Processing Letters, vol.54, issue.5, pp.259-265, 1995.
DOI : 10.1016/0020-0190(95)00050-M

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

. Shing-tsaan, T. Huang, and . Liu, Four-state stabilizing phase clock for unidirectional rings of odd size, Information Processing Letters, vol.65, issue.6, pp.325-329, 1998.
DOI : 10.1016/S0020-0190(98)00006-4

C. Tetz, J. Huang, and . Lin, A self-stabilizing algorithm for the shortest path problem in a distributed system, Computers and Mathematics with Applications, vol.43, issue.12, pp.103-109, 2002.

C. Tetz, J. Huang, C. Lin, C. Chen, and . Wang, The worst-case stabilization time of a self-stabilizing algorithm under the weakly fair daemon model, International Journal of Artificial Life Research, vol.1, issue.3, pp.45-52, 2010.

M. Herlihy, V. Luchangco, and M. Moir, Obstructionfree synchronization: Double-ended queues as an example, 23rd International Conference on Distributed Computing Systems (ICDCS 2003), pp.522-529, 2003.

R. R. Howell, M. Nesterenko, and M. Mizuno, Finitestate self-stabilizing protocols in message-passing systems Jaap-Henk Hoepman, Marina Papatriantafilou, and Philippas Tsigas. Self-stabilization of wait-free shared memory objects, ICDCS Workshop on Self-stabilizing Systems, pp.62-69, 1999.

[. Haldar and K. Vidyasankar, Constructing 1-writer multireader multivalued atomic variables from regular variables, Journal of the ACM, vol.42, issue.1, pp.186-203, 1995.
DOI : 10.1145/200836.200871

. Shing-tsaan, L. Huang, and . Wuu, Self-stabilizing token circulation in uniform networks, Distributed Computing, vol.10, issue.4, pp.181-187, 1997.

A. Israeli and M. Li, Bounded time-stamps, Distributed Computing, vol.49, issue.1, pp.205-209, 1993.
DOI : 10.1007/BF02242708

A. Israeli and A. Shaham, Optimal multi-writer multi-reader atomic register, Proceedings of the eleventh annual ACM symposium on Principles of distributed computing , PODC '92, pp.71-82, 1992.
DOI : 10.1145/135419.135435

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

C. Johnen, L. Alima, A. K. Datta, and S. Tixeuil, OPTIMAL SNAP-STABILIZING NEIGHBORHOOD SYNCHRONIZER IN TREE NETWORKS, Parallel Processing Letters, vol.12, issue.03n04, pp.327-340, 2002.
DOI : 10.1142/S0129626402001026

C. Johnen and L. Higham, Fault-Tolerant Implementations of Regular Registers by Safe Registers with Applications to Networks, 10th International Conference on Distributed Computing and Networking, pp.337-348, 2009.
DOI : 10.1145/234533.234556

C. Johnen and S. Tixeuil, Route Preserving Stabilization, 6th International Symposium on Self-Stabilizing Systems (SSS 2003), pp.184-198, 2003.
DOI : 10.1007/3-540-45032-7_14

S. Sandeep, A. Kulkarni, S. Arora-sandeep, M. Kulkarni, and . Arumugam, Multitolerance in distributed reset Transformations for write-all-with-collision model, Kar01] Mehmet Hakan Karaata. Self-stabilizing strong fairness under weak fairness, pp.19183-199, 1998.

[. Karaata, An optimal self-stabilizing strarvation-free alternator, KC98] Mehmet Hakan Karaata and Pranay Chaudhuri. A self-stabilizing algorithm for strong fairness. Computing, pp.480-494, 1998.
DOI : 10.1016/j.jcss.2005.05.001

. Jr and J. B. Kruskal, On the shortest spanning subtree of a graph and the traveling salesman problem Uniform and selfstabilizing token rings allowing unfair daemon Uniform and selfstabilizing fair mutual exclusion on unidirectional rings under unfair distributed daemon, Proceedings of the American Mathematical Society IEEE Transactions on Parallel and Distributed Systems Journal of Parallel and Distributed Computing, vol.7, issue.30, pp.48-50, 1956.

L. Lamport, A new solution of Dijkstra's concurrent programming problem, Communications of the ACM, vol.17, issue.8, pp.453-455, 1974.
DOI : 10.1145/361082.361093

L. Lamport, On interprocess communication. part i: Basic formalism . Distributed Computing, pp.77-85, 1986.
DOI : 10.1007/bf01786227

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

L. Liu, S. Legtchenko, S. Monnet, P. Sens, and G. Muller, Phase synchronization on asynchronous uniform rings with odd size Churn-resilient replication strategy for peer-to-peer distributed hashtables Possibility and impossibility results for self-stabilizing binary clocks on synchronous rings, On interprocess communication. part ii: Algorithms. Distributed Computing IEEE Transactions on Parallel and Distributed Syst.ems 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems 2nd International Workshop on Self-Stabilizing Systems, pp.86-101, 1986.

J. Misra, Byzantine quorum systems Toshimitsu Masuzawa and Sébastien Tixeuil. Stabilizing linkcoloration of arbitrary networks with unbounded byzantine faults Tolerance to unbounded byzantine faults, Phase synchronization. Information Processing Letters 21st Symposium on Reliable Distributed Systems, pp.101-105, 1991.

A. Oram and . Peer-to-peer, Harnessing the Power of Disruptive Technologies Self-stabilizing vertex coloring of arbitrary graphs Conflict managers for self-stabilization without fairness assumption, PBT00] Maria Potop-Butucaru and Sébastien Tixeuil 4th International Conference on Principles of Distributed Systems 27th IEEE International Conference on Distributed Computing Systems, pp.55-70, 2000.

C. Robert and . Prim, On self-stabilizing wait-free clock synchronization [PV07] Franck Petit and Vincent Villain. Optimal snap-stabilizing depth-first token circulation in tree networks, Shortest connection networks and some generalizationsPT97] Marina Papatriantafilou and Philippas Tsigas, pp.1389-1401, 1957.

M. Raynal, Communication and Agreement Abstractions for Fault-Tolerant Asynchronous Distributed Systems, Synthesis Lectures on Distributed Computing Theory, vol.1, issue.1, p.18, 2000.
DOI : 10.2200/S00236ED1V01Y201004DCT002

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

M. Raynal, Fault-Tolerant Agreement in Synchronous Distributed Systems, p.18, 2010.

M. Raynal and J. Hélary, Synchronization and control of distributed systems and programs. Wiley series in parallel computing, p.120, 1990.

S. Rovedakis, Algorithmes auto-stabilisants de constructions d'arbres couvrants, p.165, 2009.

M. Sakurai, F. Ooshita, and T. Masuzawa, A selfstabilizing link-coloring protocol resilient to byzantine faults in tree networks On a problem of schütte and erdös. The Mathematical Gazette, Flow Routing in Computer Networks 8th International Conference on Principles of Distributed Systems (OPODIS 2005)SS65] Esther Szekeres and George Szekeres, pp.165-283, 1965.

G. Tel, M. Tsai, and S. Huang, Introduction to distributed algorithms A self-stabilizing algorith for the shortest paths problem with a fully distributed demon, Parallel Processing LettersTix09] Sébastien Tixeuil. Algorithms and Theory of Computation Handbook, Second Edition, chapter Self-stabilizing Algorithms, pp.5965-72, 1994.

&. Chapman, /. Hall, and . Crc, Applied Algorithms and Data Structures, pp.60-244, 2009.

J. R. and R. Tolkien, The Hobbit, or There and Back Again, p.239, 1937.

J. R. and R. Tolkien, The Fellowship of the Ring, p.239, 1954.

J. R. and R. Tolkien, The Two Towers, p.239, 1954.

J. R. and R. Tolkien, The Return of the King, p.239, 1955.

M. B. Paul, B. Vitányi, and . Awerbuch, Atomic shared register access by asynchronous hardware (detailed abstract), 27th Annual Symposium on Foundations of Computer Science (FOCS 1986), pp.233-243, 1986.

G. Varghese, Self-Stabilization by Counter Flushing, SIAM Journal on Computing, vol.30, issue.2, pp.486-510, 2000.
DOI : 10.1137/S009753979732760X

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