2 papers
cs.GT2019
Stopping Criteria for Value and Strategy Iteration on Concurrent Stochastic Reachability Games
Julia Eisentraut, Jan Křetínský, Alexej Rotar
We consider concurrent stochastic games played on graphs with reachability and safety objectives. These games can be solved by value iteration as well as strategy iteration, each o…
cs.LO2018
The Satisfiability Problem for Unbounded Fragments of Probabilistic CTL
Jan Křetínský, Alexej Rotar
We investigate the satisfiability and finite satisfiability problem for probabilistic computation-tree logic (PCTL) where operators are not restricted by any step bounds. We establ…