The topic of autonomous mobile robots continues to generate a lot of interest in the algorithmic community, both from a purely theoretical perspective and from a more applicative one. The model is now well understood, and the problems under investigation are becoming more and more complex. Correctness proofs are usually very intricate and elaborate, often leaving margin of doubts. This thesis focuses on a new approach to formally study correctness in robots systems and to automatically generate algorithmic solutions. In fact, we propose a general framework to express robot models, and where automated technics like model checking and algorithm synthesis can be used, moreover we show their applicability in robots models under all possible synchronicity levels (from fully synchronous to fully asynchronous).
B. Bérard, L. Millet, M. Gradinariu Potop‑Butucaru, Y. Thierry‑Mieg, S. Tixeuil : “Vérification formelle et robots mobiles”, 15es Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel), Pornic, France, pp. 1-4, (Nisse, Nicolas et Rousseau, Franck et Busnel, Yann) (2013)
L. Millet, M. Lorrillere, L. Arantes, S. Gançarski, H. Naacke, J. Sopena : “Facing peak loads in a P2P transaction system”, Proceedings of the First Workshop on P2P and Dependability (P2PDEP'12), P2P-Dep '12, Sibiu, Romania, pp. 1-7, (ACM) (2012)