Wait-free solvability of equality negation tasks

DOI10.4230/LIPICS.DISC.2019.21MaRDI QIDQ6487538zbMATH OpenFDO

Authors Éric Goubault, Marijana Lazić, Jérémy Ledent, Sergio Rajsbaum

Publication date 3 February 2023

Full work available at URL https://doi.org/10.4230/LIPICS.DISC.2019.21

zbMATH Keywords

combinatorial topologydistributed computabilityequality negation

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• The Combinatorial Structure of Wait-Free Solvable Tasks
• Computable obstructions to wait-free computability
• The topological structure of asynchronous computability
• A dynamic epistemic logic analysis of equality negation and other epistemic covering tasks
• A dynamic epistemic logic analysis of the equality negation task

Cited in

(8)

• A dynamic epistemic logic analysis of equality negation and other epistemic covering tasks
• A simple constructive computability theorem for wait-free computation
• The Combinatorial Structure of Wait-Free Solvable Tasks
• Sporadic solutions to zero-one exclusion tasks
• Defining logical obstruction with fixpoints in epistemic logic
• Pseudospheres: combinatorics, topology and distributed systems
• A combinatorial topology approach to Arrow's impossibility theorem
• A dynamic epistemic logic analysis of the equality negation task

This page was built for publication: Wait-free solvability of equality negation tasks

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