. Une-faiblesse-de-cette-partie-est-le-modèle, Il serait très intéressant de posséder un unisson performant dans le modèlè a passage de messages ; ce qui permettrait, entre autre, de construire un transformateur passant directement des modèlesmodèlesàmodèlesàétat où a réécriturè a distance ? au modèlè a passage de messages

. Dans-ce-qui-suit and . Est-un-majorant-du-diamètre, Pour faire dispara??tredispara??tre les racines fantômes, on considère unedeuxì eme variable, qui représente la distance estimée de la racine au processus. Si cette distance est supérieurè a D, c'est que la racine est une racine fantôme, alors le processus l'´ elimine

. Si-une-forme, pattern) est reconnue (filtrée), alors l'action associée est exécutée Si plusieurs formes sont reconnues, alors seulement lapremì ere de la liste de filtrage est exécutée. Si aucune forme n'est filtrée, alors aucune action n'est exécutée

L. Racine, voir Syntaxe 22), qui correspondàcorrespondà l'´ evaluation d'une expression conditionnelle qui estévaluéeestévaluée juste après que la forme soit reconnue. Si l'´ evaluation retourne vrai, alors l'action associée est effectuée, sinon le filtrage 1. Si un processus n'est pas correct, il prend la couleur E (Erreur), On peut ajouteràajouterà chaque forme une garde (guard

C. Une-fois-qu-'une-feuille-a-la-couleur, C. Et-que-son-p-`-ere-estàestà, and F. La-feuille-prend-la-couleur, Fin de Correction) et met le registre de son horlogè a 0. La fin de correction descend vers la racine : un processus prend la couleur F C et met son registre d'unisonàunisonà 0 si et seulement si ses fils

C. Une-fois-que-la-racine and F. C. Est-entourée-de-filsàfilsà-la-couleur, Repos) ; alors l'unisson peut redémarrer. Un processus prend la couleur R quand son p` ere estàestà la couleur R

. Le-cas-d, un processus qui n'est pas la racine Cet algorithme comporte des incompatibilités de coloration, la table A.1 présente ces incompatibilités et les r` egles de misè a la couleur E associées (r` egles (EI)). Les r` egles (E1), E2) et (E3)

