Abstract
This paper proposes a variation of the Byzantine generals problem (or Byzantine consensus). Each general has a set of good plans and a set of bad plans. The problem is to make all loyal generals agree on a good plan proposed by a loyal general, and never on a bad plan. © 2008 Elsevier Inc. All rights reserved.
Original language | English (US) |
---|---|
Pages (from-to) | 1291-1296 |
Number of pages | 6 |
Journal | Journal of Parallel and Distributed Computing |
Volume | 68 |
Issue number | 9 |
DOIs | |
State | Published - Sep 1 2008 |
Externally published | Yes |
Bibliographical note
Generated from Scopus record by KAUST IRTS on 2021-03-16ASJC Scopus subject areas
- Artificial Intelligence
- Hardware and Architecture
- Theoretical Computer Science
- Software
- Computer Networks and Communications