A classic solution technique for Markov decision processes (MDP) and
sto...
Model checking undiscounted reachability and expected-reward properties ...
Recently, decision trees (DT) have been used as an explainable represent...
While value iteration (VI) is a standard solution approach to simple
sto...
We consider the problem of computing minimum and maximum probabilities o...
Stochastic games combine controllable and adversarial non-determinism wi...
Stochastic games combine controllable and adversarial non-determinism wi...
Recent advances have shown how decision trees are apt data structures fo...
Simple stochastic games are turn-based 2.5-player zero-sum graph games w...
Simple stochastic games are turn-based 2.5-player zero-sum graph games w...
We study turn-based stochastic zero-sum games with lexicographic prefere...
Decision tree learning is a popular classification technique most common...
Simple stochastic games are turn-based 2.5-player games with a reachabil...
For hybrid Markov decision processes, UPPAAL Stratego can compute strate...
Statistical model checking (SMC) is a technique for analysis of probabil...
Simple stochastic games can be solved by value iteration (VI), which yie...