Impossibility of gathering, a certification

@article{Courtieu2015ImpossibilityOG,
  title={Impossibility of gathering, a certification},
  author={Pierre Courtieu and Lionel Rieg and S. Tixeuil and X. Urbain},
  journal={Inf. Process. Lett.},
  year={2015},
  volume={115},
  pages={447-452}
}
Recent advances in Distributed Computing highlight models and algorithms for autonomous swarms of mobile robots that self-organise and cooperate to solve global objectives. The overwhelming majority of works so far considers handmade algorithms and proofs of correctness. This paper builds upon a previously proposed formal framework to certify the correctness of impossibility results regarding distributed algorithms that are dedicated to autonomous mobile robots evolving in a continuous space… Expand
Parameterized verification of algorithms for oblivious robots on a ring
Unreliable Sensors for Reliable Efficient Robots
Synchronous Gathering without Multiplicity Detection: a Certified Algorithm
Certified Universal Gathering in $R^2$ for Oblivious Mobile Robots
A Certified Universal Gathering Algorithm for Oblivious Mobile Robots
...
1
2
3
4
...

References

SHOWING 1-10 OF 29 REFERENCES
Distributed Computing by Oblivious Mobile Robots
Formal verification of mobile robot protocols
Distributed Computing by Mobile Robots: Gathering
Distributed Anonymous Mobile Robots: Formation of Geometric Patterns
Stabilization, Safety, and Security of Distributed Systems
On the Synthesis of Mobile Robots Algorithms: The Case of Ring Gathering
Stabilization, Safety, and Security of Distributed Systems
Certified Impossibility Results for Byzantine-Tolerant Mobile Robots
...
1
2
3
...