2026 Nicolas Markey: 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	32	13250	12857	344	334	137	3765

Overview

Nicolas Markey is affiliated with the French Institute for Research in Computer Science and Automation (INRIA) in France. Their research focuses primarily on computer science, with a particular emphasis on computational theory and mathematics.

Within their field of study, they have contributed significantly to several subfields, including:

Computational Theory and Mathematics
Artificial Intelligence
Management Science and Operations Research
Software
Economics and Econometrics

Their work encompasses a range of topics central to theoretical computer science and related applications, such as:

Formal Methods in Verification
Game Theory and Applications
Semigroups and Automata Theory
Petri Nets in System Modeling
Game Theory and Voting Systems
Model-Driven Software Engineering Techniques
Real-Time Systems Scheduling

Nicolas Markey has published extensively, including notable recent papers such as:

"Diagnosing timed automata using timed markings," 2021, International Journal on Software Tools for Technology Transfer
"Language Preservation Problems in Parametric Timed Automata," 2020, HAL (Le Centre pour la Communication Scientifique Directe)
"Games on Graphs: From Logic and Automata to Algorithms," 2023, arXiv (Cornell University)
"Reasoning about Quality and Fuzziness of Strategic Behaviors," 2023, ACM Transactions on Computational Logic
"Control strategies for off-line testing of timed systems," 2022, Formal Methods in System Design

Their collaborative efforts involve frequent co-authorship with several researchers, including:

Thierry Jéron
Ocan Sankur
David Mentré
Nathalie Bertrand
L. Henry

Publication venues frequently chosen by Nicolas Markey highlight their engagement with both peer-reviewed journals and scientific communication platforms. These include:

arXiv (Cornell University)
Leibniz-Zentrum für Informatik (Schloss Dagstuhl)
International Journal on Software Tools for Technology Transfer
ACM Transactions on Computational Logic
HAL (Le Centre pour la Communication Scientifique Directe)

Best Publications

Temporal logic with forgettable past

F. Laroussinie;N. Markey;P. Schnoebelen

255
Citations
Infinite Runs in Weighted Timed Automata with Energy Constraints

Patricia Bouyer;Uli Fahrenberg;Kim G. Larsen;Nicolas Markey

246
Citations
Improved undecidability results on weighted timed automata

Patricia Bouyer;Thomas Brihaye;Nicolas Markey

175
Citations
Model checking a path

Nicolas Markey;Nicolas Markey;Philippe Schnoebelen

150
Citations
Model checking timed automata with one or two clocks

F. Laroussinie;N. Markey;Ph. Schnoebelen

133
Citations
ATL with Strategy Contexts and Bounded Memory

Thomas Brihaye;Arnaud Costa;François Laroussinie;Nicolas Markey

122
Citations
On the expressiveness of TPTL and MTL

Patricia Bouyer;Fabrice Chevalier;Nicolas Markey

101
Citations
On the Expressiveness and Complexity of ATL

François Laroussinie;Nicolas Markey;Ghassan Oreiby

96
Citations
Robust model-checking of linear-time properties in timed automata

Patricia Bouyer;Nicolas Markey;Pierre-Alain Reynier

93
Citations
Robustness and Implementability of Timed Automata

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

86
Citations
Robust safety of timed automata

Martin Wulf;Laurent Doyen;Nicolas Markey;Jean-François Raskin

84
Citations
Model Checking CTL+ and FCTL is Hard

François Laroussinie;Nicolas Markey;Ph. Schnoebelen

77
Citations
Quantitative analysis of real-time systems using priced timed automata

Patricia Bouyer;Uli Fahrenberg;Kim G. Larsen;Nicolas Markey

76
Citations
Past is for free: on the complexity of verifying linear temporal properties with past

Nicolas Markey

73
Citations
ATL with Strategy Contexts: Expressiveness and Model Checking

Arnaud Da Costa;François Laroussinie;Nicolas Markey

72
Citations
On the expressiveness of TPTL and MTL

Patricia Bouyer;Fabrice Chevalier;Nicolas Markey

69
Citations
The Cost of Punctuality

P. Bouyer;N. Markey;J. Ouaknine;J. Worrell

68
Citations
Pure nash equilibria in concurrent deterministic games

Patricia P. Bouyer;Romain Brenguier;Nicolas N. Markey;Michael Ummels

66
Citations
On Expressiveness and Complexity in Real-Time Model Checking

Patricia Bouyer;Nicolas Markey;Joël Ouaknine;James Worrell

63
Citations
Timed automata with observers under energy constraints

Patricia Bouyer;Uli Fahrenberg;Kim G. Larsen;Nicolas Markey

62
Citations
Efficient timed model checking for discrete-time systems

F. Laroussinie;N. Markey;Ph. Schnoebelen

60
Citations

Frequent Co-Authors

Patricia Bouyer University of Paris-Saclay

Kim Guldstrand Larsen Aalborg University

Joël Ouaknine Max Planck Institute for Software Systems

Jean-François Raskin Université Libre de Bruxelles

Laurent Doyen École Normale Supérieure

Orna Kupferman Hebrew University of Jerusalem

Stavros Tripakis Northeastern University

Paul Pettersson Mälardalen University

Antoine Girard University of Paris-Saclay

Alexandre David Aalborg University

External Links

Personal website of Nicolas Markey

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

Related Online Degrees & Career Pathways

Studying Computer Science in the USA opens the door to a range of related online degrees and professional fields. Many students choose to explore interdisciplinary options such as pursuing online physics degrees, which blend computer science with problem-solving and analytical skills.

For those interested in data-driven technology, enrolling in a data science degree is a popular route. This equips graduates for high-demand roles in analytics, machine learning, and big data industries.

Another promising field is electrical engineering. The best online electrical engineering programs USA allow students to specialize in areas like electronics, robotics, or network engineering, complementing computer science education with a strong technical foundation.

If you’re looking for quicker career advancement, consider easy certifications to get that can boost your resume. Tech certifications are a practical way to show employers your skills and potentially secure higher-paying positions in less time.