A characterization of eventual Byzantine agreement

SIAM Journal on Computing

Volumn 31, Issue 3, 2002, Pages 838-865

  Halpern, Joseph Y ^a   Moses, Yoram ^a   Waarts, Orli ^a  

^a Department of Computer Science and School of Operations Research and Information Engineering   (United States)

Author keywords

Common knowledge; Continual common knowledge; Eventual Byzantine agreement; Fault tolerance; Optimal protocol

Indexed keywords

ALGORITHMS; FAULT TOLERANT COMPUTER SYSTEMS; KNOWLEDGE BASED SYSTEMS; NETWORK PROTOCOLS;

OPTIMAL PROTOCOL;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 0036304371     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539798340217     Document Type: Article

References (18)

1. A communication-efficient canonical form for fault-tolerant distributed protocols
2. Early stopping in Byzantine agreement
3. Requirements for agreement in a distributed system
4. Knowledge and common knowledge in a Byzantine environment: Crash failures
5. The consensus problem in unreliable distributed systems
6. Knowledge and common knowledge in a distributed environment
7. A guide to completeness and complexity for modal logics of knowledge and belief
8. The complexity of reasoning about knowledge and time, I: Lower bounds
9. Belief as defeasible knowledge
10. Programming simultaneous actions using common knowledge
11. Using knowledge to optimally achieve coordination in distributed systems
12. Concurrent common knowledge: Defining agreement for asynchronous systems
13. Reaching agreement in the presence of faults
14. Distributed agreement in the presence of processor and communication faults