A generic SPIN model verifies known luminous rendezvous algorithms for two robots across six synchrony models, matching literature results and generating counterexamples for failing cases.
Since the same piece of information is being read and written at the same time, the result of the read operation cannot be determined
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DC 1years
2019 1verdicts
ACCEPT 1representative citing papers
citing papers explorer
-
Using Model Checking to Formally Verify Rendezvous Algorithms for Robots with Lights in Euclidean Space
A generic SPIN model verifies known luminous rendezvous algorithms for two robots across six synchrony models, matching literature results and generating counterexamples for failing cases.