The Weak Byzantine Generals Problem

DOI10.1145/2402.322398zbMath0627.68026OpenAlexW2116643105WikidataQ29010502 ScholiaQ29010502MaRDI QIDQ3763581

Leslie Lamport

Publication date: 1983

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2402.322398

zbMATH Keywords

distributed systemsagreementinteractive consistency

Mathematics Subject Classification ID

Theory of operating systems (68N25)

Related Items (17)

Easy impossibility proofs for distributed consensus problems ⋮ Agreement under faulty interfaces ⋮ Performance study of Byzantine agreement protocol with artificial neural network ⋮ Time is not a healer ⋮ A process algebra of communicating shared resources with dense time and priorities ⋮ The Failure Discovery problem ⋮ Communication complexity of Byzantine agreement, revisited ⋮ Non-blocking atomic commit in asynchronous distributed systems with failure detectors ⋮ Hundreds of impossibility results for distributed computing ⋮ Interval logics and their decision procedures. I: An interval logic ⋮ Metric temporal logic with durations ⋮ On using temporal logic for refinement and compositional verification of concurrent systems ⋮ Characterization of secure multiparty computation without broadcast ⋮ Lower bounds for weak Byzantine agreement ⋮ Characterization of Secure Multiparty Computation Without Broadcast ⋮ Strong Separations Between Broadcast and Authenticated Channels ⋮ Wait-free implementations in message-passing systems

This page was built for publication: The Weak Byzantine Generals Problem