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.
Type de document :
Rapport
[Research Report] 1560, LRI - CNRS, University Paris-Sud. 2013
Liste complète des métadonnées

Littérature citée [29 références]  Voir  Masquer  Télécharger

https://hal.archives-ouvertes.fr/hal-00834633
Contributeur : Xavier Urbain <>
Soumis le : mardi 18 juin 2013 - 16:46:00
Dernière modification le : jeudi 21 mars 2019 - 14:44:14
Document(s) archivé(s) le : jeudi 19 septembre 2013 - 04:07:50

Fichiers

rr.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : hal-00834633, version 1
  • ARXIV : 1306.4242

Citation

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〉

Partager

Métriques

Consultations de la notice

522

Téléchargements de fichiers

385