Fault-Tolerant Gathering Algorithms for Autonomous Mobile Robots, SIAM Journal on Computing, vol.36, issue.1, pp.56-82, 2006. ,
DOI : 10.1137/050645221
Certified Impossibility Results for Byzantine-Tolerant Mobile Robots, Stabilization, Safety, and Security of Distributed Systems -15th International Symposium, pp.178-186, 2013. ,
DOI : 10.1007/978-3-319-03089-0_13
URL : https://hal.archives-ouvertes.fr/hal-00834633
Yann Thierry-Mieg, and Sébastien Tixeuil. Formal verification of Mobile Robot Protocols, 2013. ,
Interactive Theorem Proving and Program Development. Coq'Art: The Calculus of Inductive Constructions. Texts in Theoretical Computer Science, 2004. ,
DOI : 10.1007/978-3-662-07964-5
URL : https://hal.archives-ouvertes.fr/hal-00344237
Discovering and Assessing Fine-Grained Metrics in Robot Networks Protocols, 2014 IEEE 33rd International Symposium on Reliable Distributed Systems Workshops, pp.50-59, 2014. ,
DOI : 10.1109/SRDSW.2014.34
URL : https://hal.archives-ouvertes.fr/hal-00934186
Gathering of Mobile Robots Tolerating Multiple Crash Faults, 2013 IEEE 33rd International Conference on Distributed Computing Systems, pp.337-346, 2013. ,
DOI : 10.1109/ICDCS.2013.27
URL : https://hal.archives-ouvertes.fr/hal-00930074
Inductively defined types, International Conference on Computer Logic (Colog'88), pp.50-66, 1990. ,
DOI : 10.1007/3-540-52335-9_47
Impossibility of gathering, a certification, Information Processing Letters, vol.115, issue.3, pp.447-452, 2015. ,
DOI : 10.1016/j.ipl.2014.11.001
URL : https://hal.archives-ouvertes.fr/hal-01122869
Optimal Grid Exploration by Asynchronous Oblivious Robots, Richa and Scheideler [16], pp.64-76 ,
DOI : 10.1007/978-3-642-33536-5_7
URL : https://hal.archives-ouvertes.fr/hal-00934161
Self-stabilizing gathering with strong multiplicity detection, Theoretical Computer Science, vol.428, pp.47-57, 2012. ,
DOI : 10.1016/j.tcs.2011.12.010
Distributed Computing by Oblivious Mobile Robots. Synthesis Lectures on Distributed Computing Theory, 2012. ,
Feasibility of Polynomial-Time Randomized Gathering for Oblivious Mobile Robots, IEEE Transactions on Parallel and Distributed Systems, vol.24, issue.4, pp.716-723, 2013. ,
DOI : 10.1109/TPDS.2012.212
The Gathering Problem for Two Oblivious Robots with Unreliable Compasses, SIAM Journal on Computing, vol.41, issue.1, pp.26-46, 2012. ,
DOI : 10.1137/100797916
On the Synthesis of Mobile Robots Algorithms: The Case of Ring Gathering, Stabilization, Safety, and Security of Distributed Systems -16th International Symposium, pp.237-251, 2014. ,
DOI : 10.1007/978-3-319-11764-5_17
URL : https://hal.archives-ouvertes.fr/hal-01016832
Impossibility of gathering by a set of autonomous mobile robots, Theoretical Computer Science, vol.384, issue.2-3, pp.222-231, 2007. ,
DOI : 10.1016/j.tcs.2007.04.023
Introduction to Bisimulation and Coinduction, 2012. ,
DOI : 10.1017/CBO9780511777110
URL : https://hal.archives-ouvertes.fr/hal-00907026
Distributed Anonymous Mobile Robots: Formation of Geometric Patterns, SIAM Journal on Computing, vol.28, issue.4, pp.1347-1363, 1999. ,
DOI : 10.1137/S009753979628292X