Certified Impossibility Results for Byzantine-Tolerant Mobile Robots - Archive ouverte HAL Access content directly
Reports (Research Report) Year : 2013

Certified Impossibility Results for Byzantine-Tolerant Mobile Robots

Abstract

We propose a framework to build formal developments for robot networks using the COQ proof assistant, to state and to prove formally various properties. We focus in this paper on impossibility proofs, as it is natural to take advantage of the COQ higher order calculus to reason about algorithms as abstract objects. We present in particular formal proofs of two impossibility results forconvergence of oblivious mobile robots if respectively more than one half and more than one third of the robots exhibit Byzantine failures, starting from the original theorems by Bouzid et al.. Thanks to our formalization, the corresponding COQ developments are quite compact. To our knowledge, these are the first certified (in the sense of formally proved) impossibility results for robot networks.
Fichier principal
Vignette du fichier
rr.pdf (149.5 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-00834633 , version 1 (18-06-2013)

Identifiers

Cite

Cédric Auger, Zohir Bouzid, Pierre Courtieu, Sébastien Tixeuil, Xavier Urbain. Certified Impossibility Results for Byzantine-Tolerant Mobile Robots. [Research Report] 1560, LRI - CNRS, University Paris-Sud. 2013. ⟨hal-00834633⟩
376 View
394 Download

Altmetric

Share

Gmail Facebook X LinkedIn More