Nicolas Markey

Ritam Raha

Proceedings of the Proceedings Tenth International Symposium on Games, 2019

Abstraction Refinement Algorithms for Timed Automata.

[BibT_eX]

[DOI]

Victor Roussanaly

Proceedings of the Computer Aided Verification - 31st International Conference, 2019

2018

Model Checking Real-Time Systems.

[BibT_eX]

[DOI]

Uli Fahrenberg

Joël Ouaknine

James Worrell

Proceedings of the Handbook of Model Checking., 2018

Compositional synthesis of state-dependent switching control.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2018

Multi-weighted Markov Decision Processes with Reachability Objectives.

[BibT_eX]

[DOI]

Proceedings of the Proceedings Ninth International Symposium on Games, 2018

Control_strategies_for_off-line_testing_of_timed_systems.

[BibT_eX]

[DOI]

Léo Henry

Thierry Jéron

CoRR, 2018

Average-energy games.

[BibT_eX]

[DOI]

Acta Informatica, 2018

Parameterized Verification of Synchronization in Constrained Reconfigurable Broadcast Networks.

[BibT_eX]

[DOI]

A. R. Balasubramanian

Nathalie Bertrand

Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2018

Efficient Timed Diagnosis Using Automata with Timed Domains.

[BibT_eX]

[DOI]

Samy Jaziri

Proceedings of the Runtime Verification - 18th International Conference, 2018

2017

Timed-automata abstraction of switched dynamical systems using control invariants.

[BibT_eX]

[DOI]

Philipp Schlehuber-Caissier

Nicolas Perrin

Real Time Syst., 2017

Nash equilibria in symmetric graph games with partial observation.

[BibT_eX]

[DOI]

Steen Vester

Inf. Comput., 2017

Courcelle's Theorem Made Dynamic.

[BibT_eX]

[DOI]

Patricia Bouyer-Decitre

Vincent Jugé

CoRR, 2017

Temporal Logics for Multi-Agent Systems (Invited Talk).

[BibT_eX]

[DOI]

Proceedings of the 42nd International Symposium on Mathematical Foundations of Computer Science, 2017

Bounding Average-Energy Games.

[BibT_eX]

[DOI]

Proceedings of the Foundations of Software Science and Computation Structures, 2017

On the Determinization of Timed Systems.

[BibT_eX]

[DOI]

Samy Jaziri

Proceedings of the Formal Modeling and Analysis of Timed Systems, 2017

Timed Temporal Logics.

[BibT_eX]

[DOI]

Proceedings of the Models, Algorithms, Logics and Tools, 2017

2016

On the semantics of Strategy Logic.

[BibT_eX]

[DOI]

Patrick Gardy

Inf. Process. Lett., 2016

Stochastic Equilibria under Imprecise Deviations in Terminal-Reward Concurrent Games.

[BibT_eX]

[DOI]

Daniel Stan

Proceedings of the Seventh International Symposium on Games, 2016

Dynamic Complexity of Parity Games with Bounded Tree-Width.

[BibT_eX]

[DOI]

Vincent Jugé

CoRR, 2016

Distributed Synthesis of State-Dependent Switching Control.

[BibT_eX]

[DOI]

Proceedings of the Reachability Problems - 10th International Workshop, 2016

Reachability in Networks of Register Protocols under Stochastic Schedulers.

[BibT_eX]

[DOI]

Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016

On the Expressiveness of QCTL.

[BibT_eX]

[DOI]

Amélie David

Proceedings of the 27th International Conference on Concurrency Theory, 2016

Symbolic Optimal Reachability in Weighted Timed Automata.

[BibT_eX]

[DOI]

Maximilien Colange

Proceedings of the Computer Aided Verification - 28th International Conference, 2016

2015

Robust reachability in timed automata and games: A game-based approach.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2015

Augmenting ATL with strategy contexts.

[BibT_eX]

[DOI]

Inf. Comput., 2015

Permissive strategies in timed automata and games.

[BibT_eX]

[DOI]

Erwin Fang

