19 citations · 19 across the 2 of their papers we have counts for
Showing cs.FLShow all
2 papers · 1 filter
cs.FL2011
Decidable Problems for Probabilistic Automata on Infinite Words
Krishnendu Chatterjee, Mathieu Tracol
We consider probabilistic automata on infinite words with acceptance defined by parity conditions. We consider three qualitative decision problems: (i) the positive decision proble…
cs.FL2011★ 19 cited
Computing Distances between Probabilistic Automata
Mathieu Tracol, Josée Desharnais, Abir Zhioua
We present relaxed notions of simulation and bisimulation on Probabilistic Automata (PA), that allow some error epsilon. When epsilon is zero we retrieve the usual notions of bisim…