6 citations · 9 across the 5 of their papers we have counts for
Showing 2009Show all
2 papers · 1 filter
cs.DS2009★ 3 cited
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…
cs.LO2009
Comparison of Algorithms for Checking Emptiness on Buechi Automata
Andreas Gaiser, Stefan Schwoon
We re-investigate the problem of LTL model-checking for finite-state systems. Typical solutions, like in Spin, work on the fly, reducing the problem to Buechi emptiness. This can b…