Vérification formelle et robots mobiles - Archive ouverte HAL Access content directly
Conference Papers Year : 2013

Vérification formelle et robots mobiles

Béatrice Bérard
Laure Millet
Yann Thierry-Mieg
Sébastien Tixeuil


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.
Fichier principal
Vignette du fichier
algotel-fr.pdf (66.8 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-00818707 , version 1 (29-04-2013)


  • 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⟩
242 View
149 Download


Gmail Facebook X LinkedIn More