Model checking of robot gathering
From MaRDI portal
Publication:3300809
DOI10.4230/LIPICS.OPODIS.2017.12zbMATH Open1487.68041OpenAlexW2795221731MaRDI QIDQ3300809FDOQ3300809
Authors: Ha Thi Thu Doan, François Bonnet, Kazuhiro Ogata 
Publication date: 30 July 2020
Full work available at URL: https://doi.org/10.4230/LIPIcs.OPODIS.2017.12
Recommendations
- Model checking of a mobile robots perpetual exploration algorithm
- Formal verification of mobile robot protocols
- Impossibility of gathering, a certification
- Parameterized verification of algorithms for oblivious robots on a ring
- Certified universal gathering in \(\mathbb {R}^2\) for oblivious mobile robots
Specification and verification (program logics, model checking, etc.) (68Q60) Artificial intelligence for robotics (68T40) Distributed systems (68M14)
Cites Work
- Gathering on rings under the look-compute-move model
- Distributed Anonymous Mobile Robots: Formation of Geometric Patterns
- Logic in Computer Science
- Computing without communicating: ring exploration by asynchronous oblivious robots
- Exclusive perpetual ring exploration without chirality
- 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
- Synchronous gathering without multiplicity detection: a certified algorithm
- Formal verification of mobile robot protocols
- Model Checking of a Mobile Robots Perpetual Exploration Algorithm
Cited In (3)
Uses Software
This page was built for publication: Model checking of robot gathering
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3300809)
