Nicolas Markey

According to our database1, Nicolas Markey
  • authored at least 108 papers between 2001 and 2017.
  • has a "Dijkstra number"2 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2017
Timed-automata abstraction of switched dynamical systems using control invariants.
Real-Time Systems, 2017

Nash equilibria in symmetric graph games with partial observation.
Inf. Comput., 2017

Dependences in Strategy Logic.
CoRR, 2017

Courcelle's Theorem Made Dynamic.
CoRR, 2017

Bounding Average-Energy Games.
Proceedings of the Foundations of Software Science and Computation Structures, 2017

On the Determinization of Timed Systems.
Proceedings of the Formal Modeling and Analysis of Timed Systems, 2017

Timed Temporal Logics.
Proceedings of the Models, Algorithms, Logics and Tools, 2017

2016
On the semantics of Strategy Logic.
Inf. Process. Lett., 2016

Distributed Synthesis of State-Dependent Switching Control.
CoRR, 2016

Stochastic Equilibria under Imprecise Deviations in Terminal-Reward Concurrent Games.
Proceedings of the Seventh International Symposium on Games, 2016

Reachability in Networks of Register Protocols under Stochastic Schedulers.
CoRR, 2016

Dynamic Complexity of Parity Games with Bounded Tree-Width.
CoRR, 2016

Bounding Average-energy Games.
CoRR, 2016

Symbolic Optimal Reachability in Weighted Timed Automata.
CoRR, 2016

Distributed Synthesis of State-Dependent Switching Control.
Proceedings of the Reachability Problems - 10th International Workshop, 2016

Reachability in Networks of Register Protocols under Stochastic Schedulers.
Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016

On the Expressiveness of QCTL.
Proceedings of the 27th International Conference on Concurrency Theory, 2016

Symbolic Optimal Reachability in Weighted Timed Automata.
Proceedings of the Computer Aided Verification - 28th International Conference, 2016

2015
Robust reachability in timed automata and games: A game-based approach.
Theor. Comput. Sci., 2015

Augmenting ATL with strategy contexts.
Inf. Comput., 2015

Permissive strategies in timed automata and games.
ECEASST, 2015

Non-Zero-Sum-Games and Control (Dagstuhl Seminar 15061).
Dagstuhl Reports, 2015

ATLsc with partial observation.
Proceedings of the Proceedings Sixth International Symposium on Games, 2015

Average-energy games (full version).
CoRR, 2015

Average-energy games.
Proceedings of the Proceedings Sixth International Symposium on Games, 2015

Pure Nash Equilibria in Concurrent Deterministic Games.
Logical Methods in Computer Science, 2015

Game-based Synthesis of Distributed Controllers for Sampled Switched Systems.
Proceedings of the 2nd International Workshop on Synthesis of Complex Parameters, 2015

Weighted Strategy Logic with Boolean Goals Over One-Counter Games.
Proceedings of the 35th IARCS Annual Conference on Foundation of Software Technology and Theoretical Computer Science, 2015

Timed-Automata Abstraction of Switched Dynamical Systems Using Control Funnels.
Proceedings of the Formal Modeling and Analysis of Timed Systems, 2015

Language Preservation Problems in Parametric Timed Automata.
Proceedings of the Formal Modeling and Analysis of Timed Systems, 2015

On the Value Problem in Weighted Timed Games.
Proceedings of the 26th International Conference on Concurrency Theory, 2015

2014
Lower-bound-constrained runs in weighted timed automata.
Perform. Eval., 2014

Shrinking timed automata.
Inf. Comput., 2014

Cassting: Synthesizing Complex Systems Using Non-Zero-Sum Games.
ERCIM News, 2014

Quantified CTL: Expressiveness and Complexity.
Logical Methods in Computer Science, 2014

Nash Equilibria in Symmetric Games with Partial Observation.
Proceedings of the Proceedings 2nd International Workshop on Strategic Reasoning, 2014

Component-based analysis of hierarchical scheduling using linear hybrid automata.
Proceedings of the 2014 IEEE 20th International Conference on Embedded and Real-Time Computing Systems and Applications, 2014

Mixed Nash Equilibria in Concurrent Terminal-Reward Games.
Proceedings of the 34th International Conference on Foundation of Software Technology and Theoretical Computer Science, 2014

