Using Model Checking to Formally Verify Rendezvous Algorithms for Robots with Lights in Euclidean Space.
Xavier DéfagoAdam HeribanSébastien TixeuilKoichi WadaPublished in: SRDS (2020)
Keyphrases
- model checking
- euclidean space
- verification method
- temporal logic
- reachability analysis
- deterministic finite automaton
- finite state
- formal verification
- pattern recognition
- temporal properties
- data structure
- multi dimensional
- formal methods
- automated verification
- shape analysis
- pairwise distances
- computation tree logic
- timed automata
- model checker
- riemannian manifolds
- formal specification