9 citations · 9 across the 1 of their papers we have counts for
1 paper
Kittiphon Phalakarn, Toru Takisaka, Thomas Haas +1
Solving stochastic games with the reachability objective is a fundamental problem, especially in quantitative verification and synthesis. For this purpose, bounded value iteration…