Self-Stabilizing Byzantine Asynchronous Unison - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 2009

Self-Stabilizing Byzantine Asynchronous Unison


We explore asynchronous unison in the presence of systemic transient and permanent Byzantine faults in shared memory. We observe that the problem is not solvable under less than strongly fair scheduler or for system topologies with maximum node degree greater than two. We present a self-stabilizing Byzantine-tolerant solution to asynchronous unison for chain and ring topologies. Our algorithm has minimum possible containment radius and optimal stabilization time.
Fichier principal
Vignette du fichier
DGNT09.pdf (252.21 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

inria-00437691 , version 1 (01-12-2009)


  • HAL Id : inria-00437691 , version 1
  • ARXIV : 0912.0134


Swan Dubois, Maria Gradinariu Potop-Butucaru, Mikhail Nesterenko, Sébastien Tixeuil. Self-Stabilizing Byzantine Asynchronous Unison. [Research Report] ???. 2009, pp.15. ⟨inria-00437691⟩
143 View
207 Download



Gmail Facebook X LinkedIn More