- Home
- Best Scientists - Computer Science
- Jean-François Raskin

Discipline name
D-index
D-index (Discipline H-index) only includes papers and citation values for an examined
discipline in contrast to General H-index which accounts for publications across all
disciplines.
Citations
Publications
World Ranking
National Ranking

Computer Science
D-index
40
Citations
6,226
132
World Ranking
4471
National Ranking
47

- Programming language
- Algorithm
- Real number

Algorithm, Theoretical computer science, Automaton, Discrete mathematics and Timed automaton are his primary areas of study. His Algorithm research incorporates themes from Set and Software technology. His research in Theoretical computer science intersects with topics in Semantics, Software and Semantics.

His Automaton research is multidisciplinary, incorporating elements of Hybrid system, Existential quantification and Integer. In the subject of general Discrete mathematics, his work in Decidability and Reachability problem is often linked to Context, thereby combining diverse domains of study. In his study, Deterministic finite automaton, Quantum finite automata, Nondeterministic finite automaton, Nondeterministic algorithm and ω-automaton is inextricably linked to Deterministic automaton, which falls within the broad field of Timed automaton.

- Model checking lots of systems: efficient verification of temporal properties in software product lines (284 citations)
- Featured Transition Systems: Foundations for Verifying Variability-Intensive Systems and Their Application to LTL Model Checking (176 citations)
- Algorithms for Omega-Regular Games with Imperfect Information (132 citations)

The scientist’s investigation covers issues in Discrete mathematics, Theoretical computer science, Decidability, Algorithm and Automaton. His Discrete mathematics study combines topics from a wide range of disciplines, such as Stochastic game and Combinatorics. His studies in Theoretical computer science integrate themes in fields like Semantics, Petri net and Computation.

His study looks at the relationship between Decidability and topics such as Reachability, which overlap with Nash equilibrium. His Algorithm research is multidisciplinary, incorporating perspectives in Hybrid automaton, Set and Data structure. His study in Automaton is interdisciplinary in nature, drawing from both Finite-state machine, Model checking and Hybrid system.

- Discrete mathematics (28.25%)
- Theoretical computer science (25.08%)
- Decidability (24.44%)

- Mathematical economics (14.29%)
- Discrete mathematics (28.25%)
- Decidability (24.44%)

Jean-François Raskin focuses on Mathematical economics, Discrete mathematics, Decidability, Markov decision process and Stochastic game. His studies deal with areas such as Mean payoff, Model checking, Dimension and Parameterized complexity as well as Discrete mathematics. His Decidability research incorporates elements of Decision problem, Set and Reachability.

His work carried out in the field of Set brings together such families of science as PSPACE, Theoretical computer science, Subgame perfect equilibrium, Monoid and String. His Theoretical computer science study integrates concerns from other disciplines, such as Discrete time and continuous time and Semantics. His Shortest path problem research is multidisciplinary, relying on both Adversary, Data structure and Algorithm.

- Meet your expectations with guarantees: Beyond worst-case synthesis in quantitative games (27 citations)
- The first reactive synthesis competition (SYNTCOMP 2014) (25 citations)
- Assume-admissible synthesis (24 citations)

- Programming language
- Algorithm
- Algebra

His main research concerns Discrete mathematics, Decidability, Mathematical economics, Markov decision process and Theory of computation. He has included themes like Linear temporal logic, Stochastic game, Büchi automaton, Translation and Regular language in his Discrete mathematics study. Within one scientific family, Jean-François Raskin focuses on topics pertaining to Set under Decidability, and may sometimes address concerns connected to PSPACE, Theoretical computer science, Reachability and String.

His work in the fields of Mathematical economics, such as Perfect information, Subgame and Extensive-form game, intersects with other areas such as Preference relation. He usually deals with Markov decision process and limits it to topics linked to Mathematical optimization and Dimension, Model checking and Alpha. As a part of the same scientific study, he usually deals with the Theory of computation, concentrating on Reactive system and frequently concerns with Control theory, Software engineering, Operations research and State.

This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.

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

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

international conference on software engineering **(2010)**

383 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.

IEEE Transactions on Software Engineering **(2013)**

236 Citations

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

Steve Kremer;Jean-François Raskin.

international conference on concurrency theory **(2001)**

213 Citations

Antichains: a new algorithm for checking universality of finite automata

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

computer aided verification **(2006)**

200 Citations

Algorithms for Omega-Regular Games with Imperfect Information

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

Logical Methods in Computer Science **(2007)**

199 Citations

Generalized Mean-payoff and Energy Games

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

foundations of software technology and theoretical computer science **(2010)**

189 Citations

Antichains: A new algorithm for checking universality of finite automata

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

Lecture Notes in Computer Science **(2006)**

169 Citations

The Regular Real-Time Languages

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

international colloquium on automata languages and programming **(1998)**

159 Citations

Almost ASAP Semantics: From Timed Models to Timed Implementations

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

acm international conference hybrid systems: computation and control **(2004)**

159 Citations

Faster algorithms for mean-payoff games

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

formal methods **(2011)**

141 Citations

Institute of Science and Technology Austria

Institute of Science and Technology Austria

Aalborg University

Graz University of Technology

University of Oxford

Max Planck Institute for Software Systems

University of Namur

University of Paris-Saclay

New York University

Saarland University

Profile was last updated on December 6th, 2021.

Research.com Ranking is based on data retrieved from the Microsoft Academic Graph (MAG).

The ranking d-index is inferred from publications deemed to belong to the considered discipline.

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

Contact us

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Something went wrong. Please try again later.