Hierarchical correctness proofs for distributed algorithms
PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing
Bounds on the time to reach agreement in the presence of timing uncertainty
Journal of the ACM (JACM)
Model-checking in dense real-time
Information and Computation - Special issue: selections from 1990 IEEE symposium on logic in computer science
Theoretical Computer Science
Computer networks (3rd ed.)
Distributed Algorithms
A Sweep-Line Method for State Space Exploration
TACAS 2001 Proceedings of the 7th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
Timing Assumptions and Verification of Finite-State Concurrent Systems
Proceedings of the International Workshop on Automatic Verification Methods for Finite State Systems
Distributing Timed Model Checking - How the Search Order Matters
CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
Timed I/O Automata: A Mathematical Framework for Modeling and Analyzing Real-Time Systems
RTSS '03 Proceedings of the 24th IEEE International Real-Time Systems Symposium
Distributed reachability analysis in timed automata
International Journal on Software Tools for Technology Transfer (STTT) - Special section on parallel and distributed model checking
Are You Still There? " A Lightweight Algorithm to Monitor Node Presence in Self-Configuring Networks
DSN '05 Proceedings of the 2005 International Conference on Dependable Systems and Networks
Verification and improvement of the sliding window protocol
TACAS'03 Proceedings of the 9th international conference on Tools and algorithms for the construction and analysis of systems
Real-time model checking is really simple
CHARME'05 Proceedings of the 13 IFIP WG 10.5 international conference on Correct Hardware Design and Verification Methods
Convergence Verification: From Shared Memory to Partially Synchronous Systems
FORMATS '08 Proceedings of the 6th international conference on Formal Modeling and Analysis of Timed Systems
Using Bounded Model Checking to Verify Consensus Algorithms
DISC '08 Proceedings of the 22nd international symposium on Distributed Computing
Geometric computations by broadcasting automata on the integer grid
UC'11 Proceedings of the 10th international conference on Unconventional computation
Verification, performance analysis and controller synthesis for real-time systems
FSEN'09 Proceedings of the Third IPM international conference on Fundamentals of Software Engineering
Geometric computations by broadcasting automata
Natural Computing: an international journal
Hi-index | 0.00 |
The timed automaton framework of Alur and Dill is a natural choice for the specification of partially synchronous distributed systems (systems which have only partial information about timing, e.g., only an upper bound on the message delay). The past has shown that verification of these systems by model checking usually is very difficult. The present paper demonstrates that an agreement algorithm of Attiya et al, which falls into a – for model checkers – particularly problematic subclass of partially synchronous distributed systems, can easily be modeled with the Uppaal model checker, and that it is possible to analyze some interesting and non-trivial instances with reasonable computational resources. Although existing techniques are used, this is an interesting case study in its own right that adds to the existing body of experience. Furthermore, the agreement algorithm has not been formally verified before to the author’s knowledge.