8 citations · 25 across the 17 of their papers we have counts for
5 papers · 1 filter
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…
Approximating Values of Generalized-Reachability Stochastic Games
Pranav Ashok, Krishnendu Chatterjee, Jan Kretinsky +2
Simple stochastic games are turn-based 2.5-player games with a reachability objective. The basic question asks whether one player can ensure reaching a given target with at least a…
Semantic Labelling and Learning for Parity Game Solving in LTL Synthesis
Jan Křetínský, Alexander Manta, Tobias Meggendorfer
We propose "semantic labelling" as a novel ingredient for solving games in the context of LTL synthesis. It exploits recent advances in the automata-based approach, yielding more i…
Strategy Representation by Decision Trees with Linear Classifiers
Pranav Ashok, Tomáš Brázdil, Krishnendu Chatterjee +3
Graph games and Markov decision processes (MDPs) are standard models in reactive synthesis and verification of probabilistic systems with nondeterminism. The class of -regular w…
SOS: Safe, Optimal and Small Strategies for Hybrid Markov Decision Processes
Pranav Ashok, Jan Křetínský, Kim Guldstrand Larsen +3
For hybrid Markov decision processes, UPPAAL Stratego can compute strategies that are safe for a given safety property and (in the limit) optimal for a given cost function. Unfortu…