Showing cs.DCShow all
2 papers · 1 filter
cs.DC2019
Using Model Checking to Formally Verify Rendezvous Algorithms for Robots with Lights in Euclidean Space
Xavier Défago, Adam Heriban, Sébastien Tixeuil +1
The paper details the first successful attempt at using model-checking techniques to verify the correctness of distributed algorithms for robots evolving in a \emph{continuous} env…
cs.DC2017
Optimally Gathering Two Robots
Adam Heriban, Xavier Défago, Sébastien Tixeuil
We present an algorithm that ensures in finite time the gathering of two robots in the non-rigid ASYNC model. To circumvent established impossibility results, we assume robots are…