Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

8

JPDC
2008

favoriteEmaildiscussreport

115views more JPDC 2008»

On Byzantine generals with alternative plans

13 years 4 months ago

On Byzantine generals with alternative plans

Download homepages.di.fc.ul.pt

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. Key words: distributed computing, fault tolerance, Byzantine faults, agreement, consensus

Miguel Correia, Alysson Neves Bessani, Paulo Ver&i

Real-time Traffic

Byzantine | General | JPDC 2008 | Loyal General |

claim paper

Related Content

» Upright cluster services

» Analyzing dispensing plan for emergency medical supplies in the event of bioterrorism

» A probabilistic approach to automated bidding in alternative auctions

» From plans to planning the case of nursing plans

» USASmart Improving the Quality of Plans in Answer Set Planning

» Monitoring Plan Optimality During Execution

» Generating Safe AssumptionBased Plans for Partially Observable Nondeterministic Domains

» Let a Single FLWOR Bloom

» Optimality Properties of Planning Via Petri Net Unfolding A Formal Analysis

Post Info
More Details (n/a)

Added	13 Dec 2010
Updated	13 Dec 2010
Type	Journal
Year	2008
Where	JPDC
Authors	Miguel Correia, Alysson Neves Bessani, Paulo Veríssimo

Comments (0)