Distributed consensus, revisited

DOI10.1007/s00236-007-0052-1zbMath1151.68036OpenAlexW2027330435WikidataQ62041656 ScholiaQ62041656MaRDI QIDQ2458442

Uwe Nestmann, Massimo Merro, Rachele Fuzzati

Publication date: 31 October 2007

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00236-007-0052-1

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Reliability, testing and fault tolerance of networks and computer systems (68M15)

Related Items (1)

Fault-tolerant multiparty session types

Uses Software

• UNITY

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Focus points and convergent process operators: A proof strategy for protocol verification
• Formal verification of a leader election protocol in process algebra
• Composition and behaviors of probabilistic I/O automata
• Revisiting the PAXOS algorithm
• Forward and backward simulations. I. Untimed Systems
• Impossibility of distributed consensus with one faulty process
• Unreliable failure detectors for reliable distributed systems
• The weakest failure detector for solving consensus
• A Fault Tolerance Bisimulation Proof for Consensus (Extended Abstract)
• Advances in Computing Science – ASIAN 2003. Progamming Languages and Distributed Computation Programming Languages and Distributed Computation
• CONCUR 2003 - Concurrency Theory

This page was built for publication: Distributed consensus, revisited