Electron. Commun. Eur. Assoc. Softw. Sci. Technol., 2015

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

[BibT_eX]

[DOI]

Krishnendu Chatterjee

Stéphane Lafortune

Wolfgang Thomas

Dagstuhl Reports, 2015

ATLsc with partial observation.

[BibT_eX]

[DOI]

Arnaud Sangnier

Proceedings of the Proceedings Sixth International Symposium on Games, 2015

Average-energy games (full version).

[BibT_eX]

[DOI]

CoRR, 2015

Pure Nash Equilibria in Concurrent Deterministic Games.

[BibT_eX]

[DOI]

Log. Methods Comput. Sci., 2015

Game-based Synthesis of Distributed Controllers for Sampled Switched Systems.

[BibT_eX]

[DOI]

Laurent Fribourg

Ulrich Kühne

Proceedings of the 2nd International Workshop on Synthesis of Complex Parameters, 2015

Weighted Strategy Logic with Boolean Goals Over One-Counter Games.

[BibT_eX]

[DOI]

Patrick Gardy

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.

[BibT_eX]

[DOI]

Philipp Schlehuber-Caissier

Nicolas Perrin

Proceedings of the Formal Modeling and Analysis of Timed Systems, 2015

Language Preservation Problems in Parametric Timed Automata.

[BibT_eX]

[DOI]

Étienne André

Proceedings of the Formal Modeling and Analysis of Timed Systems, 2015

On the Value Problem in Weighted Timed Games.

[BibT_eX]

[DOI]

Samy Jaziri

Proceedings of the 26th International Conference on Concurrency Theory, 2015

2014

Lower-bound-constrained runs in weighted timed automata.

[BibT_eX]

[DOI]

Kim G. Larsen

Perform. Evaluation, 2014

Shrinking timed automata.

[BibT_eX]

[DOI]

Inf. Comput., 2014

Cassting: Synthesizing Complex Systems Using Non-Zero-Sum Games.

[BibT_eX]

[DOI]

ERCIM News, 2014

Quantified CTL: Expressiveness and Complexity.

[BibT_eX]

[DOI]

Log. Methods Comput. Sci., 2014

Nash Equilibria in Symmetric Games with Partial Observation.

[BibT_eX]

[DOI]

Steen Vester

Proceedings of the Proceedings 2nd International Workshop on Strategic Reasoning, 2014

Component-based analysis of hierarchical scheduling using linear hybrid automata.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Daniel Stan

Proceedings of the 34th International Conference on Foundation of Software Technology and Theoretical Computer Science, 2014

Synchronizing Words for Weighted and Timed Automata.

[BibT_eX]

[DOI]

Laurent Doyen

Line Juhl

Mahsa Shirmohammadi

Proceedings of the 34th International Conference on Foundation of Software Technology and Theoretical Computer Science, 2014

Averaging in LTL.

[BibT_eX]

[DOI]

Raj Mohan Matteplackel

Proceedings of the CONCUR 2014 - Concurrency Theory - 25th International Conference, 2014

Symmetry Reduction in Infinite Games with Finite Branching.

[BibT_eX]

[DOI]

Steen Vester

Proceedings of the Automated Technology for Verification and Analysis, 2014

Quantitative Verification of Weighted Kripke Structures.

[BibT_eX]

[DOI]

Patrick Gardy

Proceedings of the Automated Technology for Verification and Analysis, 2014

2013

Satisfiability of ATL with strategy contexts.

[BibT_eX]

[DOI]

Proceedings of the Proceedings Fourth International Symposium on Games, 2013

Robustness in Timed Automata.

[BibT_eX]

[DOI]

Proceedings of the Reachability Problems - 7th International Workshop, 2013

Robust Weighted Timed Automata and Games.

[BibT_eX]

[DOI]

Proceedings of the Formal Modeling and Analysis of Timed Systems, 2013

Robust Controller Synthesis in Timed Automata.

[BibT_eX]

[DOI]

Proceedings of the CONCUR 2013 - Concurrency Theory - 24th International Conference, 2013

Control of Timed Systems.

