BibSLEIGH
BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
EDIT!
CC-BY
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Travelled to:
1 × Denmark
1 × Estonia
1 × France
1 × Hungary
1 × Iceland
1 × Italy
1 × Poland
1 × Portugal
1 × United Kingdom
Collaborated with:
P.Bouyer F.Laroussinie P.Schnoebelen O.Sankur J.Ouaknine J.Worrell P.Reynier K.G.Larsen G.Oreiby M.Colange V.Roussanaly R.Brenguier M.Ummels
Talks about:
time (6) automata (5) model (4) check (4) reachabl (2) express (2) complex (2) robust (2) game (2) algorithm (1)

Person: Nicolas Markey

DBLP DBLP: Markey:Nicolas

Contributed to:

FOSSACS 20122012
ICALP (2) 20122012
FoSSaCS 20082008
ICALP (2) 20082008
FoSSaCS 20072007
LICS 20072007
FoSSaCS 20022002
LICS 20022002
FoSSaCS 20012001
CAV (1) 20162016
CAV (1) 20192019

Wrote 12 papers:

FoSSaCS-2012-BouyerBMU #concurrent #game studies #order
Concurrent Games with Ordered Objectives (PB, RB, NM, MU), pp. 301–315.
ICALP-v2-2012-BouyerMS #approach #automaton #game studies #reachability #robust
Robust Reachability in Timed Automata: A Game-Based Approach (PB, NM, OS), pp. 128–140.
FoSSaCS-2008-BouyerMR #analysis #automaton #robust
Robust Analysis of Timed Automata via Channel Machines (PB, NM, PAR), pp. 157–171.
ICALP-B-2008-BouyerMOW #complexity #model checking #on the #realtime
On Expressiveness and Complexity in Real-Time Model Checking (PB, NM, JO, JW), pp. 124–135.
FoSSaCS-2007-BouyerLM #automaton #model checking
Model-Checking One-Clock Priced Timed Automata (PB, KGL, NM), pp. 108–122.
FoSSaCS-2007-LaroussinieMO #atl #complexity #on the
On the Expressiveness and Complexity of ATL (FL, NM, GO), pp. 243–257.
LICS-2007-BouyerMOW #cost analysis
The Cost of Punctuality (PB, NM, JO, JW), pp. 109–120.
FoSSaCS-2002-LaroussinieMS #model checking #on the
On Model Checking Durational Kripke Structures (FL, NM, PS), pp. 264–279.
LICS-2002-LaroussinieMS #logic
Temporal Logic with Forgettable Past (FL, NM, PS), pp. 383–392.
FoSSaCS-2001-LaroussinieMS #model checking
Model Checking CTL+ and FCTL is Hard (FL, NM, PS), pp. 318–331.
CAV-2016-BouyerCM #automaton #reachability
Symbolic Optimal Reachability in Weighted Timed Automata (PB, MC, NM), pp. 513–530.
CAV-2019-RoussanalySM #abstraction #algorithm #automaton #refinement
Abstraction Refinement Algorithms for Timed Automata (VR, OS, NM), pp. 22–40.
Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.