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 a less than strongly fair scheduler or for system topologies with maximum node degree greater than two. We present then a self-stabilizing Byzantine-tolerant solution to asynchronous unison for chain and ring topologies under the central strongly fair daemon. Our algorithm has minimum possible containment radius and optimal stabilization time. ► Self-stabilizing systems tolerate transient faults but do not tolerate permanent ones. ► Fault-tolerant and self-stabilizing systems tolerate both transient and crash faults. ► Strict-stabilizing systems tolerate both transient and byzantine faults.► Unison is a weak digital clock synchronization problem. ► Possibility cases of unison are identical in strictly stabilizing and FTSS settings.