Synchronizing Words for Weighted and Timed Automata.
Proceedings of the 34th International Conference on Foundation of Software Technology and Theoretical Computer Science, 2014

Averaging in LTL.
Proceedings of the CONCUR 2014 - Concurrency Theory - 25th International Conference, 2014

Symmetry Reduction in Infinite Games with Finite Branching.
Proceedings of the Automated Technology for Verification and Analysis, 2014

Quantitative Verification of Weighted Kripke Structures.
Proceedings of the Automated Technology for Verification and Analysis, 2014

2013
Satisfiability of ATL with strategy contexts.
Proceedings of the Proceedings Fourth International Symposium on Games, 2013

Robustness in Timed Automata.
Proceedings of the Reachability Problems - 7th International Workshop, 2013

Robust Weighted Timed Automata and Games.
Proceedings of the Formal Modeling and Analysis of Timed Systems, 2013

Robust Controller Synthesis in Timed Automata.
Proceedings of the CONCUR 2013 - Concurrency Theory - 24th International Conference, 2013

2012
On termination and invariance for faulty channel machines.
Formal Asp. Comput., 2012

Querying Trajectories through Model Checking based on Timed Automata.
Proceedings of the XXVII Simpósio Brasileiro de Banco de Dados, 2012

Lower-Bound Constrained Runs in Weighted Timed Automata.
Proceedings of the Ninth International Conference on Quantitative Evaluation of Systems, 2012

Robust Reachability in Timed Automata: A Game-Based Approach.
Proceedings of the Automata, Languages, and Programming - 39th International Colloquium, 2012

Concurrent Games with Ordered Objectives.
Proceedings of the Foundations of Software Science and Computational Structures, 2012

Quantified CTL: Expressiveness and Model Checking - (Extended Abstract).
Proceedings of the CONCUR 2012 - Concurrency Theory - 23rd International Conference, 2012

2011
Measuring Permissiveness in Parity Games: Mean-Payoff Parity Games Revisited
CoRR, 2011

Quantitative analysis of real-time systems using priced timed automata.
Commun. ACM, 2011

Robustness in real-time systems.
Proceedings of the Industrial Embedded Systems (SIES), 2011

Shrinking Timed Automata.
Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2011

Nash Equilibria in Concurrent Games with Büchi Objectives.
Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2011

Robust Model-Checking of Timed Automata via Pumping in Channel Machines.
Proceedings of the Formal Modeling and Analysis of Timed Systems, 2011

Timed Automata Can Always Be Made Implementable.
Proceedings of the CONCUR 2011 - Concurrency Theory - 22nd International Conference, 2011

Measuring Permissiveness in Parity Games: Mean-Payoff Parity Games Revisited.
Proceedings of the Automated Technology for Verification and Analysis, 2011

2010
On the expressiveness of TPTL and MTL.
Inf. Comput., 2010

Using Model Checking for Analyzing Distributed Power Control Problems.
EURASIP J. Wireless Comm. and Networking, 2010

Timed automata with observers under energy constraints.
Proceedings of the 13th ACM International Conference on Hybrid Systems: Computation and Control, 2010

ATL with Strategy Contexts: Expressiveness and Model Checking.
Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2010

Computing Rational Radical Sums in Uniform TC^0.
Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2010

Computing Equilibria in Two-Player Timed Games via Turn-Based Finite Games.
Proceedings of the Formal Modeling and Analysis of Timed Systems, 2010

Nash Equilibria for Reachability Objectives in Multi-player Timed Games.
Proceedings of the CONCUR 2010 - Concurrency Theory, 21th International Conference, 2010

2009
ATL with Strategy Contexts and Bounded Memory.
Proceedings of the Logical Foundations of Computer Science, International Symposium, 2009

Measuring Permissivity in Finite Games.
Proceedings of the CONCUR 2009 - Concurrency Theory, 20th International Conference, 2009

2008
On the Expressiveness and Complexity of ATL.
Logical Methods in Computer Science, 2008

Model Checking One-Clock Priced Timed Automata.
Logical Methods in Computer Science, 2008

Robust safety of timed automata.
Formal Methods in System Design, 2008

Model Checking One-clock Priced Timed Automata
CoRR, 2008

