A Sound Foundation for the Topological Approach to Task Solvability

DOI10.4230/LIPIcs.CONCUR.2019.34OpenAlexW2970521133MaRDI QIDQ5875396

Jérémy Ledent, Samuel Mimram

Publication date: 3 February 2023

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

zbMATH Keywords

combinatorial topologyasynchronous computabilityprotocol complexdistributed taskfault-tolerant protocols

Mathematics Subject Classification ID

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

Related Items (1)

Impure Simplicial Complexes: Complete Axiomatization

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Abstraction for concurrent objects
• Unifying synchronous and asynchronous message-passing models
• The topological structure of asynchronous computability
• Subconsensus Tasks: Renaming Is Weaker Than Set Agreement
• Unifying Concurrent Objects and Distributed Tasks
• Generalized FLP impossibility result for t-resilient asynchronous computations
• Wait-free k-set agreement is impossible
• Set consensus using arbitrary objects (preliminary version)
• Algebraic spans

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