41 citations · 51 across the 8 of their papers we have counts for
6 papers · 1 filter
On the Succinctness of Good-for-MDPs Automata
Sven Schewe, Qiyi Tang
Good-for-MDPs and good-for-games automata are two recent classes of nondeterministic automata that reside between general nondeterministic and deterministic automata. Deterministic…
A novel family of finite automata for recognizing and learning -regular languages
Yong Li, Sven Schewe, Qiyi Tang
Families of DFAs (FDFAs) have recently been introduced as a new representation of -regular languages. They target ultimately periodic words, with acceptors revolving around acce…
On Good-for-MDPs Automata
Sven Schewe, Qiyi Tang, Tansholpan Zhanabekova
Nondeterministic good-for-MDPs (GFM) automata are for MDP model checking and reinforcement learning what good-for-games (GFG) automata are for reactive synthesis: a more compact al…
Approximate Bisimulation Minimisation
Stefan Kiefer, Qiyi Tang
We propose polynomial-time algorithms to minimise labelled Markov chains whose transition probabilities are not known exactly, have been perturbed, or can only be obtained by sampl…
Comparing Labelled Markov Decision Processes
Stefan Kiefer, Qiyi Tang
A labelled Markov decision process is a labelled Markov chain with nondeterminism, i.e., together with a strategy a labelled MDP induces a labelled Markov chain. The model is relat…
Computing Probabilistic Bisimilarity Distances for Probabilistic Automata
Giorgio Bacci, Giovanni Bacci, Kim G. Larsen +3
The probabilistic bisimilarity distance of Deng et al. has been proposed as a robust quantitative generalization of Segala and Lynch's probabilistic bisimilarity for probabilistic…