On the expected time for Herman's probabilistic self-stabilizing algorithm

In this article we investigate the expected time for Herman's probabilistic self-stabilizing algorithm in distributed systems: suppose that the number of identical processes in a unidirectional ring, say n, is odd and n⩾3. If the initial configuration of the ring is not “legitimate”, that is, the number of tokens differs from one, then execution of the algorithm made up of synchronous probabilistic procedures with a local parameter 0