Renaming Is Weaker Than Set Agreement But for Perfect Renaming: A Map of Sub-consensus Tasks

DOI10.1007/978-3-642-29344-3_13zbMath1353.68198OpenAlexW1599883215MaRDI QIDQ2894461

Armando Castañeda, Sergio Rajsbaum, Damien Imbs, Michel Raynal

Publication date: 29 June 2012

Published in: LATIN 2012: Theoretical Informatics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-29344-3_13

zbMATH Keywords

symmetry breakingwait-freedom\(k\)-set agreementdistributed computabilityrenamingdecision taskproblem hierarchy

Mathematics Subject Classification ID

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

Related Items (4)

Bounded disagreement ⋮ The solvability of consensus in iterated models extended with safe-consensus ⋮ Generalized Symmetry Breaking Tasks and Nondeterminism in Concurrent Objects ⋮ Untangling Partial Agreement: Iterated x-consensus Simulations

This page was built for publication: Renaming Is Weaker Than Set Agreement But for Perfect Renaming: A Map of Sub-consensus Tasks