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
On the accuracy of MANET simulators
Proceedings of the second ACM international workshop on Principles of mobile computing
PRISM 2.0: A Tool for Probabilistic Model Checking
QEST '04 Proceedings of the The Quantitative Evaluation of Systems, First International Conference
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
Model-based validation of QoS properties of biomedical sensor networks
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
Graphical Modelling for Simulation and Formal Analysis of Wireless Network Protocols
Methods, Models and Tools for Fault Tolerance
Exploiting Timed Automata for Conformance Testing of Power Measurements
FORMATS '09 Proceedings of the 7th International Conference on Formal Modeling and Analysis of Timed Systems
Mean-Field Analysis for the Evaluation of Gossip Protocols
QEST '09 Proceedings of the 2009 Sixth International Conference on the Quantitative Evaluation of Systems
Analysis of a Clock Synchronization Protocol for Wireless Sensor Networks
FM '09 Proceedings of the 2nd World Congress on Formal Methods
Modelling and verification of the LMAC protocol for wireless sensor networks
IFM'07 Proceedings of the 6th international conference on Integrated formal methods
MCMT: a model checker modulo theories
IJCAR'10 Proceedings of the 5th international conference on Automated Reasoning
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
Information and Computation
Hi-index | 5.23 |
The Dutch company Chess develops a wireless sensor network (WSN) platform using an epidemic communication model. One of the greatest challenges in the design is to find suitable mechanisms for clock synchronization. In this paper, we study a proposed clock synchronization protocol for the Chess platform. 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. We report on the exhaustive analysis of the protocol for networks with four nodes, and 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.