Generalized Universality

DOI10.1007/978-3-642-23217-6_2MaRDI QIDQ3090818zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Universalities
• Universality
• Absolute generality
• Differential universality
• scientific article; zbMATH DE number 1222676
• On Universals
• Simultaneous universality
• Complex universality
• Distributed Universality
• Distributed universality

Cites work

• scientific article; zbMATH DE number 996442 (Why is no real title available?)
• Generalized FLP impossibility result for t-resilient asynchronous computations
• Impossibility of distributed consensus with one faulty process
• More \(choices\) allow more \(faults\): Set consensus problems in totally asynchronous systems
• Round-by-round fault detectors (extended abstract), unifying synchrony and asynchrony
• The \(k\)-simultaneous consensus problem
• The topological structure of asynchronous computability
• Time, clocks, and the ordering of events in a distributed system
• Wait-Free k-Set Agreement is Impossible: The Topology of Public Knowledge

Cited in

(13)

• Differential universality
• The generalized universal law of generalization.
• scientific article; zbMATH DE number 1950692 (Why is no real title available?)
• 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
• Extended class of phenomenological universalities
• Distributed universality
• Distributed Universality
• From wait-free to arbitrary concurrent solo executions in colorless distributed computing
• A speedup theorem for asynchronous computation with applications to consensus and approximate agreement
• Contention-related crash failures: definitions, agreement algorithms, and impossibility results

This page was built for publication: Generalized Universality

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