On the Expressiveness and Complexity of ATL
CoRR, 2008

On Termination for Faulty Channel Machines
CoRR, 2008

Good Friends are Hard to Find!
Proceedings of the 15th International Symposium on Temporal Representation and Reasoning, 2008

On Termination for Faulty Channel Machines.
Proceedings of the STACS 2008, 2008

Quantitative Model-Checking of One-Clock Timed Automata under Probabilistic Semantics.
Proceedings of the Fifth International Conference on the Quantitative Evaluaiton of Systems (QEST 2008), 2008

On Expressiveness and Complexity in Real-Time Model Checking.
Proceedings of the Automata, Languages and Programming, 35th International Colloquium, 2008

Robust Analysis of Timed Automata via Channel Machines.
Proceedings of the Foundations of Software Science and Computational Structures, 2008

Infinite Runs in Weighted Timed Automata with Energy Constraints.
Proceedings of the Formal Modeling and Analysis of Timed Systems, 2008

2007
The Cost of Punctuality.
Proceedings of the 22nd IEEE Symposium on Logic in Computer Science (LICS 2007), 2007

On the Expressiveness and Complexity of ATL.
Proceedings of the Foundations of Software Science and Computational Structures, 2007

Model-Checking One-Clock Priced Timed Automata.
Proceedings of the Foundations of Software Science and Computational Structures, 2007

Costs Are Expensive!
Proceedings of the Formal Modeling and Analysis of Timed Systems, 2007

Timed Concurrent Game Structures.
Proceedings of the CONCUR 2007 - Concurrency Theory, 18th International Conference, 2007

2006
Model checking restricted sets of timed paths.
Theor. Comput. Sci., 2006

Efficient timed model checking for discrete-time systems.
Theor. Comput. Sci., 2006

Mu-calculus path checking.
Inf. Process. Lett., 2006

Improved undecidability results on weighted timed automata.
Inf. Process. Lett., 2006

Robust Model-Checking of Linear-Time Properties in Timed Automata.
Proceedings of the LATIN 2006: Theoretical Informatics, 2006

Almost Optimal Strategies in One Clock Priced Timed Games.
Proceedings of the FSTTCS 2006: Foundations of Software Technology and Theoretical Computer Science, 2006

Model-Checking Timed.
Proceedings of the Formal Modeling and Analysis of Timed Systems, 2006

2005
On the Expressiveness of TPTL and MTL.
Proceedings of the FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science, 2005

2004
A PTIME-complete matching problem for SLP-compressed words.
Inf. Process. Lett., 2004

Past is for free: on the complexity of verifying linear temporal properties with past.
Acta Inf., 2004

TSMV: A Symbolic Model Checker for Quantitative Analysis of Systems.
Proceedings of the 1st International Conference on Quantitative Evaluation of Systems (QEST 2004), 2004

Non-deterministic Temporal Logics for General Flow Systems.
Proceedings of the Hybrid Systems: Computation and Control, 7th International Workshop, 2004

Robustness and Implementability of Timed Automata.
Proceedings of the Formal Techniques, 2004

Symbolic Model Checking for Simply-Timed Systems.
Proceedings of the Formal Techniques, 2004

Model Checking Restricted Sets of Timed Paths.
Proceedings of the CONCUR 2004 - Concurrency Theory, 15th International Conference, London, UK, August 31, 2004

Model Checking Timed Automata with One or Two Clocks.
Proceedings of the CONCUR 2004 - Concurrency Theory, 15th International Conference, London, UK, August 31, 2004

2003
Temporal logic with past is exponentially more succinct, Concurrency Column.
Bulletin of the EATCS, 2003

Model Checking a Path.
Proceedings of the CONCUR 2003, 2003

2002
Past is for Free: on the Complexity of Verifying Linear Temporal Properties with Past.
Electr. Notes Theor. Comput. Sci., 2002

Temporal Logic with Forgettable Past.
Proceedings of the 17th IEEE Symposium on Logic in Computer Science (LICS 2002), 2002

On Model Checking Durational Kripke Structures.
Proceedings of the Foundations of Software Science and Computation Structures, 2002

2001
Model Checking CTL+ and FCTL is Hard.
Proceedings of the Foundations of Software Science and Computation Structures, 2001


  Loading...