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
Energy and mean-payoff timed games
TL;DR: This paper identifies a large class of timed games for which their semi-algorithms terminate and are thus complete, and studies in detail the relation between mean-payoff and energy timed games.
Book ChapterDOI
Expand, enlarge, and check: new algorithms for the coverability problem of WSTS
TL;DR: A general algorithmic schema called “Expand, Enlarge and Check” is presented from which new efficient algorithms for the coverability problem of WSTS can be constructed.
Journal ArticleDOI
AbsSynthe: abstract synthesis from succinct safety specifications
TL;DR: In this paper, the authors describe a synthesis algorithm for safety specifications described as circuits, which is based on fixpoint computations, abstraction and refinement, it uses binary decision diagrams as symbolic data structure.
Posted Content
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: The timed-bounded version of the reachability problem for hybrid automata is investigated and it is shown that the problem becomes undecidable if either diagonal constraints or both negative and positive rates are allowed.