Structured Derivation of Semi-Synchronous Algorithms

DOI10.1007/978-3-642-24100-0_37zbMATH Open1350.68038OpenAlexW62438899MaRDI QIDQ3095340FDOQ3095340

Authors: Hagit Attiya, Fatemeh Borran, Martin Hutle, Zarko Milosevic, A. 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

Recommendations

• scientific article; zbMATH DE number 222692
• An algorithmic framework for synthesis of concurrent programs
• On the synchronization of semi-traces
• scientific article; zbMATH DE number 1830933
• A fully parallel calculus of synchronizing processes
• Denotational fixed-point semantics for constructive scheduling of synchronous concurrency
• scientific article
• Publication:4941147
• Synthesis and Asynchronous Implementation of Algorithms Using a Generalized P-Function Concept
• Structuring and verifying distributed algorithms

zbMATH Keywords

set consensussemi-synchronous systemsterminating reliable broadcasttimely announced broadcast

Mathematics Subject Classification ID

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

Cites Work

• Authenticated Algorithms for Byzantine Agreement
• More \(choices\) allow more \(faults\): Set consensus problems in totally asynchronous systems
• Round-by-round fault detectors (extended abstract), unifying synchrony and asynchrony
• Title not available (Why is that?)
• Unifying synchronous and asynchronous message-passing models
• Fast set agreement in the presence of timing uncertainty
• Tight bounds for \(k\)-set agreement
• Concurrent computing and shellable complexes
• Bounds on the time to reach agreement in the presence of timing uncertainty
• Time bounds for decision problems in the presence of timing uncertainty and failures
• Title not available (Why is that?)
• Time bounds for real-time process control in the presence of timing uncertainty
• Consensus in the presence of timing uncertainty
• A compiler that increases the fault tolerance of asynchronous protocols

Cited In (5)

• Derivation of heard-of predicates from elementary behavioral patterns
• Synthesis and Asynchronous Implementation of Algorithms Using a Generalized P-Function Concept
• Message and time efficient consensus protocols for synchronous distributed systems
• Automatic Refinement of Split Binary Semaphore
• The topology of distributed adversaries

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3095340)