SCEAS

The SCEAS System

Search the dblp DataBase

Title:
Author:

Nicolas Markey: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

François Laroussinie, Nicolas Markey, Ph. Schnoebelen
Model Checking Timed Automata with One or Two Clocks. [Citation Graph (0, 0)][DBLP]
CONCUR, 2004, pp:387-401 [Conf]
Nicolas Markey, Jean-François Raskin
Model Checking Restricted Sets of Timed Paths. [Citation Graph (0, 0)][DBLP]
CONCUR, 2004, pp:432-447 [Conf]
Nicolas Markey, Ph. Schnoebelen
Model Checking a Path. [Citation Graph (0, 0)][DBLP]
CONCUR, 2003, pp:248-262 [Conf]
Martin De Wulf, Laurent Doyen, Nicolas Markey, Jean-François Raskin
Robustness and Implementability of Timed Automata. [Citation Graph (0, 0)][DBLP]
FORMATS/FTRTFT, 2004, pp:118-133 [Conf]
François Laroussinie, Nicolas Markey, Ghassan Oreiby
Model-Checking Timed. [Citation Graph (0, 0)][DBLP]
FORMATS, 2006, pp:245-259 [Conf]
Nicolas Markey, Ph. Schnoebelen
Symbolic Model Checking for Simply-Timed Systems. [Citation Graph (0, 0)][DBLP]
FORMATS/FTRTFT, 2004, pp:102-117 [Conf]
François Laroussinie, Nicolas Markey, Ph. Schnoebelen
Model Checking CTL⁺ and FCTL is Hard. [Citation Graph (0, 0)][DBLP]
FoSSaCS, 2001, pp:318-331 [Conf]
François Laroussinie, Nicolas Markey, Ph. Schnoebelen
On Model Checking Durational Kripke Structures. [Citation Graph (0, 0)][DBLP]
FoSSaCS, 2002, pp:264-279 [Conf]
Patricia Bouyer, Fabrice Chevalier, Nicolas Markey
On the Expressiveness of TPTL and MTL. [Citation Graph (0, 0)][DBLP]
FSTTCS, 2005, pp:432-443 [Conf]
Patricia Bouyer, Kim Guldstrand Larsen, Nicolas Markey, Jacob Illum Rasmussen
Almost Optimal Strategies in One Clock Priced Timed Games. [Citation Graph (0, 0)][DBLP]
FSTTCS, 2006, pp:345-356 [Conf]
Jennifer M. Davoren, Vaughan Coulthard, Nicolas Markey, Thomas Moor
Non-deterministic Temporal Logics for General Flow Systems. [Citation Graph (0, 0)][DBLP]
HSCC, 2004, pp:280-295 [Conf]
Patricia Bouyer, Nicolas Markey, Pierre-Alain Reynier
Robust Model-Checking of Linear-Time Properties in Timed Automata. [Citation Graph (0, 0)][DBLP]
LATIN, 2006, pp:238-249 [Conf]
François Laroussinie, Nicolas Markey, Ph. Schnoebelen
Temporal Logic with Forgettable Past. [Citation Graph (0, 0)][DBLP]
LICS, 2002, pp:383-392 [Conf]
Nicolas Markey, Ph. Schnoebelen
TSMV: A Symbolic Model Checker for Quantitative Analysis of Systems. [Citation Graph (0, 0)][DBLP]
QEST, 2004, pp:330-331 [Conf]
Nicolas Markey
Past is for free: on the complexity of verifying linear temporal properties with past. [Citation Graph (0, 0)][DBLP]
Acta Inf., 2004, v:40, n:6-7, pp:431-458 [Journal]
Nicolas Markey
Temporal logic with past is exponentially more succinct, Concurrency Column. [Citation Graph (0, 0)][DBLP]
Bulletin of the EATCS, 2003, v:79, n:, pp:122-128 [Journal]
Nicolas Markey
Past is for Free: on the Complexity of Verifying Linear Temporal Properties with Past. [Citation Graph (0, 0)][DBLP]
Electr. Notes Theor. Comput. Sci., 2002, v:68, n:2, pp:- [Journal]
Nicolas Markey, Ph. Schnoebelen
A PTIME-complete matching problem for SLP-compressed words. [Citation Graph (0, 0)][DBLP]
Inf. Process. Lett., 2004, v:90, n:1, pp:3-6 [Journal]
Nicolas Markey, Ph. Schnoebelen
Mu-calculus path checking. [Citation Graph (0, 0)][DBLP]
Inf. Process. Lett., 2006, v:97, n:6, pp:225-230 [Journal]
Patricia Bouyer, Thomas Brihaye, Nicolas Markey
Improved undecidability results on weighted timed automata. [Citation Graph (0, 0)][DBLP]
Inf. Process. Lett., 2006, v:98, n:5, pp:188-194 [Journal]
François Laroussinie, Nicolas Markey, Ph. Schnoebelen
Efficient timed model checking for discrete-time systems. [Citation Graph (0, 0)][DBLP]
Theor. Comput. Sci., 2006, v:353, n:1-3, pp:249-271 [Journal]
Nicolas Markey, Jean-François Raskin
Model checking restricted sets of timed paths. [Citation Graph (0, 0)][DBLP]
Theor. Comput. Sci., 2006, v:358, n:2-3, pp:273-292 [Journal]
Thomas Brihaye, François Laroussinie, Nicolas Markey, Ghassan Oreiby
Timed Concurrent Game Structures. [Citation Graph (0, 0)][DBLP]
CONCUR, 2007, pp:445-459 [Conf]
Patricia Bouyer, Nicolas Markey
Costs Are Expensive! [Citation Graph (0, 0)][DBLP]
FORMATS, 2007, pp:53-68 [Conf]
François Laroussinie, Nicolas Markey, Ghassan Oreiby
On the Expressiveness and Complexity of ATL. [Citation Graph (0, 0)][DBLP]
FoSSaCS, 2007, pp:243-257 [Conf]
Patricia Bouyer, Kim Guldstrand Larsen, Nicolas Markey
Model-Checking One-Clock Priced Timed Automata. [Citation Graph (0, 0)][DBLP]
FoSSaCS, 2007, pp:108-122 [Conf]
Patricia Bouyer, Nicolas Markey, Joël Ouaknine, James Worrell
The Cost of Punctuality. [Citation Graph (0, 0)][DBLP]
LICS, 2007, pp:109-120 [Conf]
Measuring Permissivity in Finite Games. [Citation Graph (, )][DBLP]
Nash Equilibria for Reachability Objectives in Multi-player Timed Games. [Citation Graph (, )][DBLP]
Infinite Runs in Weighted Timed Automata with Energy Constraints. [Citation Graph (, )][DBLP]
Robust Analysis of Timed Automata via Channel Machines. [Citation Graph (, )][DBLP]
Timed automata with observers under energy constraints. [Citation Graph (, )][DBLP]
On Expressiveness and Complexity in Real-Time Model Checking. [Citation Graph (, )][DBLP]
ATL with Strategy Contexts and Bounded Memory. [Citation Graph (, )][DBLP]
Quantitative Model-Checking of One-Clock Timed Automata under Probabilistic Semantics. [Citation Graph (, )][DBLP]
On Termination for Faulty Channel Machines. [Citation Graph (, )][DBLP]
Good Friends are Hard to Find! [Citation Graph (, )][DBLP]
On Termination for Faulty Channel Machines [Citation Graph (, )][DBLP]
On the Expressiveness and Complexity of ATL [Citation Graph (, )][DBLP]
Model Checking One-clock Priced Timed Automata [Citation Graph (, )][DBLP]

Search in 0.004secs, Finished in 0.006secs

NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades

NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP