| Temporal logic with forgettable past F Laroussinie, N Markey, P Schnoebelen LICS 2002, 383-392, 2002 | 268 | 2002 |
| Infinite runs in weighted timed automata with energy constraints P Bouyer, U Fahrenberg, KG Larsen, N Markey, J Srba Formal Modeling and Analysis of Timed Systems: 6th International Conference …, 2008 | 256 | 2008 |
| Model checking a path N Markey, P Schnoebelen International Conference on Concurrency Theory, 251-265, 2003 | 143 | 2003 |
| Temporal logic with past is exponentially more succinct N Markey Bulletin-European Association for Theoretical Computer Science 79, 122-128, 2003 | 143 | 2003 |
| Model checking timed automata with one or two clocks F Laroussinie, N Markey, P Schnoebelen International Conference on Concurrency Theory, 387-401, 2004 | 141 | 2004 |
| ATL with strategy contexts and bounded memory T Brihaye, A Da Costa, F Laroussinie, N Markey International symposium on logical foundations of computer science, 92-106, 2009 | 117 | 2009 |
| On the expressiveness and complexity of ATL F Laroussinie, N Markey, G Oreiby Logical Methods in Computer Science 4, 2008 | 107 | 2008 |
| On the expressiveness of TPTL and MTL P Bouyer, F Chevalier, N Markey International Conference on Foundations of Software Technology and …, 2005 | 100 | 2005 |
| Improved undecidability results on weighted timed automata P Bouyer, T Brihaye, N Markey Information Processing Letters 98 (5), 188-194, 2006 | 97 | 2006 |
| Quantitative analysis of real-time systems using priced timed automata P Bouyer, U Fahrenberg, KG Larsen, N Markey Communications of the ACM 54 (9), 78-87, 2011 | 83 | 2011 |
| Robust safety of timed automata M De Wulf, L Doyen, N Markey, JF Raskin Formal Methods in System Design 33 (1), 45-84, 2008 | 82 | 2008 |
| Robustness and implementability of timed automata M De Wulf, L Doyen, N Markey, JF Raskin International Symposium on Formal Techniques in Real-Time and Fault-Tolerant …, 2004 | 80 | 2004 |
| Pure Nash Equilibria in Concurrent Deterministic Games P Bouyer, R Brenguier, N Markey, M Ummels Logical Methods in Computer Science 11, 2015 | 72 | 2015 |
| Model Checking CTL+ and FCTL Is Hard F Laroussinie, N Markey, P Schnoebelen International Conference on Foundations of Software Science and Computation …, 2001 | 71 | 2001 |
| Robust model-checking of linear-time properties in timed automata P Bouyer, N Markey, PA Reynier Latin American Symposium on Theoretical Informatics, 238-249, 2006 | 66 | 2006 |
| Augmenting ATL with strategy contexts F Laroussinie, N Markey Information and Computation 245, 98-123, 2015 | 62 | 2015 |
| ATL with strategy contexts: Expressiveness and model checking A Da Costa, F Laroussinie, N Markey IARCS Annual Conference on Foundations of Software Technology and …, 2010 | 62 | 2010 |
| The cost of punctuality P Bouyer, N Markey, J Ouaknine, J Worrell 22nd Annual IEEE Symposium on Logic in Computer Science (LICS 2007), 109-120, 2007 | 62 | 2007 |
| Almost optimal strategies in one clock priced timed games P Bouyer, KG Larsen, N Markey, JI Rasmussen International Conference on Foundations of Software Technology and …, 2006 | 62 | 2006 |
| Model checking one-clock priced timed automata P Bouyer, KG Larsen, N Markey Logical Methods in Computer Science 4, 2008 | 60 | 2008 |
Patricia BouyerLMF, Université Paris-Saclay, CNRS, ENS Paris-Saclay在 lsv.fr 的电子邮件经过验证
