Synchronous gathering without multiplicity detection: a certified algorithm

DOI10.1007/978-3-319-49259-9_2zbMath1425.68410OpenAlexW2998362756MaRDI QIDQ5918186

Amélie Delga, Xavier Urbain, Lionel Rieg, Thibaut Balabonski, Sébastien Tixeuil

Publication date: 22 November 2019

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-49259-9_2

Mathematics Subject Classification ID

Artificial intelligence for robotics (68T40) Distributed algorithms (68W15)

Related Items (4)

On asynchronous rendezvous in general graphs ⋮ Model Checking of Robot Gathering ⋮ Self-stabilizing gathering of mobile robots under crash or Byzantine faults ⋮ Parameterized verification of algorithms for oblivious robots on a ring

Uses Software

• Coq

This page was built for publication: Synchronous gathering without multiplicity detection: a certified algorithm