On Byzantine generals with alternative plans
type: Item
instance of: scholarly article
title: On Byzantine generals with alternative plans
zbMATH Open document ID: 1243.68085
author: Miguel Correia
author: Alysson Neves Bessani
author: Paulo Veríssimo
published in: Journal of Parallel and Distributed Computing
publication date: 2012-07-26T00:00:00Z
Mathematics Subject Classification ID: 68M15
Mathematics Subject Classification ID: 68M14
zbMATH DE Number: 6059823
zbMATH Keywords: distributed computing
zbMATH Keywords: fault tolerance
zbMATH Keywords: Byzantine faults
zbMATH Keywords: agreement
zbMATH Keywords: consensus
describes a project that uses: Linda
MaRDI profile type: Publication
Wikidata QID: Q57603697
full work available at URL: j.jpdc.2008.04.008
OpenAlex ID: W2066682419
cites work: Consensus in Byzantine asynchronous systems
cites work: More \(choices\) allow more \(faults\): Set consensus problems in totally asynchronous systems
cites work: Q3045849
cites work: Impossibility of distributed consensus with one faulty process
cites work: Generative communication in Linda
cites work: Byzantine Fault Detectors for Solving Consensus
cites work: The Byzantine Generals Problem
cites work: Q4527024
DOI: 10.1016/J.JPDC.2008.04.008
description: scientific article; zbMATH DE number 6059823