Formal Methods for Mobile Robots

Abstract : Most 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 and protocols.
Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-01981634
Contributor : Xavier Urbain <>
Submitted on : Tuesday, January 15, 2019 - 10:56:57 AM
Last modification on : Friday, July 5, 2019 - 3:26:03 PM

Identifiers

Citation

Maria Potop-Butucaru, Nathalie Sznajder, Sébastien Tixeuil, Xavier Urbain. Formal Methods for Mobile Robots. Paola Flocchini; Giuseppe Prencipe; Nicola Santoro. Distributed Computing by Mobile Entities, Current Research in Moving and Computing, Springer International Publishing, pp.278-313, 2019, Theoretical Computer Science and General Issues, 978-3-030-11071-0. ⟨10.1007/978-3-030-11072-7_12⟩. ⟨hal-01981634⟩

Share

Metrics

Record views

71