Epidemic algorithms for replicated database maintenance
PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing
A formally verified algorithm for clock synchronization under a hybrid fault model
PODC '94 Proceedings of the thirteenth annual ACM symposium on Principles of distributed computing
Time, clocks, and the ordering of events in a distributed system
Communications of the ACM
Gradient clock synchronization
Distributed Computing - Special issue: PODC 04
QEST '06 Proceedings of the 3rd international conference on the Quantitative Evaluation of Systems
Analysis of a biphase mark protocol with Uppaal and PVS
Formal Aspects of Computing
Gossiping in distributed systems
ACM SIGOPS Operating Systems Review - Gossip-based computer networking
Formal analysis techniques for gossiping protocols
ACM SIGOPS Operating Systems Review - Gossip-based computer networking
A Formal Model of Clock Domain Crossing and Automated Verification of Time-Triggered Hardware
FMCAD '07 Proceedings of the Formal Methods in Computer Aided Design
Event order abstraction for parametric real-time system verification
EMSOFT '08 Proceedings of the 8th ACM international conference on Embedded software
An algorithm for clock synchronization with the gradient property in sensor networks
Journal of Parallel and Distributed Computing
Isabelle/HOL: a proof assistant for higher-order logic
Isabelle/HOL: a proof assistant for higher-order logic
Oblivious gradient clock synchronization
DISC'06 Proceedings of the 20th international conference on Distributed Computing
Easy parameterized verification of biphase mark and 8n1 protocols
TACAS'06 Proceedings of the 12th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Quantitative system validation in model driven design
EMSOFT '10 Proceedings of the tenth ACM international conference on Embedded software
Developing UPPAAL over 15 years
Software—Practice & Experience
Using integer clocks to verify clock-synchronization protocols
Innovations in Systems and Software Engineering
Analyzing the robustness of FTSP with timed automata
Proceedings of the Second Asia-Pacific Symposium on Internetware
Analysis of a clock synchronization protocol for wireless sensor networks
Theoretical Computer Science
Analyzing energy consumption in a gossiping MAC protocol
MMB&DFT'10 Proceedings of the 15th international GI/ITG conference on Measurement, Modelling, and Evaluation of Computing Systems and Dependability and Fault Tolerance
Modeling and Evaluation of Wireless Sensor Network Protocols by Stochastic Timed Automata
Electronic Notes in Theoretical Computer Science (ENTCS)
| Hi-index | 0.00 |
We study a clock synchronization protocol for the Chess WSN. First, we model the protocol as a network of timed automata and verify various instances using the Uppaal model checker. Next, we present a full parametric analysis of the protocol for the special case of cliques (networks with full connectivity), that is, we give constraints on the parameters that are both necessary and sufficient for correctness. These results have been checked using the proof assistant Isabelle. Finally, we present a negative result for the special case of line topologies: for any instantiation of the parameters, the protocol will eventually fail if the network grows. This result suggests a variation of the fundamental result of Fan and Lynch on gradient clock synchronization, where the synchronization eventually fails as the network diameter grows, for a setting with logical clocks whose value may also decrease.