49 citations · 140 across the 23 of their papers we have counts for
4 papers · 2 filters
Two Recursively Inseparable Problems for Probabilistic Automata
Nathanaël Fijalkow, Hugo Gimbert, Florian Horn +1
This paper introduces and investigates decision problems for numberless probabilistic automata, i.e. probabilistic automata where the support of each probabilistic transitions is s…
Controlling a Population
Nathalie Bertrand, Miheer Dewaskar, Blaise Genest +1
We introduce a new setting where a population of agents, each modelled by a finite-state system, are controlled uniformly: the controller applies the same action to every agent. Th…
Emptiness of zero automata is decidable
Mikolaj Bojańczyk, Hugo Gimbert, Edon Kelmendi
Zero automata are a probabilistic extension of parity automata on infinite trees. The satisfiability of a certain probabilistic variant of mso, called tmso + zero, reduces to the e…
A short proof of correctness of the quasi-polynomial time algorithm for parity games
Hugo Gimbert, Rasmus Ibsen-Jensen
Recently Cristian S. Calude, Sanjay Jain, Bakhadyr Khoussainov, Wei Li and Frank Stephan proposed a quasi-polynomial time algorithm for parity games. This paper proposes a short pr…