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
Decidable weighted expressions with Presburger combinators
TL;DR: It is shown that important decision problems such as emptiness, universality, inclusion and equivalence are PSpace-C for these expressions, and a decidable and still expressive class of synchronised expressions is introduced.
Posted Content
Decidable Weighted Expressions with Presburger Combinators
TL;DR: In this article, the expressive power and algorithmic properties of weighted expressions are investigated and the decision problems such as emptiness, universality and comparison are PSpace-c for these expressions.
Posted Content
Non-Zero Sum Games for Reactive Synthesis
Romain Brenguier,Lorenzo Clemente,Paul Hunter,Guillermo A. Pérez,Mickael Randour,Jean-François Raskin,Ocan Sankur,Mathieu Sassolas +7 more
TL;DR: In this article, the authors summarize new solution concepts useful for the synthesis of reactive systems in the context of non-zero sum games played on graphs, as part of the contributions obtained in the inVEST project funded by the European Research Council.
Posted Content
Variations on the Stochastic Shortest Path Problem
TL;DR: In this paper, the authors revisited the stochastic shortest path problem and showed how recent results allow one to improve over the classical solutions, and presented algorithms to synthesize strategies with multiple guarantees on the distribution of the length of paths reaching a given target, rather than simply minimizing its expected value.
Posted Content
Percentile Queries in Multi-Dimensional Markov Decision Processes
TL;DR: In this article, the complexity of percentile queries in MDPs with multi-dimensional weights was studied and algorithms to synthesize strategies that enforce such constraints were presented. But the complexity was not studied in the quantitative case.