Model Checking of Robot Gathering
From MaRDI portal
Publication:3300809
DOI10.4230/LIPIcs.OPODIS.2017.12zbMath1487.68041OpenAlexW2795221731MaRDI QIDQ3300809
Kazuhiro Ogata, François Bonnet, Ha Thi Thu Doan
Publication date: 30 July 2020
Full work available at URL: https://doi.org/10.4230/LIPIcs.OPODIS.2017.12
Specification and verification (program logics, model checking, etc.) (68Q60) Distributed systems (68M14) Artificial intelligence for robotics (68T40)
Related Items (2)
A structured methodology for designing distributed algorithms for mobile entities ⋮ Synchronous gathering without multiplicity detection: a certified algorithm
Uses Software
Cites Work
- Computing on rings by oblivious robots: a unified approach for different tasks
- A unified approach for gathering and exclusive searching on rings under weak assumptions
- Verification of consensus algorithms using satisfiability solving
- On the completeness of bounded model checking for threshold-based distributed algorithms: reachability
- Certified universal gathering in \(\mathbb {R}^2\) for oblivious mobile robots
- Gathering on rings under the look-compute-move model
- Formal verification of mobile robot protocols
- Computing without communicating: ring exploration by asynchronous oblivious robots
- Exclusive Perpetual Ring Exploration without Chirality
- Distributed Anonymous Mobile Robots: Formation of Geometric Patterns
- Logic in Computer Science
- Model Checking of a Mobile Robots Perpetual Exploration Algorithm
- Synchronous gathering without multiplicity detection: a certified algorithm
This page was built for publication: Model Checking of Robot Gathering
