19 citations · 21 across the 2 of their papers we have counts for
2 papers
cs.GT2011★ 19 cited
A reduction from parity games to simple stochastic games
Krishnendu Chatterjee, Nathanaël Fijalkow
Games on graphs provide a natural model for reactive non-terminating systems. In such games, the interaction of two players on an arena results in an infinite path that describes a…
cs.FL2011★ 2 cited
Pushing undecidability of the isolation problem for probabilistic automata
Nathanaël Fijalkow, Hugo Gimbert, Youssouf Oualhadj
This short note aims at proving that the isolation problem is undecidable for probabilistic automata with only one probabilistic transition. This problem is known to be undecidable…