The Weak Byzantine Generals Problem
Generate an AI Snapshot to get a quick, structured summary of this paper.
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
It is shown that, like the original Byzantine Generals Problem, the weak version can be solved only ff fewer than one-third of the processes may fad and an approximate solution exists that can tolerate arbaranly many failures.
Abstract
article Free Access Share on The Weak Byzantine Generals Problem Author: L. Lamport Computer Science Laboratory, SRI International, 333 Ravenswood Avenue, Menlo Park, CA Computer Science Laboratory, SRI International, 333 Ravenswood Avenue, Menlo Park, CAView Profile Authors Info & Claims Journal of the ACMVolume 30Issue 3July 1983 pp 668–676https://doi.org/10.1145/2402.322398Published:01 July 1983Publication History 121citation2,197DownloadsMetricsTotal Citations121Total Downloads2,197Last 12 Months411Last 6 weeks88 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my Alerts New Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteeReaderPDF