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
Proceedings ArticleDOI
Weak Subgame Perfect Equilibria and their Application to Quantitative Reachability
TL;DR: In this paper, the existence of weak subgame perfect equilibria was shown to be decidable for n-player turn-based games played on a finite directed graph, where players who deviate cannot use the full class of strategies but only a subclass with a finite number of deviation steps.
Proceedings ArticleDOI
On delay and regret determinization of max-plus automata
TL;DR: In this article, the determinability of weighted automata over the semiring (Z ∪ {--- ∞}, max, +) is a long-standing open question, and two ways of approaching it by constraining the search space of deterministic WA: k-delay and r-regret.
Journal ArticleDOI
The 3rd Reactive Synthesis Competition (SYNTCOMP 2016): Benchmarks, Participants & Results
Swen Jacobs,Roderick Bloem,Romain Brenguier,Ayrat Khalimov,Felix Klein,Robert Könighofer,Jens U. Kreber,Alexander Legg,Nina Narodytska,Guillermo A. Pérez,Jean-François Raskin,Leonid Ryzhyk,Ocan Sankur,Martina Seidl,Leander Tentrup,Adam Walker +15 more
TL;DR: The SYNTCOMP 2016 benchmark library has been extended to benchmarks in the new LTL-based temporal logic synthesis format (TLSF), and two new sets of benchmarks for the existing AIGER-based format for safety specifications.
Journal ArticleDOI
On the ω-language expressive power of extended petri nets
TL;DR: This paper compares the expressive power of Petri nets extended with non-blocking arcs and Petrinets extended with transfer arcs, in terms of ω-languages, and shows that the hierarchy of expressive powers of those models is strict.
Proceedings ArticleDOI
On the complexity of heterogeneous multidimensional quantitative games
TL;DR: It is shown that CNF/DNF Boolean combinations for heterogeneous measures taken among {WMP, Inf, Sup, LimInf, LimSup} lead to EXPTIME-completeness with exponential memory strategies for both players.