“On Byzantine Generals with Alternative Plans”

From Navigators

(Difference between revisions)

Jcraveiro (Talk | contribs)
(NavsPubsFull5.xml import (201201141459, full reimport with new ids for legacy pubs avoiding collisions))

Latest revision as of 14:41, 14 January 2013

Miguel Correia, Alysson Bessani, Paulo Veríssimo

Journal of Parallel and Distributed Computing, Vol. 68, Issue 9, pages 1291-1296, Elsevier., Sept. 2008.

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.