Thomas Brihaye

Pierre Carlier

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

Real-Time Synthesis is Hard!

[BibT_eX]

[DOI]

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

Compositional Design of Stochastic Timed Automata.

[BibT_eX]

[DOI]

Proceedings of the Computer Science - Theory and Applications, 2016

2015

Simple strategies for Banach-Mazur games and sets of probability 1.

[BibT_eX]

[DOI]

Axel Haddad

Quentin Menet

Inf. Comput., 2015

Quantitative Games under Failures.

[BibT_eX]

[DOI]

Proceedings of the 35th IARCS Annual Conference on Foundation of Software Technology and Theoretical Computer Science, 2015

Simple Priced Timed Games are not That Simple.

[BibT_eX]

[DOI]

Proceedings of the 35th IARCS Annual Conference on Foundation of Software Technology and Theoretical Computer Science, 2015

Weak Subgame Perfect Equilibria and their Application to Quantitative Reachability.

[BibT_eX]

[DOI]

Proceedings of the 24th EACSL Annual Conference on Computer Science Logic, 2015

To Reach or not to Reach? Efficient Algorithms for Total-Payoff Games.

[BibT_eX]

[DOI]

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

2014

On Equilibria in Quantitative Games with Reachability/Safety Objectives.

[BibT_eX]

[DOI]

Julie De Pril

Theory Comput. Syst., 2014

Stochastic Timed Automata.

[BibT_eX]

[DOI]

Log. Methods Comput. Sci., 2014

Deciding the Value 1 Problem for Reachability in 1-Clock Decision Stochastic Timed Automata.

[BibT_eX]

[DOI]

Nathalie Bertrand

Blaise Genest

Proceedings of the Quantitative Evaluation of Systems - 11th International Conference, 2014

On MITL and Alternating Timed Automata over Infinite Words.

[BibT_eX]

[DOI]

Morgane Estiévenart

Gilles Geeraerts

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

Adding Negative Prices to Priced Timed Games.

[BibT_eX]

[DOI]

Shankara Narayanan Krishna

Gilles Geeraerts

Lakshmi Manasa

Benjamin Monmege

Ashutosh Trivedi

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

2013

Fairly Correct Systems: Beyond omega-regularity

[BibT_eX]

[DOI]

Quentin Menet

Proceedings of the Proceedings Fourth International Symposium on Games, 2013

Multiplayer Cost Games with Simple Nash Equilibria.

[BibT_eX]

[DOI]

Julie De Pril

Sven Schewe

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

On MITL and Alternating Timed Automata.

[BibT_eX]

[DOI]

Morgane Estiévenart

Gilles Geeraerts

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

Time-Bounded Reachability for Monotonic Hybrid Automata: Complexity and Fixed Points.

[BibT_eX]

[DOI]

Proceedings of the Automated Technology for Verification and Analysis, 2013

2012

Time-bounded Reachability for Hybrid Automata: Complexity and Fixpoints

[BibT_eX]

[DOI]

CoRR, 2012

On Subgame Perfection in Quantitative Reachability Games

[BibT_eX]

[DOI]

Log. Methods Comput. Sci., 2012

Almost-Sure Model-Checking of Reactive Timed Automata.

[BibT_eX]

[DOI]

Proceedings of the Ninth International Conference on Quantitative Evaluation of Systems, 2012

Subgame Perfection for Equilibria in Quantitative Reachability Games.

[BibT_eX]

[DOI]

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

2011

On Reachability for Hybrid Automata over Bounded Time.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming - 38th International Colloquium, 2011

Emptiness and Universality Problems in Timed Automata with Positive Frequency.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming - 38th International Colloquium, 2011

Antichain-Based QBF Solving.

[BibT_eX]

[DOI]

Proceedings of the Automated Technology for Verification and Analysis, 2011

2010

Formal language properties of hybrid systems with strong resets.

[BibT_eX]

[DOI]

Elaine Render

RAIRO Theor. Informatics Appl., 2010

Using Model Checking for Analyzing Distributed Power Control Problems.

[BibT_eX]

[DOI]

EURASIP J. Wirel. Commun. Netw., 2010

O-Minimal Hybrid Reachability Games

[BibT_eX]

[DOI]

Log. Methods Comput. Sci., 2010

Equilibria in Quantitative Reachability Games.

[BibT_eX]

[DOI]

Julie De Pril

Proceedings of the Computer Science, 2010

2009

Cell decomposition and dimension function in the theory of closed ordered differential fields.

[BibT_eX]

[DOI]

Christian Michaux

Cédric Rivière

Ann. Pure Appl. Log., 2009

Weighted o-minimal hybrid systems.

[BibT_eX]

[DOI]

Ann. Pure Appl. Log., 2009

ATL with Strategy Contexts and Bounded Memory.

[BibT_eX]

[DOI]

Arnaud Da Costa Lopes

François Laroussinie

Nicolas Markey

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

When Are Timed Automata Determinizable?

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 36th Internatilonal Colloquium, 2009

2008

Good Friends are Hard to Find!

[BibT_eX]

[DOI]

Proceedings of the 15th International Symposium on Temporal Representation and Reasoning, 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

Almost-Sure Model Checking of Infinite Paths in One-Clock Timed Automata.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Third Annual IEEE Symposium on Logic in Computer Science, 2008

Average-Price and Reachability-Price Games on Hybrid Automata with Strong Resets.

[BibT_eX]

[DOI]

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

2007

On the optimal reachability problem of weighted timed automata.

[BibT_eX]

[DOI]

Formal Methods Syst. Des., 2007

Words and Bisimulations of Dynamical Systems.

[BibT_eX]

[DOI]

Discret. Math. Theor. Comput. Sci., 2007

Weighted O-Minimal Hybrid Systems Are More Decidable Than Weighted Timed Automata!

[BibT_eX]

[DOI]

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

Minimum-Time Reachability in Timed Games.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 34th International Colloquium, 2007

Probabilistic and Topological Semantics for Timed Automata.

[BibT_eX]

[DOI]

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

Timed Concurrent Game Structures.

[BibT_eX]

[DOI]

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

2006

A note on the undecidability of the reachability problem for o-minimal dynamical systems.

[BibT_eX]

[DOI]

Math. Log. Q., 2006

Corrigendum to "On the expressiveness and decidability of o-minimal hybrid systems" [J. Complexity 21 (2005) 447-478].

[BibT_eX]

[DOI]

Christian Michaux

J. Complex., 2006

Improved undecidability results on weighted timed automata.

[BibT_eX]

[DOI]

Nicolas Markey

Inf. Process. Lett., 2006

On model-checking timed automata with stopwatch observers.

[BibT_eX]

[DOI]

Jean-François Raskin

Inf. Comput., 2006

Control in o-minimal Hybrid Systems.

[BibT_eX]

[DOI]

Proceedings of the 21th IEEE Symposium on Logic in Computer Science (LICS 2006), 2006

2005

On the expressiveness and decidability of o-minimal hybrid systems.

[BibT_eX]

[DOI]

Christian Michaux

J. Complex., 2005

On Optimal Timed Strategies.

[BibT_eX]

[DOI]

Jean-François Raskin

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

2004

On O-Minimal Hybrid Systems.

[BibT_eX]

[DOI]

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

Model-Checking for Weighted Timed Automata.

[BibT_eX]

[DOI]