J
Jean-François Raskin
Researcher at Université libre de Bruxelles
Publications - 306
Citations - 8087
Jean-François Raskin is an academic researcher from Université libre de Bruxelles. The author has contributed to research in topics: Decidability & Markov decision process. The author has an hindex of 47, co-authored 293 publications receiving 7429 citations. Previous affiliations of Jean-François Raskin include Free University of Brussels & Université de Namur.
Papers
More filters
Book ChapterDOI
Antichains: a new algorithm for checking universality of finite automata
TL;DR: A new algorithm for checking the universality of nondeterministic finite automata, which computes the least fixed point of a monotone function on the lattice of antichains of state sets and evaluates the performance of this algorithm experimentally using the random automaton model recently proposed by Tabakov and Vardi.
Journal ArticleDOI
Faster algorithms for mean-payoff games
TL;DR: A new pseudopolynomial algorithm is presented for solving two-player games played on a weighted graph with mean-payoff objective and with energy constraints, improving the best known worst-case complexity for pseudopoly Nominal mean- payoff algorithms.
Book ChapterDOI
The Regular Real-Time Languages
TL;DR: A specification formalism for reactive systems defines a class of Ω-languages that are definable by fully decidable formalisms and has a decidable satisfiability (nonemptiness) problem.
Journal ArticleDOI
Algorithms for Omega-Regular Games with Imperfect Information
TL;DR: In this article, a fixed-point algorithm for computing the set of states from which a player can win with probability 1 with a randomized observation-based strategy for a Buechi objective is presented.
Book ChapterDOI
Acacia+, a tool for LTL synthesis
TL;DR: Acacia+, a tool for solving the LTL realizability and synthesis problems, is presented, using recent approaches that reduce these problems to safety games, and can be solved efficiently by symbolic incremental algorithms based on antichains.