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
Percentile queries in multi-dimensional markov decision processes
TL;DR: This paper shows how to compute a single strategy to enforce that for all dimensions i, the probability of outcomes satisfying f_i(\rho ) is at least \(\alpha _i\), and considers classical quantitative payoffs from the literature.
Posted Content
Meet Your Expectations With Guarantees: Beyond Worst-Case Synthesis in Quantitative Games
Véronique Bruyère,Emmanuel Filiot,Mickael Randour,Mickael Randour,Mickael Randour,Jean-François Raskin +5 more
TL;DR: In this article, the authors extend the quantitative synthesis framework by going beyond the worst-case by constructing strategies that guarantee some quantitative requirement in the worst case while providing a higher expected value against a particular stochastic model of the environment given as input.
Book ChapterDOI
Automatic rectangular refinement of affine hybrid systems
TL;DR: This method computes automatically a sequence of rectangular hybrid automata that are increasingly precise overapproximations of the original hybrid automaton, and proves an optimality criterion for successive refinements.
Book ChapterDOI
Abstract Interpretation of Game Properties
Thomas A. Henzinger,Rupak Majumdar,Freddy Y. C. Mang,Jean-François Raskin,Jean-François Raskin +4 more
TL;DR: This work considers two-player concurrent games and specifies properties of such games –say, the component has a winning strategy to obtain a resource, no matter how the environment behaves– in the alternating-time μ-calculus (Aμ).
Proceedings Article
Equivalence of labeled Markov chains
TL;DR: In this article, the equivalence problem for labeled Markov chains (LMCs) was studied, where each state is labeled with an observation, and it was shown that equivalence can be decided in polynomial time.