[BibT_eX]

[DOI]

Franck Cassez

Proceedings of the Communicating Embedded Systems, 2013

2012

On termination and invariance for faulty channel machines.

[BibT_eX]

[DOI]

Formal Aspects Comput., 2012

Querying Trajectories through Model Checking based on Timed Automata.

[BibT_eX]

[DOI]

Diego V. Simões S.

Henrique Viana

José Antônio Fernandes de Macêdo

Proceedings of the XXVII Simpósio Brasileiro de Banco de Dados, 2012

Robust Reachability in Timed Automata: A Game-Based Approach.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages, and Programming - 39th International Colloquium, 2012

Concurrent Games with Ordered Objectives.

[BibT_eX]

[DOI]

Proceedings of the Foundations of Software Science and Computational Structures, 2012

Quantified CTL: Expressiveness and Model Checking - (Extended Abstract).

[BibT_eX]

[DOI]

Arnaud Da Costa Lopes

Proceedings of the CONCUR 2012 - Concurrency Theory - 23rd International Conference, 2012

2011

Quantitative analysis of real-time systems using priced timed automata.

[BibT_eX]

[DOI]

Commun. ACM, 2011

Robustness in real-time systems.

[BibT_eX]

[DOI]

Proceedings of the Industrial Embedded Systems (SIES), 2011

Nash Equilibria in Concurrent Games with Büchi Objectives.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Proceedings of the Formal Modeling and Analysis of Timed Systems, 2011

Timed Automata Can Always Be Made Implementable.

[BibT_eX]

[DOI]

Proceedings of the CONCUR 2011 - Concurrency Theory - 22nd International Conference, 2011

Measuring Permissiveness in Parity Games: Mean-Payoff Parity Games Revisited.

[BibT_eX]

[DOI]

Proceedings of the Automated Technology for Verification and Analysis, 2011

2010

On the expressiveness of TPTL and MTL.

[BibT_eX]

[DOI]

Fabrice Chevalier

Inf. Comput., 2010

Using Model Checking for Analyzing Distributed Power Control Problems.

[BibT_eX]

[DOI]

EURASIP J. Wirel. Commun. Netw., 2010

Timed automata with observers under energy constraints.

[BibT_eX]

[DOI]

Proceedings of the 13th ACM International Conference on Hybrid Systems: Computation and Control, 2010

ATL with Strategy Contexts: Expressiveness and Model Checking.

[BibT_eX]

[DOI]

Arnaud Da Costa Lopes

Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2010

Computing Rational Radical Sums in Uniform TC^0.

[BibT_eX]

[DOI]

Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2010

Computing Equilibria in Two-Player Timed Games <i>via</i> Turn-Based Finite Games.

[BibT_eX]

[DOI]

Romain Brenguier

Proceedings of the Formal Modeling and Analysis of Timed Systems, 2010

Nash Equilibria for Reachability Objectives in Multi-player Timed Games.

[BibT_eX]

[DOI]

Romain Brenguier

Proceedings of the CONCUR 2010 - Concurrency Theory, 21th International Conference, 2010

2009

ATL with Strategy Contexts and Bounded Memory.

[BibT_eX]

[DOI]

Thomas Brihaye

Arnaud Da Costa Lopes

Proceedings of the Logical Foundations of Computer Science, International Symposium, 2009

Measuring Permissivity in Finite Games.

[BibT_eX]

[DOI]

Proceedings of the CONCUR 2009 - Concurrency Theory, 20th International Conference, 2009

2008

On the Expressiveness and Complexity of ATL.

[BibT_eX]

[DOI]

Ghassan Oreiby

Log. Methods Comput. Sci., 2008

Model Checking One-Clock Priced Timed Automata.

[BibT_eX]

[DOI]

Log. Methods Comput. Sci., 2008

Robust safety of timed automata.

[BibT_eX]

[DOI]

Formal Methods Syst. Des., 2008

Good Friends are Hard to Find!

[BibT_eX]

[DOI]

Proceedings of the 15th International Symposium on Temporal Representation and Reasoning, 2008

