8 citations · 12 across the 2 of their papers we have counts for
2 papers
cs.GT2020★ 8 cited
Comparison of Algorithms for Simple Stochastic Games
Jan Křetínský, Emanuel Ramneantu, Alexander Slivinskiy +1
Simple stochastic games are turn-based 2.5-player zero-sum graph games with a reachability objective. The problem is to compute the winning probability as well as the optimal strat…
cs.LO2014★ 4 cited
Probabilistic Bisimulation: Naturally on Distributions
Holger Hermanns, Jan Krčál, Jan Křetínský
In contrast to the usual understanding of probabilistic systems as stochastic processes, recently these systems have also been regarded as transformers of probabilities. In this pa…