2 citations · 4 across the 4 of their papers we have counts for
Showing 2011Show all
2 papers · 1 filter
cs.DS2011★ 2 cited
On Stabilization in Herman's Algorithm
Stefan Kiefer, Andrzej Murawski, Joël Ouaknine +2
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…
cs.FL2011★ 1 cited
Efficient Analysis of Probabilistic Programs with an Unbounded Counter
Tomas Brazdil, Stefan Kiefer, Antonin Kucera
We show that a subclass of infinite-state probabilistic programs that can be modeled by probabilistic one-counter automata (pOC) admits an efficient quantitative analysis. In parti…