A Sound Foundation for the Topological Approach to Task Solvability

DOI10.4230/LIPICS.CONCUR.2019.34MaRDI QIDQ5875396zbMATH OpenOpenAlexFDO

Authors Jérémy Ledent, Samuel Mimram

Publication date 3 February 2023

Full work available at URL https://inria.hal.science/hal-04244357

zbMATH Keywords

asynchronous computabilitycombinatorial topologydistributed taskfault-tolerant protocolsprotocol complex

Mathematics Subject Classification ID

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

Recommendations

• The topological structure of asynchronous computability
• Distributed computing through combinatorial topology
• Computable obstructions to wait-free computability
• scientific article; zbMATH DE number 1559574
• A generalized asynchronous computability theorem

Cites work

• Abstraction for concurrent objects
• Algebraic spans
• Concurrent specifications beyond linearizability
• Distributed computing through combinatorial topology
• Generalized FLP impossibility result for t-resilient asynchronous computations
• scientific article; zbMATH DE number 4110131 (Why is no real title available?)
• Set consensus using arbitrary objects (preliminary version)
• Subconsensus Tasks: Renaming Is Weaker Than Set Agreement
• The topological structure of asynchronous computability
• Unifying Concurrent Objects and Distributed Tasks
• Unifying synchronous and asynchronous message-passing models
• Wait-free k-set agreement is impossible

Cited in

(2)

• STACS 2004
• Impure Simplicial Complexes: Complete Axiomatization

This page was built for publication: A Sound Foundation for the Topological Approach to Task Solvability

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