Impossibility of gathering, a certification
From MaRDI portal
Publication:483063
DOI10.1016/j.ipl.2014.11.001zbMath1317.68264arXiv1405.5902OpenAlexW2082183470MaRDI QIDQ483063
Sébastien Tixeuil, Pierre Courtieu, Lionel Rieg, Xavier Urbain
Publication date: 15 December 2014
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1405.5902
Analysis of algorithms (68W40) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Artificial intelligence for robotics (68T40) Distributed algorithms (68W15)
Related Items (13)
TuringMobile: a Turing machine of oblivious mobile robots with limited visibility and its applications ⋮ Verification of agent navigation in partially-known environments ⋮ Certified Impossibility Results and Analyses in Coq of Some Randomised Distributed Algorithms ⋮ Wait-Free Gathering Without Chirality ⋮ Certification of an exact worst-case self-stabilization time ⋮ The agreement power of disagreement ⋮ Parameterized verification of algorithms for oblivious robots on a ring ⋮ Unnamed Item ⋮ Synchronous gathering without multiplicity detection: a certified algorithm ⋮ Stand up indulgent gathering ⋮ Stand up indulgent gathering ⋮ A Framework for Certified Self-Stabilization ⋮ Embedded pattern formation by asynchronous robots without chirality
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Interactive theorem proving and program development. Coq'Art: the calculus of inductive constructions. Foreword by Gérard Huet and Christine Paulin-Mohring.
- A formally verified compiler back-end
- Engineering mathematics
- Introduction to Bisimulation and Coinduction
- Distributed Computing by Mobile Robots: Gathering
- Distributed Anonymous Mobile Robots: Formation of Geometric Patterns
This page was built for publication: Impossibility of gathering, a certification
