Thomas Brihaye

According to our database1, Thomas Brihaye
  • authored at least 69 papers between 2004 and 2017.
  • has a "Dijkstra number"2 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2017
Dynamics and Coalitions in Sequential Games.
Proceedings of the Proceedings Eighth International Symposium on Games, 2017

When are Stochastic Transition Systems Tameable?
CoRR, 2017

Pseudopolynomial iterative algorithm to solve total-payoff games and min-cost reachability games.
Acta Inf., 2017

Timed-Automata-Based Verification of MITL over Signals.
Proceedings of the 24th International Symposium on Temporal Representation and Reasoning, 2017

MightyL: A Compositional Translation from MITL to Timed Automata.
Proceedings of the Computer Aided Verification - 29th International Conference, 2017

2016
Real-Time Synthesis is Hard!
CoRR, 2016

Efficient Energy Distribution in a Smart Grid using Multi-Player Games.
Proceedings of the Proceedings Cassting Workshop on Games for the Synthesis of Complex Systems and 3rd International Workshop on Synthesis of Complex Parameters and 3rd International Workshop on Synthesis of Complex Parameters, 2016

Analysing Decisive Stochastic Processes.
Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016

Real-Time Synthesis is Hard!
Proceedings of the Formal Modeling and Analysis of Timed Systems, 2016

Compositional Design of Stochastic Timed Automata.
Proceedings of the Computer Science - Theory and Applications, 2016

2015
Simple strategies for Banach-Mazur games and sets of probability 1.
Inf. Comput., 2015

Quantitative Games under Failures.
CoRR, 2015

Simple Priced Timed Games Are Not That Simple.
CoRR, 2015

Weak Subgame Perfect Equilibria and their Application to Quantitative Reachability.
CoRR, 2015

Quantitative Games under Failures.
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.
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.
Proceedings of the 24th EACSL Annual Conference on Computer Science Logic, 2015

To Reach or not to Reach? Efficient Algorithms for Total-Payoff Games.
Proceedings of the 26th International Conference on Concurrency Theory, 2015

2014
On Equilibria in Quantitative Games with Reachability/Safety Objectives.
Theory Comput. Syst., 2014

Adding Negative Prices to Priced Timed Games.
CoRR, 2014

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

On MITL and alternating timed automata over infinite words.
CoRR, 2014

Stochastic Timed Automata.
Logical Methods in Computer Science, 2014

Deciding the Value 1 Problem for Reachability in 1-Clock Decision Stochastic Timed Automata.
Proceedings of the Quantitative Evaluation of Systems - 11th International Conference, 2014

On MITL and Alternating Timed Automata over Infinite Words.
Proceedings of the Formal Modeling and Analysis of Timed Systems, 2014

Adding Negative Prices to Priced Timed Games.
Proceedings of the CONCUR 2014 - Concurrency Theory - 25th International Conference, 2014

2013
Fairly Correct Systems: Beyond omega-regularity
Proceedings of the Proceedings Fourth International Symposium on Games, 2013

On MITL and alternating timed automata
CoRR, 2013

Emptiness and Universality Problems in Timed Automata with Positive Frequency.
CoRR, 2013

Multiplayer Cost Games with Simple Nash Equilibria.
Proceedings of the Logical Foundations of Computer Science, International Symposium, 2013

On MITL and Alternating Timed Automata.
Proceedings of the Formal Modeling and Analysis of Timed Systems, 2013

Time-Bounded Reachability for Monotonic Hybrid Automata: Complexity and Fixed Points.
Proceedings of the Automated Technology for Verification and Analysis, 2013

2012
Time-bounded Reachability for Hybrid Automata: Complexity and Fixpoints
CoRR, 2012

Multiplayer Cost Games with Simple Nash Equilibria
CoRR, 2012

On Subgame Perfection in Quantitative Reachability Games
Logical Methods in Computer Science, 2012

On Equilibria in Quantitative Games with Reachability/Safety Objectives
CoRR, 2012

Almost-Sure Model-Checking of Reactive Timed Automata.
Proceedings of the Ninth International Conference on Quantitative Evaluation of Systems, 2012

Subgame Perfection for Equilibria in Quantitative Reachability Games.
Proceedings of the Foundations of Software Science and Computational Structures, 2012

2011
On Reachability for Hybrid Automata over Bounded Time
CoRR, 2011

On Reachability for Hybrid Automata over Bounded Time.
Proceedings of the Automata, Languages and Programming - 38th International Colloquium, 2011

Emptiness and Universality Problems in Timed Automata with Positive Frequency.
Proceedings of the Automata, Languages and Programming - 38th International Colloquium, 2011

Antichain-Based QBF Solving.
Proceedings of the Automated Technology for Verification and Analysis, 2011

2010
Formal language properties of hybrid systems with strong resets.
RAIRO - Theor. Inf. and Applic., 2010

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

O-Minimal Hybrid Reachability Games
Logical Methods in Computer Science, 2010

Equilibria in Quantitative Reachability Games.
Proceedings of the Computer Science, 2010

2009
Cell decomposition and dimension function in the theory of closed ordered differential fields.
Ann. Pure Appl. Logic, 2009

Weighted o-minimal hybrid systems.
Ann. Pure Appl. Logic, 2009

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

When Are Timed Automata Determinizable?
Proceedings of the Automata, Languages and Programming, 36th Internatilonal Colloquium, 2009

2008
Good Friends are Hard to Find!
Proceedings of the 15th International Symposium on Temporal Representation and Reasoning, 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

Almost-Sure Model Checking of Infinite Paths in One-Clock Timed Automata.
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.
Proceedings of the Formal Modeling and Analysis of Timed Systems, 2008

2007
On the optimal reachability problem of weighted timed automata.
Formal Methods in System Design, 2007

Words and Bisimulations of Dynamical Systems.
Discrete Mathematics & Theoretical Computer Science, 2007

Weighted O-Minimal Hybrid Systems Are More Decidable Than Weighted Timed Automata!
Proceedings of the Logical Foundations of Computer Science, International Symposium, 2007

Minimum-Time Reachability in Timed Games.
Proceedings of the Automata, Languages and Programming, 34th International Colloquium, 2007

Probabilistic and Topological Semantics for Timed Automata.
Proceedings of the FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science, 2007

Timed Concurrent Game Structures.
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.
Math. Log. Q., 2006

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

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

On model-checking timed automata with stopwatch observers.
Inf. Comput., 2006

Control in o-minimal Hybrid Systems.
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.
J. Complexity, 2005

On Optimal Timed Strategies.
Proceedings of the Formal Modeling and Analysis of Timed Systems, 2005

2004
On O-Minimal Hybrid Systems.
Proceedings of the Hybrid Systems: Computation and Control, 7th International Workshop, 2004

Model-Checking for Weighted Timed Automata.
Proceedings of the Formal Techniques, 2004


  Loading...