Consensus using omega in asynchronous systems with unknown membership and degenerative Byzantine failures

DOI10.1016/j.jcss.2019.06.003zbMath1436.68044OpenAlexW2968836859WikidataQ127390433 ScholiaQ127390433MaRDI QIDQ2009633

José Luis López-Presa, Javier Martín-Rueda, Ernesto Jiménez

Publication date: 29 November 2019

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jcss.2019.06.003

zbMATH Keywords

distributed algorithmsconsensusomega failure detectorByzantine failuresunknown membership

Mathematics Subject Classification ID

Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15) Distributed algorithms (68W15)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Consensus in the presence of mortal Byzantine faulty processes
• Implementing unreliable failure detectors with unknown membership
• Asynchronous byzantine agreement protocols
• On implementing omega in systems with weak reliability and synchrony assumptions
• Distributed agreement in the presence of processor and communication faults
• Asynchronous consensus and broadcast protocols
• Impossibility of distributed consensus with one faulty process
• On the minimal synchronism needed for distributed consensus
• Reaching Agreement in the Presence of Faults
• The Byzantine Generals Problem
• Time, clocks, and the ordering of events in a distributed system
• Unreliable failure detectors for reliable distributed systems
• The weakest failure detector for solving consensus
• Wait-freedom vs. t-resiliency and the robustness of wait-free hierarchies (extended abstract)

This page was built for publication: Consensus using omega in asynchronous systems with unknown membership and degenerative Byzantine failures