Brief announcement: On decidability of 2-process affine models

DOI10.4230/LIPICS.DISC.2020.54zbMATH Open1540.68089MaRDI QIDQ6535053

Thibault Rieutord, Petr Kuznetsov

Publication date: 2 November 2023

zbMATH Keywords

decidabilityaffine tasks

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

Cites Work

• Title not available (Why is that?)
• Asynchronous computability theorems for \(t\)-resilient systems
• A generalized asynchronous computability theorem
• Read-Write Memory and k-Set Consensus as an Affine Task
• Three-Processor Tasks Are Undecidable
• An Asynchronous Computability Theorem for Fair Adversaries
• A simple algorithmically reasoned characterization of wait-free computation (extended abstract)

This page was built for publication: Brief announcement: On decidability of 2-process affine models

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