Characterizing Consensus in the Heard-Of Model
From MaRDI portal
Publication:5089273
DOI10.4230/LIPIcs.CONCUR.2020.9OpenAlexW3082781656MaRDI QIDQ5089273
A. R. Balasubramanian, Igor Walukiewicz
Publication date: 18 July 2022
Full work available at URL: https://arxiv.org/abs/2004.09621
Cites Work
- Unnamed Item
- Verification of consensus algorithms using satisfiability solving
- On the completeness of bounded model checking for threshold-based distributed algorithms: reachability
- SMT and POR beat counter abstraction: parameterized model checking of threshold-based distributed algorithms
- Partial synchrony based on set timeliness
- Cutoff bounds for consensus algorithms
- The Theta-Model: achieving synchrony without clocks
- The Heard-Of model: computing in distributed systems with benign faults
- A Layered Analysis of Consensus
- Round-by-round fault detectors (extended abstract)
- PSync: a partially synchronous language for fault-tolerant distributed algorithms
- The failure detector abstraction
- A Logic-Based Framework for Verifying Consensus Algorithms
- Parameterized Model Checking of Synchronous Distributed Algorithms by Abstraction
- A Reduction Theorem for the Verification of Round-Based Distributed Algorithms
- Impossibility of distributed consensus with one faulty process
- Unreliable failure detectors for reliable distributed systems
- The weakest failure detector for solving consensus
- Reachability in Parameterized Systems: All Flavors of Threshold Automata
- Synchrony weakened by message adversaries vs asynchrony restricted by failure detectors
- A short counterexample property for safety and liveness verification of fault-tolerant distributed algorithms
- Tolerating corrupted communication
- The Building Blocks of Consensus
- Communication-closed asynchronous protocols
This page was built for publication: Characterizing Consensus in the Heard-Of Model
