2009 |
38 | EE | Thomas Brihaye,
Arnaud Da Costa Lopes,
François Laroussinie,
Nicolas Markey:
ATLwith Strategy Contexts and Bounded Memory.
LFCS 2009: 92-106 |
2008 |
37 | EE | Patricia Bouyer,
Ulrich Fahrenberg,
Kim Guldstrand Larsen,
Nicolas Markey,
Jirí Srba:
Infinite Runs in Weighted Timed Automata with Energy Constraints.
FORMATS 2008: 33-47 |
36 | EE | Patricia Bouyer,
Nicolas Markey,
Pierre-Alain Reynier:
Robust Analysis of Timed Automata ViaChannel Machines.
FoSSaCS 2008: 157-171 |
35 | EE | Patricia Bouyer,
Nicolas Markey,
Joël Ouaknine,
James Worrell:
On Expressiveness and Complexity in Real-Time Model Checking.
ICALP (2) 2008: 124-135 |
34 | EE | Nathalie Bertrand,
Patricia Bouyer,
Thomas Brihaye,
Nicolas Markey:
Quantitative Model-Checking of One-Clock Timed Automata under Probabilistic Semantics.
QEST 2008: 55-64 |
33 | EE | Patricia Bouyer,
Nicolas Markey,
Joël Ouaknine,
Ph. Schnoebelen,
James Worrell:
On Termination for Faulty Channel Machines.
STACS 2008: 121-132 |
32 | EE | Thomas Brihaye,
Nicolas Markey,
Mohamed Ghannem,
Lionel Rieg:
Good Friends are Hard to Find!
TIME 2008: 32-40 |
31 | EE | Patricia Bouyer,
Nicolas Markey,
Joël Ouaknine,
Ph. Schnoebelen,
James Worrell:
On Termination for Faulty Channel Machines
CoRR abs/0802.2839: (2008) |
30 | EE | François Laroussinie,
Nicolas Markey,
Ghassan Oreiby:
On the Expressiveness and Complexity of ATL
CoRR abs/0804.2435: (2008) |
29 | EE | Patricia Bouyer,
Kim Guldstrand Larsen,
Nicolas Markey:
Model Checking One-clock Priced Timed Automata
CoRR abs/0805.1457: (2008) |
28 | EE | Martin De Wulf,
Laurent Doyen,
Nicolas Markey,
Jean-François Raskin:
Robust safety of timed automata.
Formal Methods in System Design 33(1-3): 45-84 (2008) |
2007 |
27 | EE | Thomas Brihaye,
François Laroussinie,
Nicolas Markey,
Ghassan Oreiby:
Timed Concurrent Game Structures.
CONCUR 2007: 445-459 |
26 | EE | Patricia Bouyer,
Nicolas Markey:
Costs Are Expensive!
FORMATS 2007: 53-68 |
25 | EE | Patricia Bouyer,
Kim Guldstrand Larsen,
Nicolas Markey:
Model-Checking One-Clock Priced Timed Automata.
FoSSaCS 2007: 108-122 |
24 | EE | François Laroussinie,
Nicolas Markey,
Ghassan Oreiby:
On the Expressiveness and Complexity of ATL.
FoSSaCS 2007: 243-257 |
23 | EE | Patricia Bouyer,
Nicolas Markey,
Joël Ouaknine,
James Worrell:
The Cost of Punctuality.
LICS 2007: 109-120 |
2006 |
22 | EE | François Laroussinie,
Nicolas Markey,
Ghassan Oreiby:
Model-Checking Timed.
FORMATS 2006: 245-259 |
21 | EE | Patricia Bouyer,
Kim Guldstrand Larsen,
Nicolas Markey,
Jacob Illum Rasmussen:
Almost Optimal Strategies in One Clock Priced Timed Games.
FSTTCS 2006: 345-356 |
20 | EE | Patricia Bouyer,
Nicolas Markey,
Pierre-Alain Reynier:
Robust Model-Checking of Linear-Time Properties in Timed Automata.
LATIN 2006: 238-249 |
19 | EE | Nicolas Markey,
Ph. Schnoebelen:
Mu-calculus path checking.
Inf. Process. Lett. 97(6): 225-230 (2006) |
18 | EE | Patricia Bouyer,
Thomas Brihaye,
Nicolas Markey:
Improved undecidability results on weighted timed automata.
Inf. Process. Lett. 98(5): 188-194 (2006) |
17 | EE | François Laroussinie,
Nicolas Markey,
Ph. Schnoebelen:
Efficient timed model checking for discrete-time systems.
Theor. Comput. Sci. 353(1-3): 249-271 (2006) |
16 | EE | Nicolas Markey,
Jean-François Raskin:
Model checking restricted sets of timed paths.
Theor. Comput. Sci. 358(2-3): 273-292 (2006) |
2005 |
15 | EE | Patricia Bouyer,
Fabrice Chevalier,
Nicolas Markey:
On the Expressiveness of TPTL and MTL.
FSTTCS 2005: 432-443 |
2004 |
14 | EE | François Laroussinie,
Nicolas Markey,
Ph. Schnoebelen:
Model Checking Timed Automata with One or Two Clocks.
CONCUR 2004: 387-401 |
13 | EE | Nicolas Markey,
Jean-François Raskin:
Model Checking Restricted Sets of Timed Paths.
CONCUR 2004: 432-447 |
12 | EE | Nicolas Markey,
Ph. Schnoebelen:
Symbolic Model Checking for Simply-Timed Systems.
FORMATS/FTRTFT 2004: 102-117 |
11 | EE | Martin De Wulf,
Laurent Doyen,
Nicolas Markey,
Jean-François Raskin:
Robustness and Implementability of Timed Automata.
FORMATS/FTRTFT 2004: 118-133 |
10 | EE | Jennifer M. Davoren,
Vaughan Coulthard,
Nicolas Markey,
Thomas Moor:
Non-deterministic Temporal Logics for General Flow Systems.
HSCC 2004: 280-295 |
9 | EE | Nicolas Markey,
Ph. Schnoebelen:
TSMV: A Symbolic Model Checker for Quantitative Analysis of Systems.
QEST 2004: 330-331 |
8 | EE | Nicolas Markey:
Past is for free: on the complexity of verifying linear temporal properties with past.
Acta Inf. 40(6-7): 431-458 (2004) |
7 | EE | Nicolas Markey,
Ph. Schnoebelen:
A PTIME-complete matching problem for SLP-compressed words.
Inf. Process. Lett. 90(1): 3-6 (2004) |
2003 |
6 | EE | Nicolas Markey,
Ph. Schnoebelen:
Model Checking a Path.
CONCUR 2003: 248-262 |
5 | | Nicolas Markey:
Temporal logic with past is exponentially more succinct, Concurrency Column.
Bulletin of the EATCS 79: 122-128 (2003) |
2002 |
4 | EE | François Laroussinie,
Nicolas Markey,
Ph. Schnoebelen:
On Model Checking Durational Kripke Structures.
FoSSaCS 2002: 264-279 |
3 | EE | François Laroussinie,
Nicolas Markey,
Ph. Schnoebelen:
Temporal Logic with Forgettable Past.
LICS 2002: 383-392 |
2 | EE | Nicolas Markey:
Past is for Free: on the Complexity of Verifying Linear Temporal Properties with Past.
Electr. Notes Theor. Comput. Sci. 68(2): (2002) |
2001 |
1 | EE | François Laroussinie,
Nicolas Markey,
Ph. Schnoebelen:
Model Checking CTL+ and FCTL is Hard.
FoSSaCS 2001: 318-331 |