On Byzantine generals with alternative plans

Miguel Correia; Alysson Neves Bessani; Paulo Veríssimo

doi:10.1016/j.jpdc.2008.04.008

On Byzantine generals with alternative plans

Miguel Correia, Alysson Neves Bessani, Paulo Veríssimo

Research output: Contribution to journal › Article › peer-review

12 Scopus citations

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	https://doi.org/10.1016/j.jpdc.2008.04.008
State	Published - Sep 1 2008
Externally published	Yes

ASJC Scopus subject areas

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

Access to Document

10.1016/j.jpdc.2008.04.008

Cite this

@article{0a042cd9a163458ea791f47718896543,

title = "On Byzantine generals with alternative plans",

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. {\textcopyright} 2008 Elsevier Inc. All rights reserved.",

author = "Miguel Correia and Bessani, {Alysson Neves} and Paulo Ver{\'i}ssimo",

note = "Generated from Scopus record by KAUST IRTS on 2021-03-16",

year = "2008",

month = sep,

day = "1",

doi = "10.1016/j.jpdc.2008.04.008",

language = "English (US)",

volume = "68",

pages = "1291--1296",

journal = "Journal of Parallel and Distributed Computing",

issn = "0743-7315",

publisher = "Academic Press Inc.",

number = "9",

}

TY - JOUR

T1 - On Byzantine generals with alternative plans

AU - Correia, Miguel

AU - Bessani, Alysson Neves

AU - Veríssimo, Paulo

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

PY - 2008/9/1

Y1 - 2008/9/1

N2 - 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.

AB - 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.

UR - https://linkinghub.elsevier.com/retrieve/pii/S0743731508000786

UR - http://www.scopus.com/inward/record.url?scp=48849084135&partnerID=8YFLogxK

U2 - 10.1016/j.jpdc.2008.04.008

DO - 10.1016/j.jpdc.2008.04.008

M3 - Article

SN - 0743-7315

VL - 68

SP - 1291

EP - 1296

JO - Journal of Parallel and Distributed Computing

JF - Journal of Parallel and Distributed Computing

IS - 9

ER -

On Byzantine generals with alternative plans

Abstract

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this