scientific article; zbMATH DE number 1830912

MaRDI QIDQ4778617zbMATH OpenFDO

Authors Francisco Brasileiro, Fabíola Greve, Achour Mostefaoui, Michel Raynal

Publication date 18 November 2002

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2127/21270042

zbMATH Keywords

consensuscrash failuremessage passingasynchronous distributed system

Mathematics Subject Classification ID

Computing methodologies and applications (68U99) Distributed systems (68M14)

Recommendations

• Fast and simple distributed consensus
• One-Step Consensus Solvability
• Necessary and sufficient conditions for broadcast consensus protocols.
• Consensus algorithms with one-bit messages
• Impossibility of distributed consensus with one faulty process

Cited in

(13)

• Lower bounds for asynchronous consensus
• One-Step Consensus Solvability
• Unbeatable consensus
• Necessary and sufficient conditions for broadcast consensus protocols.
• The Heard-Of model: computing in distributed systems with benign faults
• Fast Paxos
• Agreeing within a few writes
• Cloture Votes:n/4-resilient Distributed Consensus int + 1 rounds
• Survey on Parameterized Verification with Threshold Automata and the Byzantine Model Checker
• A simple proof of a simple consensus algorithm
• What you always wanted to know about model checking of fault-tolerant distributed algorithms
• \(\text{Para}^2\): parameterized path reduction, acceleration, and SMT for reachability in threshold-guarded distributed algorithms
• Bosco: One-Step Byzantine Asynchronous Consensus

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4778617)