J. Abrial, Extending B without changing it (for developing distributed systems), Proc. 1st Conf. on the B Method IRIN Institut de recherche en informatique de Nantes, pp.169-190, 1996.

J. Abrial, A System Development Process with Event-B and the Rodin Platform, Proceedings of the formal engineering methods 9th international conference on Formal methods and software engineering, ICFEM'07, pp.1-3, 2007.
DOI : 10.1007/978-3-540-76650-6_1

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

J. Abrial, M. J. Butler, S. Hallerstede, T. S. Hoang, F. Mehta et al., Rodin: an open toolset for modelling and reasoning in Event-B, International Journal on Software Tools for Technology Transfer, vol.15, issue.1, pp.447-466, 2010.
DOI : 10.1007/s10009-010-0145-y

J. Abrial and D. Cansell, Click???n Prove: Interactive Proofs within Set Theory, 16th International Conference on Theorem Proving in Higher Order Logics - TPHOLs'2003, pp.1-24, 2003.
DOI : 10.1007/10930755_1

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

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, D. Cansell, and D. Méry, A new ieee 1394 leader election protocol . Rigorous Methods for Software Construction and Analysis Seminar N06161, 2006.

J. Abrial and L. Mussat, Introducing dynamic constraints in B, pp.83-128, 1998.
DOI : 10.1007/BFb0053357

C. Aguerre, ViSiDiA -user manual, 2010.

N. Alon and N. Kahale, A Spectral Technique for Coloring Random 3-Colorable Graphs, SIAM Journal on Computing, vol.26, issue.6, pp.1733-1748, 1997.
DOI : 10.1137/S0097539794270248

P. Castéran, V. Filou, and M. Mosbah, Formal Proofs of Local Computation Systems, 2009.

K. Chaudhuri, D. Doligez, L. Lamport, and S. Merz, The TLA???+??? Proof System: Building a Heterogeneous Verification Platform, Lecture Notes in Computer Science, vol.6255, p.44, 2010.
DOI : 10.1007/978-3-642-14808-8_3

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

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

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 Largest-First Algorithm for Graph Coloring, Euro-Par, pp.804-811, 2004.
DOI : 10.1007/978-3-540-27866-5_107

L. Hervé, Téléphonie cellulaire -coloriages pour allocation de fréquences, La Recherche -N, vol.390, pp.98-99, 2005.

Z. Thai-son-hoang, K. Jin, A. Robinson, C. Mciver, and . Morgan, Development via Refinement in Probabilistic B ??? Foundation and Case Study, ZB2005: Formal Specification and Development in Z and B, Proceedings of the 4th International Conference of B and Z Users, pp.355-373, 2005.
DOI : 10.1007/11415787_21

E. M. Jr, Orna Grumberg, and Doron A. Peled. Model Checking, 1999.

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

L. Lamport, Time, clocks, and the ordering of events in a distributed system, Communications of the ACM, vol.21, issue.7, pp.558-565, 1978.
DOI : 10.1145/359545.359563

M. Leuschel and M. Butler, ProB: A Model Checker for B, FME 2003: Formal Methods, LNCS 2805, pp.855-874, 2003.
DOI : 10.1007/978-3-540-45236-2_46

M. Malkawi, M. Hassan, and O. Hassan, A new exam scheduling algorithm using graph coloring, Int. Arab J. Inf. Technol, vol.5, issue.1, pp.80-86, 2008.

A. Mciver, C. Morgan, and T. S. Hoang, Probabilistic Termination in B, Lecture Notes in Computer Science, vol.2651, pp.216-239, 2003.
DOI : 10.1007/3-540-44880-2_15

D. Méry, M. Mosbah, and M. Tounsi, Refinement-Based Verification of Local Synchronization Algorithms, Lecture Notes in Computer Science, vol.208, issue.11, pp.338-352, 2011.
DOI : 10.1007/978-3-642-16265-7_20

D. Méry, M. Mosbah, and M. Tounsi, Proving Distributed Algorithms by Combining Refinement and Local Computations, AVOCS 2010 10th International Workshop on Automated Verification of Critical Systems, 2010.

C. Morgan, The generalised substitution language extended to probabilistic programs, Lecture Notes in Computer Science, vol.1393, pp.9-25, 1998.
DOI : 10.1007/BFb0053351

C. Morgan, T. S. Hoang, and J. Abrial, The Challenge of Probabilistic Event B???Extended Abstract???, ZB, pp.162-171, 2005.
DOI : 10.1007/11415787_10

C. Morgan, A. Mciver, and K. Seidel, Probabilistic predicate transformers, ACM Transactions on Programming Languages and Systems, vol.18, issue.3, pp.325-353, 1996.
DOI : 10.1145/229542.229547

J. Mycielski, Sur le coloriage des graphes, Colloq. Math, vol.3, pp.161-162, 1955.

D. Méry, Systèmes répartis, algorithmes répartis, programmation distribuée, 2005.

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.

R. Brian and . Nickerson, Graph coloring register allocation for processors with multi-register operands, Proceedings of the ACM SIGPLAN 1990 conference on Programming language design and implementation, PLDI '90, pp.40-52, 1990.

C. Lawrence and . Paulson, Isabelle -A Generic Theorem Prover (with a contribution by, Lecture Notes in Computer Science, vol.828, 1994.

J. Rehm, Gestion Du Temps Par Le Raffinement, 2009.
URL : https://hal.archives-ouvertes.fr/tel-00441312

J. Rehm and D. Cansell, Proved development of the real-time properties of the IEEE 1394 Root Contention Protocol with the event-B method, ISoLA, pp.179-190, 2007.
DOI : 10.1007/s10009-009-0130-5

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

B. Robillart, Vérification formelle et optimisation de l'allocation de registres, Conservatoire National des Arts et Métiers, 2010.

J. Schneider and R. Wattenhofer, A new technique for distributed symmetry breaking, Proceeding of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing, PODC '10, pp.257-266, 2010.
DOI : 10.1145/1835698.1835760

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

M. Tounsi, A. Hadj-kacem, M. Mosbah, and D. Méry, 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

E. Villegas, E. Lopez-aguilera, R. Vidal, and J. Paradells, Effect of adjacent-channel interference in IEEE 802, 11 WLANs. Cognitive Radio Oriented Wireless Networks and Communications 2nd International Conference, pp.118-125, 2007.