A. Daliot and D. Dolev, Self-stabilization of Byzantine Protocols, Self-Stabilizing Systems, pp.48-67, 2005.
DOI : 10.1007/11577327_4

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

. Shlomi and . Dolev, Self-stabilization, 2000.

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

S. Dubois, T. Masuzawa, and S. Tixeuil, The Impact of Topology on Byzantine Containment in Stabilization, Proceedings of DISC 2010, 2010.
DOI : 10.1007/978-3-642-15763-9_47
URL : https://hal.archives-ouvertes.fr/inria-00481836

S. Dubois, T. Masuzawa, and S. Tixeuil, On Byzantine Containment Properties of the min???+???1 Protocol, Proceedings of SSS 2010, 2010.
DOI : 10.1007/978-3-642-16023-3_10
URL : https://hal.archives-ouvertes.fr/hal-01290827

S. Dubois, T. Masuzawa, and S. Tixeuil, Bounding the Impact of Unbounded Attacks in Stabilization, IEEE Transactions on Parallel and Distributed Systems, vol.23, issue.3, 2011.
DOI : 10.1109/TPDS.2011.158
URL : https://hal.archives-ouvertes.fr/inria-00484645

G. Mohamed, M. Gouda, and . Schneider, Stabilization of maximal metric trees, pp.10-17, 1999.

G. Mohamed, M. Gouda, and . Schneider, Maximizable routing metrics, IEEE/ACM Trans. Netw, vol.11, issue.4, pp.663-675, 2003.

. Shing-tsaan, N. Huang, and . Chen, A self-stabilizing algorithm for constructing breadth-first trees, Inf. Process. Lett, vol.41, issue.2, pp.109-117, 1992.

L. Lamport, R. E. Shostak, and M. C. Pease, The Byzantine Generals Problem, ACM Transactions on Programming Languages and Systems, vol.4, issue.3, pp.382-401, 1982.
DOI : 10.1145/357172.357176

T. Masuzawa and S. Tixeuil, Bounding the Impact of Unbounded Attacks in Stabilization, SSS, pp.440-453, 2006.
DOI : 10.1007/978-3-540-49823-0_31
URL : https://hal.archives-ouvertes.fr/inria-00484645

T. Masuzawa and S. Tixeuil, Stabilizing link-coloration of arbitrary networks with unbounded byzantine faults, International Journal of Principles and Applications of Information Science and Technology (PAIST), vol.1, issue.1, pp.1-13, 2007.
URL : https://hal.archives-ouvertes.fr/hal-01152556

M. Nesterenko and A. Arora, Tolerance to unbounded Byzantine faults, 21st IEEE Symposium on Reliable Distributed Systems, 2002. Proceedings., p.22, 2002.
DOI : 10.1109/RELDIS.2002.1180170

S. Tixeuil, Algorithms and Theory of Computation Handbook, Second Edition, chapter Self-stabilizing Algorithms Chapman & Hall/CRC Applied Algorithms and Data Structures, pp.26-27, 2009.