( en | de | ru )

 

Disambiguation of "Bouyer, Patricia"

Author of the publication

copydeleteadd this publication to your clipboard
Averaging in LTL.

, , and . CONCUR, volume 8704 of Lecture Notes in Computer Science, page 266-280. Springer, (2014)

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.

Daniel Bouyer

Guillaume Bouyer

Patricia Lang

Risikoanalyse der Lungenmetastasenresektion unter aktuellen Aspekten der Thoraxchirurgie. Uni Ulm, (2009)

Patricia Tönnessen

Unterschiedliche Regulation von insulinsensitiven Adipokinen bei Schwangerschaften mit normaler und abnormaler plazentarer Funktion. Uni Leipzig, (2009)

Patricia Diffené

 

Other publications of authors with the same name

Expressiveness of Updatable Timed Automata., , , and . MFCS, volume 1893 of Lecture Notes in Computer Science, page 232-242. Springer, (2000)Almost Optimal Strategies in One Clock Priced Timed Games., , , and . FSTTCS, volume 4337 of Lecture Notes in Computer Science, page 345-356. Springer, (2006)Optimal Strategies in Priced Timed Game Automata., , , and . FSTTCS, volume 3328 of Lecture Notes in Computer Science, page 148-160. Springer, (2004)Sub-game optimal strategies in concurrent games with prefix-independent objectives., , and . CoRR, (2023)On the Value Problem in Weighted Timed Games., , and . CONCUR, volume 42 of LIPIcs, page 311-324. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2015)A Note on Game Theory and Verification.. ATVA, volume 11781 of Lecture Notes in Computer Science, page 3-22. Springer, (2019)Timed Petri nets and timed automata: On the discriminating power of zeno sequences., , and . Inf. Comput., 206 (1): 73-107 (2008)Decisiveness of stochastic systems and its application to hybrid models., , , , and . Inf. Comput., 289 (Part): 104861 (2022)Games Where You Can Play Optimally with Arena-Independent Finite Memory., , , , and . CONCUR, volume 171 of LIPIcs, page 24:1-24:22. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)On the optimal reachability problem in weighted timed automata and games.. NCMA, volume 318 of books@ocg.at, page 11-36. Österreichische Computer Gesellschaft, (2015)