Skip to Main content Skip to Navigation
Conference papers

Vérification formelle et robots mobiles

Abstract : Mobile robot networks emerged in the past few years as a promising distributed computing model, where simple limited entities perform complex collaborative tasks. Existing works in the literature verify mobile robot protocols by writing \emph{ad hoc} proofs, which, in the case of more complex asynchronous environments, reveals both cumbersome and error-prone. In this paper, we propose the first formal modeling and verification methodology for mobile robots protocols operating in a discrete space. We use a known protocol for exclusive perpetual exploration with three robots as a case study. Our technique shows that in the synchronous and semi-synchronous environments, this protocol is correct, yet safety properties can be violated in the completely asynchronous environment. Finally, we present a protocol fix for the safety problem and verify the correctness of our change.
Complete list of metadatas

Cited literature [3 references]  Display  Hide  Download
Contributor : Laure Millet <>
Submitted on : Monday, April 29, 2013 - 10:01:18 AM
Last modification on : Saturday, May 16, 2020 - 4:24:13 PM
Document(s) archivé(s) le : Monday, August 19, 2013 - 9:46:59 AM


Files produced by the author(s)


  • HAL Id : hal-00818707, version 1


Béatrice Bérard, Laure Millet, Maria Gradinariu Potop-Butucaru, Yann Thierry-Mieg, Sébastien Tixeuil. Vérification formelle et robots mobiles. 15èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel), May 2013, Pornic, France. pp.1-4. ⟨hal-00818707⟩



Record views


Files downloads