Parameterized verification of algorithms for oblivious robots on a ring
From MaRDI portal
Publication:2225474
DOI10.1007/s10703-019-00335-yzbMath1506.68058arXiv1706.05193OpenAlexW2625145304MaRDI QIDQ2225474
Nathalie Sznajder, Arnaud Sangnier, Sébastien Tixeuil, Maria Gradinariu Potop-Butucaru
Publication date: 8 February 2021
Published in: Formal Methods in System Design (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1706.05193
Specification and verification (program logics, model checking, etc.) (68Q60) Artificial intelligence for robotics (68T40)
Related Items
Synchronous gathering without multiplicity detection: a certified algorithm, Preface of the special issue on the conference on formal methods in computer-aided design 2017
Uses Software
Cites Work
- Unnamed Item
- Impossibility of gathering, a certification
- Undecidable problems in unreliable computations.
- Certified universal gathering in \(\mathbb {R}^2\) for oblivious mobile robots
- Formal verification of mobile robot protocols
- Computing without communicating: ring exploration by asynchronous oblivious robots
- Exclusive Perpetual Ring Exploration without Chirality
- Bounds on Positive Integral Solutions of Linear Diophantine Equations
- Distributed Anonymous Mobile Robots: Formation of Geometric Patterns
- Model Checking of a Mobile Robots Perpetual Exploration Algorithm
- Synchronous gathering without multiplicity detection: a certified algorithm
