52 citations · 206 across the 25 of their papers we have counts for
4 papers · 1 filter
Efficient reduction of nondeterministic automata with application to language inclusion testing
Lorenzo Clemente, Richard Mayr
We present efficient algorithms to reduce the size of nondeterministic Büchi word automata (NBA) and nondeterministic finite word automata (NFA), while retaining their languages. A…
On Strong Determinacy of Countable Stochastic Games
Stefan Kiefer, Richard Mayr, Mahsa Shirmohammadi +1
We study 2-player turn-based perfect-information stochastic games with countably infinite state space. The players aim at maximizing/minimizing the probability of a given event (i.…
Parity Objectives in Countable MDPs
Stefan Kiefer, Richard Mayr, Mahsa Shirmohammadi +1
We study countably infinite MDPs with parity objectives, and special cases with a bounded number of colors in the Mostowski hierarchy (including reachability, safety, Buchi and co-…
MDPs with Energy-Parity Objectives
Richard Mayr, Sven Schewe, Patrick Totzke +1
Energy-parity objectives combine -regular with quantitative objectives of reward MDPs. The controller needs to avoid to run out of energy while satisfying a parity objective. We…