Structured Derivation of Semi-Synchronous Algorithms

DOI10.1007/978-3-642-24100-0_37zbMath1350.68038OpenAlexW62438899MaRDI QIDQ3095340

Fatemeh Borran, Martin Hutle, Zarko Milosevic, Hagit Attiya, André Schiper

Publication date: 28 October 2011

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: http://infoscience.epfl.ch/record/169704

zbMATH Keywords

set consensussemi-synchronous systemsterminating reliable broadcasttimely announced broadcast

Mathematics Subject Classification ID

Distributed systems (68M14) Network protocols (68M12) Distributed algorithms (68W15)

Related Items

The topology of distributed adversaries

Cites Work

• Unnamed Item
• Unnamed Item
• More \(choices\) allow more \(faults\): Set consensus problems in totally asynchronous systems
• Time bounds for real-time process control in the presence of timing uncertainty
• Unifying synchronous and asynchronous message-passing models
• Round-by-round fault detectors (extended abstract)
• Fast set agreement in the presence of timing uncertainty
• Tight bounds for k -set agreement
• Authenticated Algorithms for Byzantine Agreement
• Concurrent Computing and Shellable Complexes
• A compiler that increases the fault tolerance of asynchronous protocols
• Bounds on the time to reach agreement in the presence of timing uncertainty
• Consensus in the presence of timing uncertainty
• Time bounds for decision problems in the presence of timing uncertainty and failures

This page was built for publication: Structured Derivation of Semi-Synchronous Algorithms