| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Patricia Bouyer, Romain Brenguier, Nicolas Markey, Michael Ummels |
Concurrent Games with Ordered Objectives.  |
FoSSaCS  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Patricia Bouyer, Uli Fahrenberg, Kim G. Larsen, Nicolas Markey |
Quantitative analysis of real-time systems using priced timed automata.  |
Commun. ACM  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Patricia Bouyer, Nicolas Markey, Jörg Olschewski, Michael Ummels |
Measuring Permissiveness in Parity Games: Mean-Payoff Parity Games Revisited  |
CoRR  |
2011 |
DBLP BibTeX RDF |
|
| 1 | Patricia Bouyer, Kim G. Larsen, Nicolas Markey, Ocan Sankur, Claus R. Thrane |
Timed Automata Can Always Be Made Implementable.  |
CONCUR  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Patricia Bouyer, Nicolas Markey, Ocan Sankur |
Robust Model-Checking of Timed Automata via Pumping in Channel Machines.  |
FORMATS  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Patricia Bouyer, Nicolas Markey, Jörg Olschewski, Michael Ummels |
Measuring Permissiveness in Parity Games: Mean-Payoff Parity Games Revisited.  |
ATVA  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Nicolas Markey |
Robustness in real-time systems.  |
SIES  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Ocan Sankur, Patricia Bouyer, Nicolas Markey |
Shrinking Timed Automata.  |
FSTTCS  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Patricia Bouyer, Romain Brenguier, Nicolas Markey, Michael Ummels |
Nash Equilibria in Concurrent Games with Büchi Objectives.  |
FSTTCS  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Patricia Bouyer, Fabrice Chevalier, Nicolas Markey |
On the expressiveness of TPTL and MTL.  |
Inf. Comput.  |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Thomas Brihaye, Marc Jungers, Samson Lasaulce, Nicolas Markey, Ghassan Oreiby |
Using Model Checking for Analyzing Distributed Power Control Problems.  |
EURASIP J. Wireless Comm. and Networking  |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Patricia Bouyer, Romain Brenguier, Nicolas Markey |
Nash Equilibria for Reachability Objectives in Multi-player Timed Games.  |
CONCUR  |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Nicolas Markey, Jef Wijsen (eds.) |
TIME 2010 - 17th International Symposium on Temporal Representation and Reasoning, Paris, France, 6-8 September 2010  |
TIME  |
2010 |
DBLP BibTeX RDF |
|
| 1 | Patricia Bouyer, Romain Brenguier, Nicolas Markey |
Computing Equilibria in Two-Player Timed Games via Turn-Based Finite Games.  |
FORMATS  |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Patricia Bouyer, Uli Fahrenberg, Kim G. Larsen, Nicolas Markey |
Timed automata with observers under energy constraints.  |
HSCC  |
2010 |
DBLP DOI BibTeX RDF |
weighted timed automata, energy constraints |
| 1 | Paul Hunter, Patricia Bouyer, Nicolas Markey, Joël Ouaknine, James Worrell |
Computing Rational Radical Sums in Uniform TC^0.  |
FSTTCS  |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Arnaud Da Costa Lopes, François Laroussinie, Nicolas Markey |
ATL with Strategy Contexts: Expressiveness and Model Checking.  |
FSTTCS  |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Patricia Bouyer, Marie Duflot, Nicolas Markey, Gabriel Renault |
Measuring Permissivity in Finite Games.  |
CONCUR  |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Thomas Brihaye, Arnaud Da Costa Lopes, François Laroussinie, Nicolas Markey |
ATL with Strategy Contexts and Bounded Memory.  |
LFCS  |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Patricia Bouyer, Kim Guldstrand Larsen, Nicolas Markey |
Model Checking One-Clock Priced Timed Automata.  |
Logical Methods in Computer Science  |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | François Laroussinie, Nicolas Markey, Ghassan Oreiby |
On the Expressiveness and Complexity of ATL.  |
Logical Methods in Computer Science  |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Patricia Bouyer, Nicolas Markey, Joël Ouaknine, Ph. Schnoebelen, James Worrell |
On Termination for Faulty Channel Machines  |
CoRR  |
2008 |
DBLP BibTeX RDF |
|
| 1 | François Laroussinie, Nicolas Markey, Ghassan Oreiby |
On the Expressiveness and Complexity of ATL  |
CoRR  |
2008 |
DBLP BibTeX RDF |
|
| 1 | Patricia Bouyer, Kim Guldstrand Larsen, Nicolas Markey |
Model Checking One-clock Priced Timed Automata  |
CoRR  |
2008 |
DBLP BibTeX RDF |
|
| 1 | Martin De Wulf, Laurent Doyen, Nicolas Markey, Jean-François Raskin |
Robust safety of timed automata.  |
Formal Methods in System Design  |
2008 |
DBLP DOI BibTeX RDF |
Robustness, Implementability, Perturbation, Timed automaton, Drift |
| 1 | Thomas Brihaye, Nicolas Markey, Mohamed Ghannem, Lionel Rieg |
Good Friends are Hard to Find!  |
TIME  |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Patricia Bouyer, Nicolas Markey, Joël Ouaknine, James Worrell |
On Expressiveness and Complexity in Real-Time Model Checking.  |
ICALP  |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Patricia Bouyer, Ulrich Fahrenberg, Kim Guldstrand Larsen, Nicolas Markey, Jirí Srba |
Infinite Runs in Weighted Timed Automata with Energy Constraints.  |
FORMATS  |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Patricia Bouyer, Nicolas Markey, Joël Ouaknine, Ph. Schnoebelen, James Worrell |
On Termination for Faulty Channel Machines.  |
STACS  |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Nathalie Bertrand, Patricia Bouyer, Thomas Brihaye, Nicolas Markey |
Quantitative Model-Checking of One-Clock Timed Automata under Probabilistic Semantics.  |
QEST  |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Patricia Bouyer, Nicolas Markey, Pierre-Alain Reynier |
Robust Analysis of Timed Automata via Channel Machines.  |
FoSSaCS  |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Thomas Brihaye, François Laroussinie, Nicolas Markey, Ghassan Oreiby |
Timed Concurrent Game Structures.  |
CONCUR  |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Patricia Bouyer, Nicolas Markey |
Costs Are Expensive!  |
FORMATS  |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Patricia Bouyer, Nicolas Markey, Joël Ouaknine, James Worrell |
The Cost of Punctuality.  |
LICS  |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | François Laroussinie, Nicolas Markey, Ghassan Oreiby |
On the Expressiveness and Complexity of ATL.  |
FoSSaCS  |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Patricia Bouyer, Kim Guldstrand Larsen, Nicolas Markey |
Model-Checking One-Clock Priced Timed Automata.  |
FoSSaCS  |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Nicolas Markey, Ph. Schnoebelen |
Mu-calculus path checking.  |
Inf. Process. Lett.  |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Patricia Bouyer, Thomas Brihaye, Nicolas Markey |
Improved undecidability results on weighted timed automata.  |
Inf. Process. Lett.  |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Nicolas Markey, Jean-François Raskin |
Model checking restricted sets of timed paths.  |
Theor. Comput. Sci.  |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | François Laroussinie, Nicolas Markey, Ph. Schnoebelen |
Efficient timed model checking for discrete-time systems.  |
Theor. Comput. Sci.  |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | François Laroussinie, Nicolas Markey, Ghassan Oreiby |
Model-Checking Timed.  |
FORMATS  |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Patricia Bouyer, Nicolas Markey, Pierre-Alain Reynier |
Robust Model-Checking of Linear-Time Properties in Timed Automata.  |
LATIN  |
2006 |
DBLP DOI BibTeX RDF |
robust verification, Implementability, timed systems |
| 1 | Patricia Bouyer, Kim Guldstrand Larsen, Nicolas Markey, Jacob Illum Rasmussen |
Almost Optimal Strategies in One Clock Priced Timed Games.  |
FSTTCS  |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Patricia Bouyer, Fabrice Chevalier, Nicolas Markey |
On the Expressiveness of TPTL and MTL.  |
FSTTCS  |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Nicolas Markey, Ph. Schnoebelen |
A PTIME-complete matching problem for SLP-compressed words.  |
Inf. Process. Lett.  |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Nicolas Markey |
Past is for free: on the complexity of verifying linear temporal properties with past.  |
Acta Inf.  |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Nicolas Markey, Jean-François Raskin |
Model Checking Restricted Sets of Timed Paths.  |
CONCUR  |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | François Laroussinie, Nicolas Markey, Ph. Schnoebelen |
Model Checking Timed Automata with One or Two Clocks.  |
CONCUR  |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin De Wulf, Laurent Doyen, Nicolas Markey, Jean-François Raskin |
Robustness and Implementability of Timed Automata.  |
FORMATS/FTRTFT  |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Nicolas Markey, Ph. Schnoebelen |
Symbolic Model Checking for Simply-Timed Systems.  |
FORMATS/FTRTFT  |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Nicolas Markey, Ph. Schnoebelen |
TSMV: A Symbolic Model Checker for Quantitative Analysis of Systems.  |
QEST  |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Jennifer M. Davoren, Vaughan Coulthard, Nicolas Markey, Thomas Moor |
Non-deterministic Temporal Logics for General Flow Systems.  |
HSCC  |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Nicolas Markey |
Temporal logic with past is exponentially more succinct, Concurrency Column.  |
Bulletin of the EATCS  |
2003 |
DBLP BibTeX RDF |
|
| 1 | Nicolas Markey, Ph. Schnoebelen |
Model Checking a Path.  |
CONCUR  |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Nicolas Markey |
Past is for Free: on the Complexity of Verifying Linear Temporal Properties with Past.  |
Electr. Notes Theor. Comput. Sci.  |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | François Laroussinie, Nicolas Markey, Ph. Schnoebelen |
Temporal Logic with Forgettable Past.  |
LICS  |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | François Laroussinie, Nicolas Markey, Ph. Schnoebelen |
On Model Checking Durational Kripke Structures.  |
FoSSaCS  |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | François Laroussinie, Nicolas Markey, Ph. Schnoebelen |
Model Checking CTL+ and FCTL is Hard.  |
FoSSaCS  |
2001 |
DBLP DOI BibTeX RDF |
|