The probabilistic model checker Storm
We present the probabilistic model checker Storm. Storm supports the analysis of discrete-
and continuous-time variants of both Markov chains and Markov decision processes. Storm …
and continuous-time variants of both Markov chains and Markov decision processes. Storm …
[PDF][PDF] Shielded decision-making in MDPs
A prominent problem in artificial intelligence and machine learning is the safe exploration of
an environment. In particular, reinforcement learning is a wellknown technique to determine …
an environment. In particular, reinforcement learning is a wellknown technique to determine …
Compositional probabilistic model checking with string diagrams of MDPs
We present a compositional model checking algorithm for Markov decision processes, in
which they are composed in the categorical graphical language of string diagrams. The …
which they are composed in the categorical graphical language of string diagrams. The …
The 10,000 facets of MDP model checking
This paper presents a retrospective view on probabilistic model checking. We focus on
Markov decision processes (MDPs, for short). We survey the basic ingredients of MDP …
Markov decision processes (MDPs, for short). We survey the basic ingredients of MDP …
A hardware/software stack for heterogeneous systems
J Castrillon, M Lieber, S Klüppelholz… - … on Multi-Scale …, 2017 - ieeexplore.ieee.org
Plenty of novel emerging technologies are being proposed and evaluated today, mostly at
the device and circuit levels. It is unclear what the impact of different new technologies at the …
the device and circuit levels. It is unclear what the impact of different new technologies at the …
Bi-objective lexicographic optimization in Markov decision processes with related objectives
D Busatto-Gaston, D Chakraborty, A Majumdar… - … for Verification and …, 2023 - Springer
We consider lexicographic bi-objective problems on Markov Decision Processes (MDPs),
where we optimize one objective while guaranteeing optimality of another. We propose a …
where we optimize one objective while guaranteeing optimality of another. We propose a …
Multi-cost bounded tradeoff analysis in MDP
We provide a memory-efficient algorithm for multi-objective model checking problems on
Markov decision processes (MDPs) with multiple cost structures. The key problem at hand is …
Markov decision processes (MDPs) with multiple cost structures. The key problem at hand is …
Multi-cost bounded reachability in MDP
We provide an efficient algorithm for multi-objective model-checking problems on Markov
decision processes (MDPs) with multiple cost structures. The key problem at hand is to …
decision processes (MDPs) with multiple cost structures. The key problem at hand is to …
On Skolem-hardness and saturation points in Markov decision processes
J Piribauer, C Baier - arXiv preprint arXiv:2004.11441, 2020 - arxiv.org
The Skolem problem and the related Positivity problem for linear recurrence sequences are
outstanding number-theoretic problems whose decidability has been open for many …
outstanding number-theoretic problems whose decidability has been open for many …
Conditional value-at-risk for reachability and mean payoff in Markov decision processes
J Křetínský, T Meggendorfer - Proceedings of the 33rd Annual ACM …, 2018 - dl.acm.org
We present the conditional value-at-risk (CVaR) in the context of Markov chains and Markov
decision processes with reachability and mean-payoff objectives. CVaR quantifies risk by …
decision processes with reachability and mean-payoff objectives. CVaR quantifies risk by …