[Invited Paper] Formal Methods for Mobile Robots: Current Results and Open Problems

Abstract : Mobile robot networks emerged in the past few years as a promising distributed computing model. Existing work in the literature typically ensures the correctness of mobile robot protocols via ad hoc handwritten proofs, which are both cumbersome and error-prone. This paper surveys state-of-the-art results about applying formal methods approaches (namely, model-checking, program synthesis, and proof assistants) to the context of mobile robot networks. Those methods already proved useful for bug-hunting in published literature, designing correct-by-design optimal protocols, and certifying impossibility results. We also present related open questions to further develop this path of research.
Liste complète des métadonnées

Contributeur : Sébastien Tixeuil <>
Soumis le : lundi 7 décembre 2015 - 10:29:54
Dernière modification le : lundi 15 octobre 2018 - 14:34:02


  • HAL Id : hal-01238784, version 1


Béatrice Bérard, Pierre Courtieu, Laure Millet, Maria Potop-Butucaru, Lionel Rieg, et al.. [Invited Paper] Formal Methods for Mobile Robots: Current Results and Open Problems. International Journal of Informatics Society, Japan Informatics Society, 2015, 7 (3), pp.101-114. 〈http://www.infsoc.org/journal/vol07/IJIS_07_3_101-114.pdf〉. 〈hal-01238784〉



Consultations de la notice