Revisiting the PAXOS algorithm
type: Item
instance of: scholarly article
title: Revisiting the PAXOS algorithm
zbMATH Open document ID: 0944.68102
DOI: 10.1016/S0304-3975(00)00042-6
author: R. D. Prisco
author: Butler Lampson
author: Nancy Lynch
published in: Theoretical Computer Science
publication date: 2000-08-21T00:00:00Z
Mathematics Subject Classification ID: 68Q45
zbMATH DE Number: 1493432
zbMATH Keywords: I/O automata models
zbMATH Keywords: formal verification
zbMATH Keywords: distributed consensus
zbMATH Keywords: partially synchronous systems
zbMATH Keywords: fault-tolerance
MaRDI profile type: Publication
cites work: The weakest failure detector for solving consensus
cites work: Unreliable failure detectors for reliable distributed systems
cites work: Fail-awareness in timed asynchronous systems
cites work: On the minimal synchronism needed for distributed consensus
cites work: Specifying and using a partitionable group communication service
cites work: Q3666268
cites work: Impossibility of distributed consensus with one faulty process
cites work: Increasing the resilience of distributed and replicated database systems
cites work: Q3126969
cites work: Forward and backward simulations. II: Timing-based systems
cites work: Action transducers and timed automata
cites work: A theory of clock synchronization (extended abstract)
cites work: Reaching Agreement in the Presence of Faults
full work available at URL: s0304-3975(00)00042-6
OpenAlex ID: W2136259232
description: scientific article; zbMATH DE number 1493432