A constructive proof for FLP

DOI10.1016/J.IPL.2004.06.008zbMATH Open1173.68392OpenAlexW2100506359MaRDI QIDQ834901FDOQ834901

Authors: H. Völzer 

Publication date: 27 August 2009

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2004.06.008

Recommendations

• Mechanical Verification of a Constructive Proof for FLP
• On the nonexistence of resilient consensus protocols
• A simple proof of the uniform consensus synchronous lower bound.
• Impossibility of distributed consensus with one faulty process
• Randomized protocols for asynchronous consensus

zbMATH Keywords

distributed computingconcurrencydistributed systemsfault toleranceconsensus problemformal modelling

Mathematics Subject Classification ID

Reliability, testing and fault tolerance of networks and computer systems (68M15) Distributed systems (68M14)

Cites Work

• Impossibility of distributed consensus with one faulty process

Cited In (2)

• Mechanical Verification of a Constructive Proof for FLP
• Why extension-based proofs fail

This page was built for publication: A constructive proof for FLP

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