Abstraction is a key verification technique to improve scalability. Howe...
We present MULTIGAIN 2.0, a major extension to the controller synthesis ...
We provide a learning-based technique for guessing a winning strategy in...
A classic solution technique for Markov decision processes (MDP) and
sto...
Runtime monitoring provides a more realistic and applicable alternative ...
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...
Simulating chemical reaction networks is often computationally demanding...
Markov decision processes (MDP) and continuous-time MDP (CTMDP) are the
...
We introduce a similarity function on formulae of signal temporal logic
...
Decision-making policies for agents are often synthesized with the const...
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...
Robot capabilities are maturing across domains, from self-driving cars, ...
While abstraction is a classic tool of verification to scale it up, it i...
Decision tree learning is a popular classification technique most common...
We consider concurrent stochastic games played on graphs with reachabili...
Simple stochastic games are turn-based 2.5-player games with a reachabil...
We propose "semantic labelling" as a novel ingredient for solving games ...
For hybrid Markov decision processes, UPPAAL Stratego can compute strate...
Graph games and Markov decision processes (MDPs) are standard models in
...
We introduce a framework for approximate analysis of Markov decision
pro...
Analysis of large continuous-time stochastic systems is a computationall...
Statistical model checking (SMC) is a technique for analysis of probabil...
The maximum reachability probabilities in a Markov decision process can ...
We provide a framework for speeding up algorithms for time-bounded
reach...
This continuously extended technical report collects and compares common...
We investigate the satisfiability and finite satisfiability problem for
...
We present the conditional value-at-risk (CVaR) in the context of Markov...
We present a unified translation of LTL formulas into deterministic Rabi...
We formalize the problem of maximizing the mean-payoff value with high
p...
Simple stochastic games can be solved by value iteration (VI), which yie...
Graph games played by two players over finite-state graphs are central i...
Markov decision processes (MDPs) are standard models for probabilistic
s...