On Termination for Faulty Channel Machines.

[BibT_eX]

[DOI]

Proceedings of the STACS 2008, 2008

Quantitative Model-Checking of One-Clock Timed Automata under Probabilistic Semantics.

[BibT_eX]

[DOI]

Proceedings of the Fifth International Conference on the Quantitative Evaluaiton of Systems (QEST 2008), 2008

On Expressiveness and Complexity in Real-Time Model Checking.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 35th International Colloquium, 2008

Robust Analysis of Timed Automata via Channel Machines.

[BibT_eX]

[DOI]

Pierre-Alain Reynier

Proceedings of the Foundations of Software Science and Computational Structures, 2008

Infinite Runs in Weighted Timed Automata with Energy Constraints.

[BibT_eX]

[DOI]

Ulrich Fahrenberg

Jirí Srba

Proceedings of the Formal Modeling and Analysis of Timed Systems, 2008

2007

The Cost of Punctuality.

[BibT_eX]

[DOI]

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

Costs Are Expensive!

[BibT_eX]

[DOI]

Proceedings of the Formal Modeling and Analysis of Timed Systems, 2007

Timed Concurrent Game Structures.

[BibT_eX]

[DOI]

Proceedings of the CONCUR 2007 - Concurrency Theory, 18th International Conference, 2007

2006

Model checking restricted sets of timed paths.

[BibT_eX]

[DOI]

Jean-François Raskin

Theor. Comput. Sci., 2006

Efficient timed model checking for discrete-time systems.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2006

Mu-calculus path checking.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2006

Improved undecidability results on weighted timed automata.

[BibT_eX]

[DOI]

Thomas Brihaye

Inf. Process. Lett., 2006

Robust Model-Checking of Linear-Time Properties in Timed Automata.

[BibT_eX]

[DOI]

Pierre-Alain Reynier

Proceedings of the LATIN 2006: Theoretical Informatics, 2006

Almost Optimal Strategies in One Clock Priced Timed Games.

[BibT_eX]

[DOI]

Jacob Illum Rasmussen

Proceedings of the FSTTCS 2006: Foundations of Software Technology and Theoretical Computer Science, 2006

Model-Checking Timed.

[BibT_eX]

[DOI]

Ghassan Oreiby

Proceedings of the Formal Modeling and Analysis of Timed Systems, 2006

2004

A PTIME-complete matching problem for SLP-compressed words.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2004

TSMV: A Symbolic Model Checker for Quantitative Analysis of Systems.

[BibT_eX]

[DOI]

Proceedings of the 1st International Conference on Quantitative Evaluation of Systems (QEST 2004), 2004

Non-deterministic Temporal Logics for General Flow Systems.

[BibT_eX]

[DOI]

Proceedings of the Hybrid Systems: Computation and Control, 7th International Workshop, 2004

Robustness and Implementability of Timed Automata.

[BibT_eX]

[DOI]

Proceedings of the Formal Techniques, 2004

Symbolic Model Checking for Simply-Timed Systems.

[BibT_eX]

[DOI]

Proceedings of the Formal Techniques, 2004

Model Checking Timed Automata with One or Two Clocks.

[BibT_eX]

[DOI]

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.

[BibT_eX]

Bull. EATCS, 2003

Model Checking a Path.

[BibT_eX]

[DOI]

Proceedings of the CONCUR 2003, 2003

2002

Past is for Free: on the Complexity of Verifying Linear Temporal Properties with Past.

[BibT_eX]

[DOI]

Proceedings of the 9th International Workshop on Expressiveness in Concurrency, 2002

Temporal Logic with Forgettable Past.

[BibT_eX]

[DOI]

Proceedings of the 17th IEEE Symposium on Logic in Computer Science (LICS 2002), 2002

On Model Checking Durational Kripke Structures.

[BibT_eX]

[DOI]

Proceedings of the Foundations of Software Science and Computation Structures, 2002

2001

Model Checking CTL<sup>+</sup> and FCTL is Hard.

[BibT_eX]

[DOI]