Characterizing Consensus in the Heard-Of Model
From MaRDI portal
Cites work
- \textsc{PSync}: a partially synchronous language for fault-tolerant distributed algorithms
- A layered analysis of consensus
- A logic-based framework for verifying consensus algorithms
- A Reduction Theorem for the Verification of Round-Based Distributed Algorithms
- A short counterexample property for safety and liveness verification of fault-tolerant distributed algorithms
- Communication-closed asynchronous protocols
- Cutoff bounds for consensus algorithms
- Impossibility of distributed consensus with one faulty process
- On the completeness of bounded model checking for threshold-based distributed algorithms: reachability
- Parameterized model checking of synchronous distributed algorithms by abstraction
- Partial synchrony based on set timeliness
- Reachability in parameterized systems: all flavors of threshold automata
- Round-by-round fault detectors (extended abstract), unifying synchrony and asynchrony
- SMT and POR beat counter abstraction: parameterized model checking of threshold-based distributed algorithms
- Synchrony weakened by message adversaries vs asynchrony restricted by failure detectors
- The Building Blocks of Consensus
- The failure detector abstraction
- The Heard-Of model: computing in distributed systems with benign faults
- The Theta-Model: achieving synchrony without clocks
- The weakest failure detector for solving consensus
- Tolerating corrupted communication
- Unreliable failure detectors for reliable distributed systems
- Verification of consensus algorithms using satisfiability solving
- Verification of randomized consensus algorithms under round-rigid adversaries
This page was built for publication: Characterizing Consensus in the Heard-Of Model
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5089273)
