On stabilization in Herman's algorithm
Herman's algorithm is a synchronous randomized protocol for achieving self-stabilization in a token ring consisting of N processes. The interaction of tokens makes the dynamics of the protocol very difficult to analyze. In this paper we study the expected time to stabilization in terms of the i...
Main Authors: | Kiefer, S, Murawski, A, Ouaknine, J, Worrell, J, Zhang, L |
---|---|
Format: | Journal article |
Language: | English |
Published: |
2011
|
Similar Items
-
Three tokens in Herman's algorithm
by: Kiefer, S, et al.
Published: (2012) -
Proving the Herman-Protocol Conjecture
by: Bruna, M, et al.
Published: (2016) -
Algorithmic probabilistic game semantics
by: Kiefer, S, et al.
Published: (2013) -
Language equivalence for probabilistic automata
by: Kiefer, S, et al.
Published: (2011) -
On the Complexity of the Equivalence Problem for Probabilistic Automata
by: Kiefer, S, et al.
Published: (2012)