Model checking of robot gathering
From MaRDI portal
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
Cites work
- A unified approach for gathering and exclusive searching on rings under weak assumptions
- Certified universal gathering in \(\mathbb {R}^2\) for oblivious mobile robots
- Computing on rings by oblivious robots: a unified approach for different tasks
- Computing without communicating: ring exploration by asynchronous oblivious robots
- Distributed Anonymous Mobile Robots: Formation of Geometric Patterns
- Exclusive perpetual ring exploration without chirality
- Formal verification of mobile robot protocols
- Gathering on rings under the look-compute-move model
- Logic in Computer Science
- Model checking of a mobile robots perpetual exploration algorithm
- On the completeness of bounded model checking for threshold-based distributed algorithms: reachability
- Synchronous gathering without multiplicity detection: a certified algorithm
- Verification of consensus algorithms using satisfiability solving
Cited in
(6)- Formal verification of mobile robot protocols
- Model checking of a mobile robots perpetual exploration algorithm
- Synchronous gathering without multiplicity detection: a certified algorithm
- A structured methodology for designing distributed algorithms for mobile entities
- An environment for specifying and model checking mobile ring robot algorithms
- Deterministic color-optimal self-stabilizing semi-synchronous gathering: two certified algorithms
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)
