The Skolem problem and the related Positivity problem for linear recurrence sequences are
outstanding number-theoretic problems whose decidability has been open for many …

This paper presents an efficient procedure for multi-objective model checking of long-run
average reward (aka: mean pay-off) and total reward objectives as well as their combination …

Abstract (EN) The often huge configuration spaces of modern software systems render the
detection, prediction, and explanation of defects and inadvertent behaviors challenging …

Probabilistische Systeme werden von Umgebungsereignissen beeinflusst, welche mit einer
gewissen Wahrscheinlichkeit auftreten. Damit solche Systeme einwandfrei funktionieren …

The purpose of this paper is to introduce a notion of causality in Markov decision processes
based on the probability-raising principle and to analyze its algorithmic properties. The latter …

Markov automata combine probabilistic branching, exponentially distributed delays and
nondeterminism. This compositional variant of continuous-time Markov decision processes …

The stochastic shortest path problem (SSPP) asks to resolve the non-deterministic choices
in a Markov decision process (MDP) such that the expected accumulated weight before …

In this paper, we are interested in the synthesis of schedulers in double-weighted Markov
decision processes, which satisfy both a percentile constraint over a weighted reachability …

We investigate zero-sum turn-based two-player stochastic games in which the objective of
one player is to maximize the amount of rewards obtained during a play, while the other …

Abstract (EN) The stochastic shortest path problem lies at the heart of many questions in the
formal verification of probabilistic systems. It asks to find a scheduler resolving the non …