Verification of an industrial asynchronous leader election algorithm using abstractions and parametric model checking

Étienne André (1, 2, 3) , Laurent Fribourg (4) , Jean-Marc Mota (5) , Romain Soulat (6)

1 NII - National Institute of Informatics
2 JFLI - Japanese French Laboratory for Informatics
3 LIPN - Laboratoire d'Informatique de Paris-Nord
4 LSV - Laboratoire Spécification et Vérification [Cachan]
5 Thales Communications & Security S.A.S [Velizy]
6 Thales Research and Technology [Palaiseau]

The election of a leader in a network is a challenging task, especially when the processes are asynchronous, i.e., execute an algorithm with time-varying periods. Thales developed an industrial election algorithm with an arbitrary number of processes, that can possibly fail. In this work, we prove the correctness of a variant of this industrial algorithm. We use a method combining abstraction, the SafeProver solver, and a parametric timed model-checker. This allows us to prove the correctness of the algorithm for a large number p of processes (p=5000).

Domaines: Logique en informatique [cs.LO]; Systèmes embarqués

Étienne André, Laurent Fribourg, Jean-Marc Mota, Romain Soulat. Verification of an industrial asynchronous leader election algorithm using abstractions and parametric model checking. 20th International Conference on Verification, Model Checking, and Abstract Interpretation (VMCAI 2019), Constantin Enea and Ruzica Piskac, Jan 2019, Lisboa, Portugal. ⟨10.1007/978-3-030-11245-5_23⟩. ⟨hal-01966300⟩