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
Quantitative languages defined by functional automata
TL;DR: This paper investigates functional weighted automata for four different measures: the sum, the mean, the discounted sum of weights along edges and the ratio between rewards and costs, and shows that functionality is decidable for the four measures.
Journal ArticleDOI
The 4th reactive synthesis competition (SYNTCOMP 2017): Benchmarks, participants & results
Swen Jacobs,Nicolas Basset,Roderick Bloem,Romain Brenguier,Maximilien Colange,Peter Faymonville,Bernd Finkbeiner,Ayrat Khalimov,Felix Klein,Thibaud Michaud,Guillermo A. Pérez,Jean-François Raskin,Ocan Sankur,Leander Tentrup +13 more
TL;DR: In this paper, the authors present the participants of SYNTCOMP 2017, with a focus on changes with respect to the previous years and on the two completely new tools that have entered the competition.
Proceedings ArticleDOI
The complexity of admissibility in Omega-regular games
TL;DR: This paper settles the exact complexity of natural decision problems on the set of strategies that survive iterated elimination of dominated strategies and obtains automata which recognize all the possible outcomes of such strategies.
Journal Article
Monotonic Extensions of Petri Nets: Forward and Backward Search Revisited.
TL;DR: An efficient data structure to represent infinite downward closed sets of markings and to compute symbolically the minimal coverability set of Petri Nets are proposed and a general strategy to use both the forward and the backward approach for the efficient verification of general Transfer Nets is proposed.
Book ChapterDOI
Symbolic Representation of Upward-Closed Sets
TL;DR: BDD-like data structures are provided to represent in a compact way collections of upwards closed sets over numerical domains to turn the abstract algorithm of [ACJT96,FS99] into a practical method.