On Byzantine generals with alternative plans

Miguel Correia, Alysson Neves Bessani, Paulo Veríssimo

Research output: Contribution to journalArticlepeer-review

12 Scopus citations


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 languageEnglish (US)
Pages (from-to)1291-1296
Number of pages6
JournalJournal of Parallel and Distributed Computing
Issue number9
StatePublished - Sep 1 2008
Externally publishedYes

Bibliographical note

Generated from Scopus record by KAUST IRTS on 2021-03-16

ASJC Scopus subject areas

  • Artificial Intelligence
  • Hardware and Architecture
  • Theoretical Computer Science
  • Software
  • Computer Networks and Communications


Dive into the research topics of 'On Byzantine generals with alternative plans'. Together they form a unique fingerprint.

Cite this