52 citations · 146 across the 41 of their papers we have counts for
7 papers · 1 filter
Distinguishing Hidden Markov Chains
Stefan Kiefer, A. Prasad Sistla
Hidden Markov Chains (HMCs) are commonly used mathematical models of probabilistic systems. They are employed in various fields such as speech recognition, signal processing, and b…
Tree Buffers
Radu Grigore, Stefan Kiefer
In runtime verification, the central problem is to decide if a given program execution violates a given property. In online runtime verification, a monitor observes a program's exe…
Proving the Herman-Protocol Conjecture
Maria Bruna, Radu Grigore, Stefan Kiefer +2
Herman's self-stabilisation algorithm, introduced 25 years ago, is a well-studied synchronous randomised protocol for enabling a ring of processes collectively holding any odd…
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…
Computing Least Fixed Points of Probabilistic Systems of Polynomials
Javier Esparza, Andreas Gaiser, Stefan Kiefer
We study systems of equations of the form X1 = f1(X1, ..., Xn), ..., Xn = fn(X1, ..., Xn), where each fi is a polynomial with nonnegative coefficients that add up to 1. The least n…
Interprocedural Dataflow Analysis over Weight Domains with Infinite Descending Chains
Morten Kühnrich, Stefan Schwoon, Jiří Srba +1
We study generalized fixed-point equations over idempotent semirings and provide an efficient algorithm for the detection whether a sequence of Kleene's iterations stabilizes after…