Section: New Results

Distributed algorithms

Participant : Jean-François Monin.

The population protocol model has emerged as a new computation paradigm for describing mobile ad hoc networks that consist of a number of mobile nodes interacting with each other to carry out a computation [23] . Correctness proofs of such protocols involve intricate arguments on infinite sequences of events. We formalize such proofs in the constructive framework given by Coq. Preliminary results on the leader election problem show that we gain interesting insights on the behaviour of such algorithms.

This work is done in cooperation with Deng Yuxin, from the BASICS group at Shanghai Jiaotong University.