What is he best known for?
The fields of study he is best known for:
- 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.
His most cited work include:
- 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)
What are the main themes of his work throughout his whole career to date?
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.
He most often published in these fields:
- Discrete mathematics (28.25%)
- Theoretical computer science (25.08%)
- Decidability (24.44%)
What were the highlights of his more recent work (between 2016-2021)?
- Mathematical economics (14.29%)
- Discrete mathematics (28.25%)
- Decidability (24.44%)
In recent papers he was focusing on the following fields of study:
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.
Between 2016 and 2021, his most popular works were:
- 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)
In his most recent research, the most cited papers focused on:
- 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.
