Synchronous gathering without multiplicity detection: a certified algorithm
From MaRDI portal
Publication:5920218
DOI10.1007/s00224-017-9828-zzbMath1423.68522OpenAlexW2548603685MaRDI QIDQ5920218
Xavier Urbain, Thibaut Balabonski, Sébastien Tixeuil, Amélie Delga, Lionel Rieg
Publication date: 21 June 2019
Published in: Theory of Computing Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00224-017-9828-z
Related Items (4)
Mobile Robots with Uncertain Visibility Sensors: Possibility Results and Lower Bounds ⋮ Gathering problems for autonomous mobile robots with lights ⋮ Stand up indulgent gathering ⋮ Stand up indulgent gathering
Uses Software
Cites Work
- Unnamed Item
- Impossibility of gathering, a certification
- Interactive theorem proving and program development. Coq'Art: the calculus of inductive constructions. Foreword by Gérard Huet and Christine Paulin-Mohring.
- Certified universal gathering in \(\mathbb {R}^2\) for oblivious mobile robots
- Parameterized verification of algorithms for oblivious robots on a ring
- Formal verification of mobile robot protocols
- Impossibility of gathering by a set of autonomous mobile robots
- A Framework for Certified Self-Stabilization
- Introduction to Bisimulation and Coinduction
- Distributed Computing by Mobile Robots: Gathering
- Model Checking of Robot Gathering
- Distributed Anonymous Mobile Robots: Formation of Geometric Patterns
- Structural Information and Communication Complexity
- Convergence Properties of the Gravitational Algorithm in Asynchronous Robot Systems
This page was built for publication: Synchronous gathering without multiplicity detection: a certified algorithm
