We consider the Sequential Probability Ratio Test applied to Hidden Mark...
We study countably infinite stochastic 2-player games with reachability
...
We propose polynomial-time algorithms to minimise labelled Markov chains...
We use results from communication complexity, both new and old ones, to ...
(Multi-type) branching processes are a natural and well-studied model fo...
We aim at measuring the influence of the nondeterministic choices of a p...
The Transience objective is not to visit any state infinitely often. Whi...
We consider Hidden Markov Models that emit sequences of observations tha...
Given two weighted automata, we consider the problem of whether one is b...
We study countably infinite MDPs with parity objectives. Unlike in finit...
We analyze algorithmic problems in finitely generated semigroups of
two-...
Value iteration is a fundamental algorithm for solving Markov Decision
P...
We study the complexity of evaluating powered functions implemented by
s...
We study selective monitors for labelled Markov chains. Monitors observe...
We prove results on the decidability and complexity of computing the tot...
We study the bisimilarity problem for probabilistic pushdown automata (p...