A Sound Foundation for the Topological Approach to Task Solvability

DOI10.4230/LIPICS.CONCUR.2019.34OpenAlexW2970521133MaRDI QIDQ5875396FDOQ5875396

Authors: Jérémy Ledent, Samuel Mimram 

Publication date: 3 February 2023

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

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

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)

Cites Work

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

Cited In (2)

• Impure Simplicial Complexes: Complete Axiomatization
• STACS 2004

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)