Generalized Universality

DOI10.1007/978-3-642-23217-6_2zbMath1343.68168OpenAlexW2912462864MaRDI QIDQ3090818

Eli Gafni, Rachid Guerraoui

Publication date: 2 September 2011

Published in: CONCUR 2011 – Concurrency Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-23217-6_2

zbMATH Keywords

universalitystate machine replication\(k\)-set consensus

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (7)

Distributed universality ⋮ From wait-free to arbitrary concurrent solo executions in colorless distributed computing ⋮ On the uncontended complexity of anonymous agreement ⋮ Randomized \(k\)-set agreement in crash-prone and Byzantine asynchronous systems ⋮ Optimal algorithms for synchronous Byzantine \(k\)-set agreement ⋮ Wait-freedom with advice ⋮ Contention-related crash failures: definitions, agreement algorithms, and impossibility results

Cites Work

• More \(choices\) allow more \(faults\): Set consensus problems in totally asynchronous systems
• The \(k\)-simultaneous consensus problem
• Round-by-round fault detectors (extended abstract)
• The topological structure of asynchronous computability
• Impossibility of distributed consensus with one faulty process
• Time, clocks, and the ordering of events in a distributed system
• Wait-Free k-Set Agreement is Impossible: The Topology of Public Knowledge
• Generalized FLP impossibility result for t-resilient asynchronous computations
• Unnamed Item

This page was built for publication: Generalized Universality