default search action
Thomas Brihaye
- > Home > Persons > Thomas Brihaye
Publications
- 2022
- [j25]Thomas Brihaye, Gilles Geeraerts, Axel Haddad, Engel Lefaucheux, Benjamin Monmege:
One-Clock Priced Timed Games with Negative Weights. Log. Methods Comput. Sci. 18(3) (2022) - 2020
- [j21]Thomas Brihaye, Gilles Geeraerts, Marion Hallet, Stéphane Le Roux:
On the termination of dynamics in sequential games. Inf. Comput. 272: 104505 (2020) - [i21]Thomas Brihaye, Gilles Geeraerts, Axel Haddad, Engel Lefaucheux, Benjamin Monmege:
One-Clock Priced Timed Games with Arbitrary Weights. CoRR abs/2009.03074 (2020) - 2019
- [c42]Thomas Brihaye, Gilles Geeraerts, Marion Hallet, Benjamin Monmege, Bruno Quoitin:
Dynamics on Games: Simulation-Based Techniques and Applications to Routing. FSTTCS 2019: 35:1-35:14 - [i16]Thomas Brihaye, Gilles Geeraerts, Marion Hallet, Benjamin Monmege, Bruno Quoitin:
Dynamics on Games: Simulation-Based Techniques and Applications to Routing. CoRR abs/1910.00094 (2019) - 2018
- [c40]Thomas Brihaye, Gilles Geeraerts, Hsi-Ming Ho, Arthur Milchior, Benjamin Monmege:
Efficient Algorithms and Tools for MITL Model-Checking and Synthesis. ICECCS 2018: 180-184 - 2017
- [j17]Thomas Brihaye, Gilles Geeraerts, Axel Haddad, Benjamin Monmege:
Pseudopolynomial iterative algorithm to solve total-payoff games and min-cost reachability games. Acta Informatica 54(1): 85-125 (2017) - [c38]Thomas Brihaye, Gilles Geeraerts, Hsi-Ming Ho, Benjamin Monmege:
MightyL: A Compositional Translation from MITL to Timed Automata. CAV (1) 2017: 421-440 - [c37]Thomas Brihaye, Gilles Geeraerts, Hsi-Ming Ho, Benjamin Monmege:
Timed-Automata-Based Verification of MITL over Signals. TIME 2017: 7:1-7:19 - [c36]Thomas Brihaye, Gilles Geeraerts, Marion Hallet, Stéphane Le Roux:
Dynamics and Coalitions in Sequential Games. GandALF 2017: 136-150 - 2016
- [c34]Thomas Brihaye, Morgane Estiévenart, Gilles Geeraerts, Hsi-Ming Ho, Benjamin Monmege, Nathalie Sznajder:
Real-Time Synthesis is Hard! FORMATS 2016: 105-120 - [c32]Thomas Brihaye, Amit Kumar Dhar, Gilles Geeraerts, Axel Haddad, Benjamin Monmege:
Efficient Energy Distribution in a Smart Grid using Multi-Player Games. Cassting/SynCoP 2016: 1-12 - [i13]Thomas Brihaye, Morgane Estiévenart, Gilles Geeraerts, Hsi-Ming Ho, Benjamin Monmege, Nathalie Sznajder:
Real-Time Synthesis is Hard! CoRR abs/1606.07124 (2016) - 2015
- [c31]Thomas Brihaye, Gilles Geeraerts, Axel Haddad, Benjamin Monmege:
To Reach or not to Reach? Efficient Algorithms for Total-Payoff Games. CONCUR 2015: 297-310 - [c29]Thomas Brihaye, Gilles Geeraerts, Axel Haddad, Engel Lefaucheux, Benjamin Monmege:
Simple Priced Timed Games are not That Simple. FSTTCS 2015: 278-292 - [c28]Thomas Brihaye, Gilles Geeraerts, Axel Haddad, Benjamin Monmege, Guillermo A. Pérez, Gabriel Renault:
Quantitative Games under Failures. FSTTCS 2015: 293-306 - [i11]Thomas Brihaye, Gilles Geeraerts, Axel Haddad, Benjamin Monmege, Guillermo A. Pérez, Gabriel Renault:
Quantitative Games under Failures. CoRR abs/1504.06744 (2015) - [i10]Thomas Brihaye, Gilles Geeraerts, Axel Haddad, Engel Lefaucheux, Benjamin Monmege:
Simple Priced Timed Games Are Not That Simple. CoRR abs/1507.03786 (2015) - 2014
- [c27]Thomas Brihaye, Gilles Geeraerts, Shankara Narayanan Krishna, Lakshmi Manasa, Benjamin Monmege, Ashutosh Trivedi:
Adding Negative Prices to Priced Timed Games. CONCUR 2014: 560-575 - [c26]Thomas Brihaye, Morgane Estiévenart, Gilles Geeraerts:
On MITL and Alternating Timed Automata over Infinite Words. FORMATS 2014: 69-84 - [i9]Thomas Brihaye, Gilles Geeraerts, Shankara Narayanan Krishna, Lakshmi Manasa, Benjamin Monmege, Ashutosh Trivedi:
Adding Negative Prices to Priced Timed Games. CoRR abs/1404.5894 (2014) - [i8]Thomas Brihaye, Morgane Estiévenart, Gilles Geeraerts:
On MITL and alternating timed automata over infinite words. CoRR abs/1406.4395 (2014) - [i7]Thomas Brihaye, Gilles Geeraerts, Axel Haddad, Benjamin Monmege:
To Reach or not to Reach? Efficient Algorithms for Total-Payoff Games. CoRR abs/1407.5030 (2014) - 2013
- [c24]Thomas Brihaye, Laurent Doyen, Gilles Geeraerts, Joël Ouaknine, Jean-François Raskin, James Worrell:
Time-Bounded Reachability for Monotonic Hybrid Automata: Complexity and Fixed Points. ATVA 2013: 55-70 - [c23]Thomas Brihaye, Morgane Estiévenart, Gilles Geeraerts:
On MITL and Alternating Timed Automata. FORMATS 2013: 47-61 - [i6]Thomas Brihaye, Morgane Estiévenart, Gilles Geeraerts:
On MITL and alternating timed automata. CoRR abs/1304.2814 (2013) - 2012
- [i2]Thomas Brihaye, Laurent Doyen, Gilles Geeraerts, Joël Ouaknine, Jean-François Raskin, James Worrell:
Time-bounded Reachability for Hybrid Automata: Complexity and Fixpoints. CoRR abs/1211.1276 (2012) - 2011
- [c16]Thomas Brihaye, Laurent Doyen, Gilles Geeraerts, Joël Ouaknine, Jean-François Raskin, James Worrell:
On Reachability for Hybrid Automata over Bounded Time. ICALP (2) 2011: 416-427 - [i1]Thomas Brihaye, Laurent Doyen, Gilles Geeraerts, Joël Ouaknine, Jean-François Raskin, James Worrell:
On Reachability for Hybrid Automata over Bounded Time. CoRR abs/1104.5335 (2011)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-13 00:45 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint