Cutoff bounds for consensus algorithms
From MaRDI portal
Publication:2164223
DOI10.1007/978-3-319-63390-9_12zbMath1494.68025OpenAlexW2735459691MaRDI QIDQ2164223
Christoph Sprenger, Ognjen Marić, David A. Basin
Publication date: 12 August 2022
Full work available at URL: https://doi.org/10.1007/978-3-319-63390-9_12
consensus algorithmfault-tolerant distributed algorithmscommunication predicatecut-off boundarysmall scope hypothesis
Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15) Distributed algorithms (68W15)
Related Items (9)
A case study on parametric verification of failure detectors ⋮ Survey on Parameterized Verification with Threshold Automata and the Byzantine Model Checker ⋮ Derivation of Heard-of Predicates from Elementary Behavioral Patterns ⋮ Synthesis of distributed algorithms with parameterized threshold guards ⋮ Eliminating message counters in synchronous threshold automata ⋮ Reachability in Parameterized Systems: All Flavors of Threshold Automata ⋮ Higher-order quantifier elimination, counter simulations and fault-tolerant systems ⋮ Characterizing Consensus in the Heard-Of Model ⋮ Unnamed Item
This page was built for publication: Cutoff bounds for consensus algorithms
