Using Model Checking to Formally Verify Rendezvous Algorithms for Robots with Lights in Euclidean Space.
Xavier DéfagoAdam HeribanSébastien TixeuilKoichi WadaPublished in: CoRR (2019)
Keyphrases
- model checking
- euclidean space
- temporal logic
- verification method
- data structure
- symbolic model checking
- reachability analysis
- low dimensional
- deterministic finite automaton
- finite state
- formal methods
- formal verification
- computation tree logic
- automated verification
- shape analysis
- vector space
- euclidean distance
- search space