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
Journal ArticleDOI
Percentile queries in multi-dimensional Markov decision processes
TL;DR: This work shows how to compute a single strategy to enforce that for all dimensions i, the probability of outcomes, satisfyingf_i(\rho ) \ge v_i$$fi(ρ)≥vi is at least $$\alpha _i$$αi.
Posted Content
The Complexity of Admissibility in Omega-Regular Games
TL;DR: In this article, the exact complexity of natural decision problems on the set of strategies that survive iterated elimination of dominated strategies is studied, and the authors obtain automata which recognize all the possible outcomes of such strategies.
Journal ArticleDOI
The Second Reactive Synthesis Competition (SYNTCOMP 2015)
Swen Jacobs,Roderick Bloem,Romain Brenguier,Robert Könighofer,Guillermo A. Pérez,Jean-François Raskin,Leonid Ryzhyk,Ocan Sankur,Martina Seidl,Leander Tentrup,Adam Walker +10 more
TL;DR: The second reactive synthesis competition (SYNTCOMP2015) as mentioned in this paper was the first edition of the challenge, with 6 completely new sets of benchmarks, and additional challenging instances for 4 of the benchmark sets.
Proceedings ArticleDOI
Multidimensional beyond Worst-Case and Almost-Sure Problems for Mean-Payoff Objectives
TL;DR: The multidimensional BAS threshold problem is solvable in P. This solves the infinite-memory threshold problem left open by Bruyère et al., and this complexity cannot be improved without improving the currently known complexity of classical mean-payoff games.
Book ChapterDOI
Durations, Parametric Model-Checking in Timed Automata with Presburger Arithmetic
TL;DR: Given a timed automaton, it is shown that the set of durations of runs starting from a region and ending in another region is definable in the arithmetic of Presburger or in the theory of the reals when the time domain is dense.