. Chaque-fois-qu, ce processus prendra la couleur E par une action notée (EI) Cette couleur est invasive, sauf par rapportà rapportà la couleur C lors de la remontée dans l'arbre, action (A1) Les actions de propagation de la couleur E sont les actions (E1) La couleur C ne peutêtrepeutêtre détruite qu'` a la redescente de la couleur F C, c'est l'action (A2) Une fois que la couleur F C est redescenduè a la racine, la couleur R remonte aux feuilles, c'est l'action (A3) qui en même temps met le registre r ` a 0, E3), et Nous allons voir que ces r` egles suffisentàsuffisentà auto-stabiliser notre algorithme

|. Est-un-ordre-sur and N. , mais seulement un préordre sur Z (la relation n'est pas antisymétrique sur Z)

?. Soit-(-r and A. Et, -1 est un minorant de A et 2 est un majorant de A. 0 est un minorant de A, mais 1 n'est pas un

. Dans, R 2 muni de l'ordre lexicographique

B. Afek, E. Awerbuch, and . Gafni, un plus grandélémentgrandélément ou d'un plus petitélémentpetitélément, mais si la relation de préordre définit un ordre sur E alors il y a uncité du plus grandélémentgrandélément, s'il existe et du plus petitélémentpetitélément s'il existe Définition 82 Soit (E, ?) un ensemble ordonné, et A une partie de E. ? Si A possède un majorant M ? A, M est unique : c'est le plus grandélémentgrandélément de Applying static network protocols to dynamic networks, Proceedings of the 28th Annual IEEE Symposium on Foundations of Computer Science, pp.358-370, 1987.

J. [. Alima, A. K. Beauquier, S. Datta, and . Tixeuil, Self-stabilization with global rooted synchronizers, Proceedings. 18th International Conference on Distributed Computing Systems (Cat. No.98CB36183), pp.102-109, 1998.
DOI : 10.1109/ICDCS.1998.679492
URL : https://hal.archives-ouvertes.fr/hal-00631710

[. Aguilera, W. Chen, and S. Toueg, On Quiescent Reliable Communication, SIAM Journal on Computing, vol.29, issue.6, pp.2040-2073, 2000.
DOI : 10.1137/S0097539798341296

[. Arora, M. Dolev, and . Gouda, MAINTAINING DIGITAL CLOCKS IN STEP, Parallel Processing Letters, vol.01, issue.01, pp.11-18, 1991.
DOI : 10.1142/S0129626491000161

[. Awerbuch and R. Gallager, Distributed BFS algorithms, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985), pp.250-256, 1985.
DOI : 10.1109/SFCS.1985.20

[. Awerbuch and R. Gallager, A new distributed algorithm to find breadth first search trees, IEEE Transactions on Information Theory, vol.33, issue.3, pp.315-322, 1987.
DOI : 10.1109/TIT.1987.1057314

[. Arora and M. Gouda, Distributed reset, IEEE Transactions on Computers, vol.43, issue.9, pp.1026-1038, 1994.
DOI : 10.1109/12.312126

[. Awerbuch, A. Goldberg, S. Luby, and . Plotkin, Network decomposition and locality in distributed computation, 30th Annual Symposium on Foundations of Computer Science, pp.364-369, 1989.
DOI : 10.1109/SFCS.1989.63504

S. [. Aggarwal and . Kutten, Time optimal self-stabilizing spanning tree algorithms, Proceedings of the 13th Conference on Foundations of Software Technology and Theoretical Computer Science, 1993.
DOI : 10.1007/3-540-57529-4_72
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.14.5742

. Awerbuch, Y. Kutten, . Mansour, G. Patt-shamir, and . Varghese, Time optimal self-stabilizing synchronization, Proceedings of the twenty-fifth annual ACM symposium on Theory of computing , STOC '93, pp.652-661, 1993.
DOI : 10.1145/167088.167256

[. Afek, M. Kutten, and . Yung, Memory-efficient self stabilizing protocols for general networks, WDAG90 Distributed Algorithms 4th International Workshop Proceedings, pp.15-28, 1990.
DOI : 10.1007/3-540-54099-7_2

[. Awerbuch and D. Peleg, Network synchronization with polylogarithmic overhead, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science, pp.514-522, 1990.
DOI : 10.1109/FSCS.1990.89572
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.55.7921

[. Awerbuch, G. Patt-shamir, and . Varghese, Self-stabilization by local checking and correction, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science, pp.268-277, 1991.
DOI : 10.1109/SFCS.1991.185378
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.211.8704

B. [. Awerbuch, G. Patt-shamir, and . Varghese, Bounding the unbounded (extended abstract), Proceeding 13th IEEE INFOCOM, pp.773-783, 1994.

J. Aspnes, Randomized protocols for asynchronous consensus, Distributed Computing, vol.16, issue.2-3, pp.165-175, 2003.
DOI : 10.1007/s00446-002-0081-5
URL : http://arxiv.org/abs/cs/0209014

A. Aumage, Madeleine : une interface de communication performante et portable pour exploiter les interconnexions hétérogènes de grappes Thèse de doctorat, spécialité informatique, ´ Ecole normale supérieure de Lyon, 154 pages. [Awe85] B. Awerbuch. Complexity of network synchronization. Journal of the Association of the Computing Machinery, pp.804-823, 1985.

A. Awerbuch, Distributed shortest paths algorithms, 21st Annual ACM Symposium on Theory of Computing (STOC '89), pp.490-500, 1989.
DOI : 10.1145/73007.73054

A. Awerbuch, Shortest paths and loop-free routing in dynamic networks, Proceedings of the Annual ACM SIGCOMM Symposium on Communication Architectures and Protocols, 1990.
DOI : 10.1145/99517.99550

[. Boulinier, . Cantarell, V. Petit, and . Villain, A note on a selfstabilizing local mutual exclusion algorithm, 2003.

[. Beauquier, A. K. Datta, F. Gradinariu, and . Magniette, Self-Stabilizing Local Mutual Exclusion and Daemon Refinement, Proceedings of the 14th International Conference on Distributed Computing, pp.223-237, 1914.
DOI : 10.1007/3-540-40026-5_15
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.2.9306

[. Bui, . Datta, V. Petit, and . Villain, State-optimal snap-stabilizing PIF in tree networks, Proceedings 19th IEEE International Conference on Distributed Computing Systems, pp.78-85, 1999.
DOI : 10.1109/SLFSTB.1999.777490

[. Bellman, On a routing problem, Quarterly of Applied Mathematics, vol.16, issue.1, pp.87-90, 1958.
DOI : 10.1090/qam/102435

[. Berge, Färbung von graphen, deren sämtliche bzw. deren ungeraden kreise satrr sind (zusammenfassung) Wiss. Z. Marin Luther Univ, Ber83] C Berge. Graphes. Gauthier-Villars (Paris), 1983. [Bie91] D. Bienstock. On complexity of testing for odd holes and induced odd paths. Discrete Mathematics, pp.114-11585, 1961.

J. Luis-borges, C. Boulinier, V. Petit, [. Villain, . Boulinier et al., When graph theory helps selfstabilization Synchronous vs. asynchronous unison Toward a time-optimal odd phase clock unison in trees Self-stabilizing universal algorithms, Oeuvrescompì etes. Gallimard asynchronous anonymous networks PODC '04 : Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing 7th Symposium on Self-Stabilizing Systems (SSS'05) Eighth International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS'06) Proceedings of the Third Workshop on Self-Stabilizing SystemsCan03] S Cantarell. Group Mutual Exclusion and Self-StabilizationCDP03] S Cantarell, AK Datta, and F Petit. Self-stabilizing atomicity refinement allowing neighborhood concurrency, pp.150-159, 1947.

[. Cournier, . Datta, V. Petit, and . Villain, Snap-stabilizing PIF algorithm in arbitrary networks On finding a cycle basis with a shortest maximal cycle, Workshop : 6th Symposium on Self-Stabilizing Systems IEEE 22nd International Conference on Distributed Computing Systems (ICDCS 02)CFG92] JM Couvreur, N Francez, and M Gouda. Asynchronous unison Proceedings of the 12th IEEE International Conference on Distributed Computing Systems (ICDCS'92)CGH95] DM Chickering, D Geiger, and D Heckerman, pp.102-112, 1992.

H. [. Chang and . Keisler, Model theory, 1973.

F. [. Courtois, D. L. Heymans, and . Parnas, Concurrent control with readers and writers. Communications of the Association of the Computing Machinery, pp.667-668, 1971.
DOI : 10.1145/362759.362813

[. Chandra, V. Hadzilacos, and S. Toueg, The weakest failure detector for solving consensus, Proceedings of the 11th Annual ACM Symposium on Principles of Distributed Computing (PODC'92), pp.147-158, 1992.

[. Cheng, . Riley, J. Kumar, and . Garcia-luna-aceves, A loop-free extended bellman-ford routing protocol without bouncing effect, Proceedings of the Annual ACM SIGCOMM Symposium on Communication Architectures and Protocols, pp.224-236, 1989.
DOI : 10.1145/75247.75269

[. Chudnovski, . Robertson, R. Seymour, and . Thomas, The strong perfect graph theorem, Annals of Mathematics, vol.164, issue.1, 2005.
DOI : 10.4007/annals.2006.164.51

[. Chandra and S. Toueg, Unreliable failure detectors for asynchronous systems, Proceedings of the 10th Annual ACM Symposium on Principles of Distributed Computing (PODC'91), pp.325-340, 1991.
DOI : 10.1145/112600.112627

[. 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
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.113.498

S. Delaet, B. Ducourthial, and S. Tixeui, Self-stabilization with r-operators in unreliable directed networks, 2003.

]. R. Des37 and . Descartes, Discours de la méthode. Par l'imprimeur Ian Maire, p.1637

H. [. Delporte-gallet and . Fauconnier, Synchronized phase systems, 1998.

C. Delporte, -. Gallet, and H. Fauconnier, Real-time fault-tolerant atomic broadcast, Proceedings of the 18th IEEE Symposium on Reliable Distributed Systems, pp.48-55, 1999.
DOI : 10.1109/RELDIS.1999.805082

. [. Dolev, M. Gouda, and . Schneider, Memory requirements for silent stabilization, pp.27-34, 1996.
DOI : 10.1007/s002360050180
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.388.6681

]. E. Dij65 and . Dijkstra, Solution to a problem in concurrent programming control, Communications of the Association of the Computing Machinery, p.569, 1965.

[. Dijkstra, Cooperating Sequential Processes, 1968.
DOI : 10.1007/978-1-4757-3472-0_2

[. Dijkstra, Self-stabilizing systems in spite of distributed control, Communications of the Association of the Computing Machinery, pp.643-644, 1974.
DOI : 10.1145/361179.361202

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

[. Dolev, S. Israeli, and . Moran, Uniform dynamic self-stabilizing leader election, IEEE Transactions on Parallel and Distributed Systems, vol.8, issue.4, pp.424-440, 1997.
DOI : 10.1109/71.588622
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.124.7453

[. Dwork, N. Lynch, and L. Stockmeyer, Consensus in the presence of partial synchrony, Journal of the ACM, vol.35, issue.2, pp.288-323, 1988.
DOI : 10.1145/42282.42283

[. Danturi and . Nesterenko, Self-stabilizing philosophers with generic conflicts, 8th International Symposium on Stabilizing, Safety, and Security of Distributed Systems (SSS'06), 2006.
DOI : 10.1007/978-3-540-49823-0_15
URL : https://hal.archives-ouvertes.fr/hal-01151770

[. Dolev, Self Stabilization, Journal of Aerospace Computing, Information, and Communication, vol.1, issue.6, 2000.
DOI : 10.2514/1.10141
URL : https://hal.archives-ouvertes.fr/inria-00627780

S. [. Ducourthial and . Tixeuil, Self-stabilization with r-operators. Distributed Computing, pp.147-162, 2001.
DOI : 10.1007/pl00008934
URL : https://hal.archives-ouvertes.fr/hal-00632303

]. B. Duc98 and . Ducourthial, New operators for computing with associative nets, The 5th International Colloquium On Structural Information and Communication Complexity Proceedings (SIROCCO'98), pp.51-65, 1998.

[. Finn, Resynch Procedures and a Fail-Safe Network Protocol, IEEE Transactions on Communications, vol.27, issue.6, pp.840-845, 1979.
DOI : 10.1109/TCOM.1979.1094473

[. Fischer, N. 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

[. Frometin, About classes of problems in asynchronous distributed systems with process crashes, 2004.

G. Gallager, Distributed minimum hop algorithms, 1982.

[. Ghosh, . Gupta, S. Herman, and . Pemmaraju, Fault-containing selfstabilizing algorithms, Symposium on Principles of Distributed Computing (PODC), pp.45-54, 1996.
DOI : 10.1145/248052.248057
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.54.8314

[. Gouda and T. Herman, Stabilizing unison, Information Processing Letters, vol.35, issue.4, pp.171-175, 1990.
DOI : 10.1016/0020-0190(90)90020-X

S. [. Goddard, D. P. Hedetniemi, V. Jacobs, and . Trevisian, Distance-k Information in Self-stabilizing Algorithms, The 13th International Colloquium On Structural Information and Communication Complexity Proceedings (SIROCCO'06), 2006.
DOI : 10.1007/11780823_27

R. Michael, . Garey, S. David, . Johnson, E. Robert et al., The planar hamiltonian circuit problem is np-complete, SIAM J. Comput, vol.5, pp.704-714, 1976.

N. [. Gouda and . Multari, Stabilizing communication protocols, IEEE Transactions on Computers, vol.40, issue.4, pp.448-458, 1991.
DOI : 10.1109/12.88464

Y. [. Godard and . Métivier, A characterization of classes of graphs recognizable by local computations with initial knowledge, International colloquium on structural information and communication complexity (SI- ROCCO), pp.179-193, 2001.
URL : https://hal.archives-ouvertes.fr/hal-00307372

Y. [. Godard and . Métivier, Equivalence of structural knowledges in distributed algorithms, International Colloquium on Structural Information and Communication Complexity (SIROCCO), pp.149-164, 2002.
URL : https://hal.archives-ouvertes.fr/hal-00307376

Y. Godard, A. Métivier, and . Muscholl, The Power of Local Computations in Graphs with Initial Knowledge, TAGT'98 : Selected papers from the 6th International Workshop on Theory and Application of Graph Transformations, pp.71-84, 2000.
DOI : 10.1007/978-3-540-46464-8_6
URL : https://hal.archives-ouvertes.fr/hal-00307373

Y. [. Godard, A. Métivier, and . Muscholl, Characterizations of Classes of Graphs Recognizable by Local Computations, Theory of Computing Systems, pp.249-293, 2004.
DOI : 10.1007/s00224-003-1062-1
URL : https://hal.archives-ouvertes.fr/hal-00307371

[. Huang and N. Chen, A self-stabilizing algorithm for constructing breadth-first trees, Information Processing Letters, vol.41, issue.2, pp.109-117, 1992.
DOI : 10.1016/0020-0190(92)90264-V

H. Herman, Adaptativity through distributed convergence, 1991.

[. Herman, A phase clock tutorial. Draft, 2001.

[. 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

[. Haddix and M. G. Gouda, A general alternator, IASTED PDCS, pp.409-413, 2005.

. 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

T. [. Huang and . Liu, Phase synchronization on asynchronous uniform rings with odd size, IEEE Transactions on Parallel and Distributed System, pp.638-652, 2001.

A. Itai, C. H. Papadimitriou, and J. L. Szwarcfiter, Hamiltonian paths in grid graphs, SIAM J. Comput, vol.23, pp.676-686, 1982.

C. Johnen, Memory efficient, self-stabilizing algorithm to construct BFS spanning trees, Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing , PODC '97, 1997.
DOI : 10.1145/259380.259508
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.142.1830

[. Joung, Asynchronous group mutual exclusion (extended abstract), Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing , PODC '98, pp.51-60, 1998.
DOI : 10.1145/277697.277706
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.39.7562

[. Joung, Asynchronous group mutual exclusion, Distributed Computing, vol.13, issue.4, pp.189-206, 2000.
DOI : 10.1007/PL00008918
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.30.1747

A. [. Kulkarni and . Arora, Multitolerant barrier synchronization, Information Processing Letters, vol.64, issue.1, pp.29-36, 1997.
DOI : 10.1016/S0020-0190(97)00143-9
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.25.9010

]. S. Ka98a, A. Kulkarni, and . Arora, Low-cost fault-tolerance in barrier synchronizations, ICPP : 27th International Conference on Parallel Processing, 1998.

]. S. Ka98b, A. Kulkarni, and . Arora, Multitolerance in distributed reset, Chicago Journal of Theoretical Computer Science, Special Issue on Self-Stabilization, 1998.

]. E. Kan87 and . Kant, Critique de la raison pure, G.F

M. Rabin and . Karp, Reducibility among combinatorial problems, Complexity of Computer Computations, pp.85-103, 1972.

[. Kondou, T. Masuda, and . Masuzawa, A self-stabilizing protocol for pipelined PIF in tree networks, Proceedings 22nd International Conference on Distributed Computing Systems, pp.181-183, 2002.
DOI : 10.1109/ICDCS.2002.1022255

]. M. Kri75 and . Krishnamoorthy, An np-hard problem in bipartite graphs, pp.1-26, 1975.

[. Kruijer, Self-stabilization (in spite of distributed control) in tree-structured systems, Information Processing Letters, vol.8, issue.2, pp.91-95, 1979.
DOI : 10.1016/0020-0190(79)90151-0

[. Kakugawa and M. Yamashita, Self-stabilizing local mutual exclusion on networks in which process identifiers are not distinct, 21st IEEE Symposium on Reliable Distributed Systems, 2002. Proceedings., pp.202-211, 2002.
DOI : 10.1109/RELDIS.2002.1180189

C. E. Leiserson, Z. S. Abuhamdeh, D. C. Douglas, C. R. Feynman, M. N. Ganmukhi et al., The Network Architecture of the Connection Machine CM-5, Journal of Parallel and Distributed Computing, vol.33, issue.2, pp.145-158, 1996.
DOI : 10.1006/jpdc.1996.0033

]. L. Lam74 and . Lamport, A new solution of Dijkstra's concurrent programming problem, Communications of the ACM, vol.17, issue.8, pp.453-455, 1974.

L. Lamport, The part-time parliament, ACM Transactions on Computer Systems, vol.16, issue.2, pp.133-169, 1998.
DOI : 10.1145/279227.279229

[. Lampson, The ABCD's of Paxos, Proceedings of the twentieth annual ACM symposium on Principles of distributed computing , PODC '01, 2001.
DOI : 10.1145/383962.383969

[. Lovász, A characterization of perfect graphs, Journal of Combinatorial Theory, Series B, vol.13, issue.2, pp.95-98, 1972.
DOI : 10.1016/0095-8956(72)90045-7

[. Lin and J. Simon, Possibility and impossibility results for self-stabilizing phase clocks on synchronous rings, wss95, pp.10-11, 1995.

]. N. Lyn96a and . Lynch, Distributed Algorithms, 1996.

]. N. Lyn96b and . Lynch, Distributed algorithms, 1996.

A. W. Mazurkiewicz, Distributed enumeration, Information Processing Letters, vol.61, issue.5, pp.61233-239, 1997.
DOI : 10.1016/S0020-0190(97)00022-7
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.56.9042

C. Morin, A. Denis, R. Namyst, O. Aumage, and R. Lottiaux, Encyclopédie de l'informatique et des systèmes d'information , chapter Des réseaux de calculateurs aux grilles de calcul, Number, vol.ISBN, pp.2-7117, 2006.

J. Misra, Phase synchronization, Information Processing Letters, vol.38, issue.2, pp.101-105, 1991.
DOI : 10.1016/0020-0190(91)90229-B

[. Nesterenko and A. Arora, Stabilization-Preserving Atomicity Refinement, Journal of Parallel and Distributed Computing, vol.62, issue.5, pp.766-791, 2002.
DOI : 10.1006/jpdc.2001.1828
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.29.5619

[. Nolot, Self-stabilizing phase clock in distributed systems, 2002.

M. Naor and L. Stockmeyer, What can be computed locally ?, STOC '93 : Proceedings of the twenty-fifth annual ACM symposium on Theory of computing, pp.184-193, 1993.
DOI : 10.1137/s0097539793254571
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.28.902

[. Nolot and V. Villain, Universal self-stabilizing phase clock protocol with bounded memory, Conference Proceedings of the 2001 IEEE International Performance, Computing, and Communications Conference (Cat. No.01CH37210), pp.228-235, 2001.
DOI : 10.1109/IPCCC.2001.918656

[. Petit and V. Villain, OPTIMALITY AND SELF-STABILIZATION IN ROOTED TREE NETWORKS, Parallel Processing Letters, vol.15, issue.01, pp.3-14, 2000.
DOI : 10.1145/122120.122123

]. M. Ray90, La communication et le temps dans les réseaux et les systèmes répartis, Eyrolles, 1990.

]. M. Ray92, Synchronisation etétatetétat global dans les systèmes répartis, Eyrolles, 1992.

J. [. Raynal and . Helary, Synchronisation et contrôle des systèmes et programmes répartis, Eyrolles, 1988.

J. [. Raynal and . Helary, Synchronization and control of distributed Systems and programs, 1990.

[. Rilling and C. Morin, Partage de données transparent et tolérant aux fautes pour la grille, RENPAR'16 Journées Composants, 2005.

[. Shukla, S. Dj-rosenkrantz, and . Ravi, Observations on self-stabilizing graph algorithms for anonymous networks, Proceedings of the Second Workshop on Self-Stabilizing Systems, pp.7-8, 1995.

]. G. Tel91 and . Tel, Topics in Distributed Algorithms, 1991.

]. G. Tel94 and . Tel, Introduction to Distributed Algorithms, 1994.
DOI : 10.1017/CBO9781139168724

]. G. Tel00 and . Tel, Introduction to Distributed Algorithms, 2000.
DOI : 10.1017/CBO9781139168724

[. Tixeuil, Auto-stabilisation Efficace, Thèse de doctorat, spécialité informatique, 2002.
URL : https://hal.archives-ouvertes.fr/tel-00124843

[. Tixeuil, Vers l'autostabilisation des systèmessystèmesà grandé echelle, 2006.

[. Varghese, Self-stabilization by local checking and correction, 1993.