Ramifications of metastability in bit variables explored via Simpson's 4-slot mechanism

DOI10.1007/s00165-004-0042-9zbMath1061.68116OpenAlexW2039656854WikidataQ125622487 ScholiaQ125622487MaRDI QIDQ1764429

Xianqiang Yang

Publication date: 24 February 2005

Published in: Formal Aspects of Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00165-004-0042-9

zbMATH Keywords

MetastabilityAtomicFreshnessSafeSimpson's 4-slot ACMWait-free

Mathematics Subject Classification ID

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

Related Items

Splitting atoms safely ⋮ Inter-process buffers in separation logic with rely-guarantee ⋮ Splitting Atoms with Rely/Guarantee Conditions Coupled with Data Reification ⋮ Explanation of two non-blocking shared-variable communication algorithms ⋮ Elucidating concurrent algorithms via layers of abstraction and reification