A Characterization of Eventual Byzantine Agreement
From MaRDI portal
Publication:2784483
DOI10.1137/S0097539798340217zbMath1017.68007MaRDI QIDQ2784483
Yoram Moses, Orli Waarts, Joseph Y. Halpern
Publication date: 23 April 2002
Published in: SIAM Journal on Computing (Search for Journal in Brave)
fault-tolerancecommon knowledgeoptimal protocolcontinual common knowledgeeventual Byzantine agreement
Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Distributed algorithms (68W15)
Related Items (14)
Unbeatable consensus ⋮ Common knowledge and consistent simultaneous coordination ⋮ On the bit security of cryptographic primitives ⋮ Optimal Eventual Byzantine Agreement Protocols with Omission Failures ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Knowledge-based programs ⋮ A note on knowledge-based programs and specifications ⋮ Using counterfactuals in knowledge-based programming ⋮ A knowledge-based analysis of global function computation ⋮ The complexity of almost-optimal simultaneous coordination ⋮ Using knowledge to optimally achieve coordination in distributed systems ⋮ Common knowledge revisited
This page was built for publication: A Characterization of Eventual Byzantine Agreement
