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
Durations and parametric model-checking in timed automata
TL;DR: It is shown that the set of durations of runs starting from a region and ending in another region is definable in Presburger arithmetic or in a real arithmetic when the time domain is dense, and that the parametric model-checking problem for the logic TCTL can be solved algorithmically.
Book ChapterDOI
On the Existence of Weak Subgame Perfect Equilibria
TL;DR: The recently introduced notion of weak subgame perfect equilibrium weak SPE is focused on, a variant of the classical notion of SPE, where players who deviate can only use strategies deviating from their initial strategy in a finite number of histories.
Journal ArticleDOI
The First Reactive Synthesis Competition (SYNTCOMP 2014)
Swen Jacobs,Roderick Bloem,Romain Brenguier,Rüdiger Ehlers,Timotheus Hell,Robert Könighofer,Guillermo A. Pérez,Jean-François Raskin,Leonid Ryzhyk,Ocan Sankur,Martina Seidl,Leander Tentrup,Adam Walker +12 more
TL;DR: The first iteration of the reactive synthesis competition (SYNTCOMP) as discussed by the authors was based on the controller synthesis problem for finite-state systems and safety specifications, and existing approaches to solve it are summarized in Table 1.
Book ChapterDOI
On reachability for hybrid automata over bounded time
Thomas Brihaye,Laurent Doyen,Gilles Geeraerts,Joël Ouaknine,Jean-François Raskin,James Worrell +5 more
TL;DR: In contrast to the classical (unbounded) reachability problem, the timed-bounded version is decidable for rectangular hybrid automata provided only nonnegative rates are allowed.
Symbolic Data Structure for Sets of k-uples of Integers
Pierre Ganty,Cédric Meuter,Laurent Van Begin,Gabriel Kalyon,Jean-François Raskin,Giorgio Delzanno +5 more
TL;DR: This document presents symbolic algorithm on IST for standard set operations and also introduces some specific operation that can be useful in the context of model-checking.