J. Abrial, Modeling in Event-B: System and Software Engineering, 2010.
DOI : 10.1017/CBO9781139195881

J. Abrial, D. Cansell, and D. Méry, A Mechanically Proved and Incremental Development of IEEE 1394 Tree Identify Protocol, Formal Aspects of Computing, vol.14, issue.3, pp.215-227, 2003.
DOI : 10.1007/s001650300002
URL : https://hal.archives-ouvertes.fr/inria-00099531

J. Abrial, T. S. Hoang, and C. Morgan, The challenge of probabilistic event b -extended abstract, ZB, pp.162-171, 2005.

M. Bruno, A. , and D. Méry, Stepwise Development of Distributed Vertex Coloring Algorithms, 2011.

B. Derbel, A brief introduction to visidia, 2007.

K. R. Duffy, N. O. Connell, and A. Sapozhnikov, Complexity analysis of a decentralised graph colouring algorithm, Information Processing Letters, vol.107, issue.2, pp.60-63, 2008.
DOI : 10.1016/j.ipl.2008.01.002

A. Hadj-kacem, D. Méry, M. Mosbah, and M. Tounsi, A Refinement Approach for Proving Distributed Algorithms : Examples of Spanning Tree Problems, Integration of Model based Formal Methods and Tools, 2009.
URL : https://hal.archives-ouvertes.fr/hal-00361933

S. Hallerstede and T. S. Hoang, Qualitative Probabilistic Modelling in Event-B, IFM, pp.293-312, 2007.
DOI : 10.1007/978-3-540-73210-5_16

J. C. Hansen, M. Kubale, L. Kuszner, and A. Nadolski, Distributed largestfirst algorithm for graph coloring, Euro-Par, pp.804-811, 2004.

M. Kubale and L. Kuszner, A better practical algorithm for distributed graph coloring, Proceedings. International Conference on Parallel Computing in Electrical Engineering, pp.72-75, 2002.
DOI : 10.1109/PCEE.2002.1115204

M. Kwiatkowska, G. Norman, and D. Parker, PRISM: Probabilistic Symbolic Model Checker, Proc. 12th International Conference on Modelling Techniques and Tools for Computer Performance Evaluation, pp.200-204, 2002.
DOI : 10.1007/3-540-46029-2_13

A. Mciver, C. Morgan, and K. Seidel, Probabilistic predicate transformers, ACM Trans. Program. Lang. Syst, vol.18, issue.3, pp.325-353, 1996.

D. Méry, Refinement-based guidelines for constructing algorithms, Refinement Based Methods for the Construction of Dependable Systems, number 09381 in Dagstuhl Seminar Proceedings Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2010.

Y. Métivier, J. M. Robson, N. Saheb-djahromi, and A. Zemmari, An analysis of an optimal bit complexity randomised distributed vertex colouring algorithm (extended abstract), OPODIS, pp.359-364, 2009.

A. Sellami, Des calculs locaux aux algorithmes distribués, 2004.