2026 Jean-François Raskin: Computer Science Researcher – H-Index, Publications & Awards

Discipline name	D-Index	World Ranking	Current World Ranking	National Ranking	Current National Ranking	Publications	Citations
Computer Science	50	5687	5527	63	59	296	8413

Overview

Jean-François Raskin is affiliated with the Université Libre de Bruxelles in Belgium and works predominantly in the field of Computer Science. Their research is focused across several specialized subfields including Artificial Intelligence, Computational Theory and Mathematics, Economics and Econometrics, Management Science and Operations Research, and Software.

Their main research topics cover diverse areas of theoretical and applied computer science, including:

Formal Methods in Verification
Game Theory and Applications
Machine Learning and Algorithms
Logic, programming, and type systems
Semigroups and automata theory
Game Theory and Voting Systems
Artificial Intelligence in Games

Jean-François Raskin has contributed to numerous publications in a variety of venues, with frequent appearances in:

arXiv (Cornell University)
Leibniz-Zentrum für Informatik (Schloss Dagstuhl)
Information and Computation
Electronic Proceedings in Theoretical Computer Science
International Journal on Software Tools for Technology Transfer

Some recent works include the following papers:

"Proceedings 11th International Symposium on Games, Automata, Logics, and Formal Verification" (2020), published in Electronic Proceedings in Theoretical Computer Science
"The Complexity of Subgame Perfect Equilibria in Quantitative Reachability Games" (2020), published in Logical Methods in Computer Science
"Learning Non-Markovian Reward Models in MDPs" (2020), published in arXiv (Cornell University)
"From linear temporal logic and limit-deterministic Büchi automata to deterministic parity automata" (2022), published in International Journal on Software Tools for Technology Transfer
"Subgame-Perfect Equilibria in Mean-Payoff Games" (2021), published by Leibniz-Zentrum für Informatik (Schloss Dagstuhl)

Their collaborative work is reflected in frequent coauthorship with several researchers, including:

Véronique Bruyère
Guillermo A. Pérez
Damien Busatto-Gaston
Marie van den Bogaard
Léonard Brice

Best Publications

Model checking lots of systems: efficient verification of temporal properties in software product lines

Andreas Classen;Patrick Heymans;Pierre-Yves Schobbens;Axel Legay

423
Citations
Featured Transition Systems: Foundations for Verifying Variability-Intensive Systems and Their Application to LTL Model Checking

A. Classen;M. Cordy;Pierre-Yves Schobbens;P. Heymans

304
Citations
A Game-Based Verification of Non-repudiation and Fair Exchange Protocols

Steve Kremer;Jean-François Raskin

220
Citations
Antichains: a new algorithm for checking universality of finite automata

M. De Wulf;L. Doyen;T. A. Henzinger;J. F. Raskin

217
Citations
Algorithms for Omega-Regular Games with Imperfect Information

Jean-François Raskin;Krishnendu Chatterjee;Laurent Doyen;Thomas A. Henzinger

210
Citations
A game-based verification of non-repudiation and fair exchange protocols

Steve Kremer;Jean-François Raskin

208
Citations
Generalized Mean-payoff and Energy Games

Krishnendu Chatterjee;Laurent Doyen;Thomas A. Henzinger;Jean-François Raskin

197
Citations
Antichains: A new algorithm for checking universality of finite automata

Martin De Wulf;Laurent Doyen;Thomas A. Henzinger;Jean-François Raskin

172
Citations
The Regular Real-Time Languages

Thomas A. Henzinger;Jean-François Raskin;Pierre-Yves Schobbens

167
Citations
Acacia+, a tool for LTL synthesis

Aaron Bohy;Véronique Bruyère;Emmanuel Filiot;Naiyong Jin

163
Citations
Faster algorithms for mean-payoff games

L. Brim;J. Chaloupka;L. Doyen;R. Gentilini

161
Citations
Almost ASAP Semantics: From Timed Models to Timed Implementations

Martin De Wulf;Laurent Doyen;Jean-François Raskin

160
Citations
An Antichain Algorithm for LTL Realizability

Emmanuel Filiot;Naiyong Jin;Jean-François Raskin

155
Citations
Expand, Enlarge and Check: New algorithms for the coverability problem of WSTS

G. Geeraerts;J. F. Raskin;L. Van Begin

129
Citations
Expand, enlarge, and check: new algorithms for the coverability problem of WSTS

Gilles Geeraerts;Jean-François Raskin;Laurent Van Begin

128
Citations
Algorithms for Omega-Regular Games with Imperfect Information

Krishnendu Chatterjee;Laurent Doyen;Thomas A. Henzinger;Jean-Francois Raskin

120
Citations
Robust Undecidability of Timed and Hybrid Systems

Thomas A. Henzinger;Jean-François Raskin;Jean-François Raskin

119
Citations
Towards the Automated Verification of Multithreaded Java Programs

Giorgio Delzanno;Jean-François Raskin;Laurent Van Begin

118
Citations
Antichains and compositional algorithms for LTL synthesis

Emmanuel Filiot;Naiyong Jin;Jean-François Raskin

118
Citations
Game analysis of abuse-free contract signing

S. Kremer;J.-F. Raskin

117
Citations
Almost ASAP semantics: from timed models to timed implementations

Martin De Wulf;Laurent Doyen;Jean-François Raskin

74
Citations

Frequent Co-Authors

Laurent Doyen École Normale Supérieure

Thomas A. Henzinger Institute of Science and Technology Austria

Krishnendu Chatterjee Institute of Science and Technology Austria

Kim Guldstrand Larsen Aalborg University

Roderick Bloem Graz University of Technology

Steve Kremer French Institute for Research in Computer Science and Automation - INRIA

Rupak Majumdar Max Planck Institute for Software Systems

Nicolas Markey French Institute for Research in Computer Science and Automation - INRIA

Patrick Heymans University of Namur

Alexandre David Aalborg University

External Links

Personal website of Jean-François Raskin Google Scholar page

If you think any of the details on this page are incorrect, let us know.

Related Online Degrees & Career Pathways

Exploring online degrees can be a smart move for those interested in computer science and related fields. The flexibility and affordability of online learning have greatly expanded access to different career pathways in technology, business, and project management.

Data science is one of the fastest-growing fields, and finding the top data science programs online can open doors to careers in analytics, AI, and information management. Likewise, if you are interested in the intersection of technology and project leadership, the best online construction management degree options can help you gain skills that are in high demand across engineering and tech-driven sectors.

Many employers value business acumen alongside technical ability, making affordable online MBA programs a great way to enhance your management and leadership opportunities. For those looking for a faster route, several online master's programs can be completed in just one year, helping you accelerate your progress without a long-term commitment.