Introduction to distributed algorithms
Introduction to distributed algorithms
On reduction-based process semantics
Selected papers of the thirteenth conference on Foundations of software technology and theoretical computer science
Unreliable failure detectors for reliable distributed systems
Journal of the ACM (JACM)
Confluence for process verification
Theoretical Computer Science
Distributed processes and location failures
Theoretical Computer Science
Distributed Algorithms
Communication and Concurrency
CONCUR '96 Proceedings of the 7th International Conference on Concurrency Theory
The Consensus Problem in Unreliable Distributed Systems (A Brief Survey)
Proceedings of the 1983 International FCT-Conference on Fundamentals of Computation Theory
Strong normalisation in the π-calculus
Information and Computation
A theory of system behaviour in the presence of node and link failures
CONCUR 2005 - Concurrency Theory
A theory for observational fault tolerance
FOSSACS'06 Proceedings of the 9th European joint conference on Foundations of Software Science and Computation Structures
A theory of system behaviour in the presence of node and link failure
Information and Computation
On Process-Algebraic Proof Methods for Fault Tolerant Distributed Systems
FMOODS '09/FORTE '09 Proceedings of the Joint 11th IFIP WG 6.1 International Conference FMOODS '09 and 29th IFIP WG 6.1 International Conference FORTE '09 on Formal Techniques for Distributed Systems
Formal Model--Driven Design of Distributed Algorithms
Electronic Notes in Theoretical Computer Science (ENTCS)
FMOODS'11/FORTE'11 Proceedings of the joint 13th IFIP WG 6.1 and 30th IFIP WG 6.1 international conference on Formal techniques for distributed systems
Formal verification of distributed algorithms: from pseudo code to checked proofs
TCS'12 Proceedings of the 7th IFIP TC 1/WG 202 international conference on Theoretical Computer Science
| Hi-index | 0.00 |
The possibility of partial failure occuring at any stage of computation complicates rigorous formal treatment of distributed algorithms. We propose a methodology for formalising and proving the correctness of distributed algorithms which alleviates this complexity. The methodology uses fault-tolerance bisimulation proof techniques to split the analysis into two phases, that is a failure-free phase and a failure phase, permitting separation of concerns. We design a minimal partial-failure calculus, develop a corresponding bisimulation theory for it and express a consensus algorithm in the calculus. We then use the consensus example and the calculus theory to demonstrate the benefits of our methodology.