Affine Tasks for k-Test-and-Set

DOI10.1007/978-3-030-64348-5_12MaRDI QIDQ6487902zbMATH OpenFDO

Authors Petr Kuznetsov, Thibault Rieutord

Publication date 21 March 2023

Full work available at URL https://doi.org/10.1007/978-3-030-64348-5_12

Mathematics Subject Classification ID

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

Recommendations

• Read-write memory and k-set consensus as an affine task
• An asynchronous computability theorem for fair adversaries
• Computable obstructions to wait-free computability
• The Combinatorial Structure of Wait-Free Solvable Tasks
• The topological structure of asynchronous computability

Cited in

(4)

• Read-write memory and k-set consensus as an affine task
• Brief announcement: On decidability of 2-process affine models
• The computational power of distributed shared-memory models with bounded-size registers
• The computational power of distributed shared-memory models with bounded-size registers

This page was built for publication: Affine Tasks for k-Test-and-Set

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