( en | de | ru )

 

Disambiguation of "Brihaye, Thomas"

Author of the publication

copydeleteadd this publication to your clipboard
Semantics of Attack-Defense Trees for Dynamic Countermeasures and a New Hierarchy of Star-free Languages.

, , and . CoRR, (2023)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Thomas Thomas

Thomas Harasim

Die Rolle des nucleostemin-Gens in dem Prozess der Ribosomenbiogenese. Uni München, (2009)

Thomas Baron

Untersuchungen an ungeschädigten und durch Pilzbefall geschädigten Nadelholzbauteilen mit ausgewählten Prüfverfahren. TU Dresden, (2009)

Thomas Böttcher

Naturstoffe und ihre Derivate als molekulare Sonden: Identifikation ihrer Angriffsziele und Inhibition der Virulenz in pathogenen Bakterien. Uni München, (2009)

Thomas Potinecke

Methode zur Systematisierung von Teilprozessen in der Produktentwicklung beim Einsatz von CAx-Technologien. Uni Stuttgart, (2009)
 

Other publications of authors with the same name

The Complexity of Subgame Perfect Equilibria in Quantitative Reachability Games., , , , and . CONCUR, volume 140 of LIPIcs, page 13:1-13:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Decisiveness of Stochastic Systems and its Application to Hybrid Models (Full Version)., , , , and . CoRR, (2020)A note on the undecidability of the reachability problem for o-minimal dynamical systems.. Math. Log. Q., 52 (2): 165-170 (2006)Dynamics and Coalitions in Sequential Games., , , and . GandALF, volume 256 of EPTCS, page 136-150. (2017)On MITL and Alternating Timed Automata., , and . FORMATS, volume 8053 of Lecture Notes in Computer Science, page 47-61. Springer, (2013)On Subgame Perfection in Quantitative Reachability Games, , , and . Logical Methods in Computer Science, (2012)The Complexity of Subgame Perfect Equilibria in Quantitative Reachability Games., , , , and . Log. Methods Comput. Sci., (2020)Dynamics on Games: Simulation-Based Techniques and Applications to Routing., , , , and . FSTTCS, volume 150 of LIPIcs, page 35:1-35:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)On the optimal reachability problem of weighted timed automata., , , and . Formal Methods Syst. Des., 31 (2): 135-175 (2007)Fairly Correct Systems: Beyond omega-regularity, and . GandALF, volume 119 of EPTCS, page 21-34. (2013)