default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPatricia Bouyer
Patricia Bouyer-Decitre
Person information
- affiliation: ENS Cachan, Paris, France
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2025
[c114]Patricia Bouyer:
On the Probabilistic and Statistical Verification of Infinite Markov Chains (Invited Talk). CSL 2025: 2:1-2:2- [i39]Patricia Bouyer, B. Srivathsan, Vaishnavi Vishwanath:
Model-checking real-time systems: revisiting the alternating automaton route. CoRR abs/2501.17576 (2025) - 2024
- [j44]Patricia Bouyer, Antonio Casares, Mickael Randour, Pierre Vandenhove:
Half-Positional Objectives Recognized by Deterministic Büchi Automata. Log. Methods Comput. Sci. 20(3) (2024) - [c113]Benjamin Bordais, Patricia Bouyer, Stéphane Le Roux:
From Local to Global Optimality in Concurrent Parity Games. CSL 2024: 18:1-18:21 - [c112]Benoît Barbot, Patricia Bouyer, Serge Haddad:
Beyond Decisiveness of Infinite Markov Chains. FSTTCS 2024: 8:1-8:22 - [i38]Benoît Barbot, Patricia Bouyer, Serge Haddad:
Beyond Decisiveness of Infinite Markov Chains. CoRR abs/2409.18670 (2024) - 2023
- [j43]Patricia Bouyer, Youssouf Oualhadj, Mickael Randour, Pierre Vandenhove
:
Arena-Independent Finite-Memory Determinacy in Stochastic Games. Log. Methods Comput. Sci. 19(4) (2023) - [j42]Patricia Bouyer, Mickael Randour, Pierre Vandenhove:
Characterizing Omega-Regularity through Finite-Memory Determinacy of Games on Infinite Graphs. TheoretiCS 2 (2023) - [j41]Patricia Bouyer, Orna Kupferman, Nicolas Markey, Bastien Maubert, Aniello Murano, Giuseppe Perelli:
Reasoning about Quality and Fuzziness of Strategic Behaviors. ACM Trans. Comput. Log. 24(3): 21:1-21:38 (2023) - [c111]Benjamin Bordais, Patricia Bouyer, Stéphane Le Roux:
Subgame Optimal Strategies in Finite Concurrent Games with Prefix-Independent Objectives. FoSSaCS 2023: 541-560 - [c110]Patricia Bouyer, Nathanaël Fijalkow, Mickael Randour, Pierre Vandenhove:
How to Play Optimally for Regular Objectives? ICALP 2023: 118:1-118:18 - [c109]Patricia Bouyer, Antonio Casares, Mickael Randour, Pierre Vandenhove:
Half-Positional Objectives Recognized by Deterministic Büchi Automata (Extended Abstract). IJCAI 2023: 6420-6425 - [e5]Patricia Bouyer, Srikanth Srinivasan:
43rd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2023, December 18-20, 2023, IIIT Hyderabad, Telangana, India. LIPIcs 284, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2023, ISBN 978-3-95977-304-1 [contents] - [e4]Petra Berenbrink, Patricia Bouyer, Anuj Dawar, Mamadou Moustapha Kanté:
40th International Symposium on Theoretical Aspects of Computer Science, STACS 2023, March 7-9, 2023, Hamburg, Germany. LIPIcs 254, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2023, ISBN 978-3-95977-266-2 [contents] - [i37]Benjamin Bordais, Patricia Bouyer, Stéphane Le Roux:
Sub-game optimal strategies in concurrent games with prefix-independent objectives. CoRR abs/2301.10697 (2023) - [i36]Nathanaël Fijalkow, Nathalie Bertrand, Patricia Bouyer-Decitre, Romain Brenguier, Arnaud Carayol, John Fearnley, Hugo Gimbert, Florian Horn, Rasmus Ibsen-Jensen, Nicolas Markey, Benjamin Monmege, Petr Novotný, Mickael Randour, Ocan Sankur, Sylvain Schmitz, Olivier Serre, Mateusz Skomra:
Games on Graphs. CoRR abs/2305.10546 (2023) - [i35]Benjamin Bordais, Patricia Bouyer, Stéphane Le Roux:
From Local To Global Optimality in Concurrent Parity Games. CoRR abs/2311.14373 (2023) - 2022
- [j40]Béatrice Bérard, Benedikt Bollig, Patricia Bouyer, Matthias Függer, Nathalie Sznajder:
Synthesis in presence of dynamic links. Inf. Comput. 289(Part): 104856 (2022) - [j39]Patricia Bouyer, Thomas Brihaye, Mickael Randour, Cédric Rivière, Pierre Vandenhove:
Decisiveness of stochastic systems and its application to hybrid models. Inf. Comput. 289(Part): 104861 (2022) - [j38]Patricia Bouyer, Stéphane Le Roux, Youssouf Oualhadj, Mickael Randour, Pierre Vandenhove:
Games Where You Can Play Optimally with Arena-Independent Finite Memory. Log. Methods Comput. Sci. 18(1) (2022) - [c108]Patricia Bouyer, Antonio Casares, Mickael Randour, Pierre Vandenhove:
Half-Positional Objectives Recognized by Deterministic Büchi Automata. CONCUR 2022: 20:1-20:18 - [c107]Benjamin Bordais, Patricia Bouyer, Stéphane Le Roux:
Optimal Strategies in Concurrent Reachability Games. CSL 2022: 7:1-7:17 - [c106]Patricia Bouyer, Stéphane Le Roux, Nathan Thomasset:
Finite-Memory Strategies in Two-Player Infinite Games. CSL 2022: 8:1-8:16 - [c105]Patricia Bouyer, Paul Gastin, Frédéric Herbreteau, Ocan Sankur, B. Srivathsan:
Zone-Based Verification of Timed Automata: Extrapolations, Simulations and What Next? FORMATS 2022: 16-42 - [c104]Patricia Bouyer, Mickael Randour, Pierre Vandenhove:
The True Colors of Memory: A Tour of Chromatic-Memory Strategies in Zero-Sum Games on Graphs (Invited Talk). FSTTCS 2022: 3:1-3:18 - [c103]Benjamin Bordais, Patricia Bouyer, Stéphane Le Roux:
Playing (Almost-)Optimally in Concurrent Büchi and Co-Büchi Games. FSTTCS 2022: 33:1-33:18 - [c102]Patricia Bouyer, Mickael Randour, Pierre Vandenhove:
Characterizing Omega-Regularity Through Finite-Memory Determinacy of Games on Infinite Graphs. STACS 2022: 16:1-16:16 - [e3]Patricia Bouyer, Lutz Schröder:
Foundations of Software Science and Computation Structures - 25th International Conference, FOSSACS 2022, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2022, Munich, Germany, April 2-7, 2022, Proceedings. Lecture Notes in Computer Science 13242, Springer 2022, ISBN 978-3-030-99252-1 [contents] - [i34]Benjamin Bordais, Patricia Bouyer, Stéphane Le Roux:
Playing (Almost-)Optimally in Concurrent Büchi and co-Büchi Games. CoRR abs/2203.06966 (2022) - [i33]Patricia Bouyer, Antonio Casares, Mickael Randour, Pierre Vandenhove:
Half-Positional Objectives Recognized by Deterministic Büchi Automata. CoRR abs/2205.01365 (2022) - [i32]Patricia Bouyer, Paul Gastin, Frédéric Herbreteau, Ocan Sankur, B. Srivathsan:
Zone-based verification of timed automata: extrapolations, simulations and what next? CoRR abs/2207.07479 (2022) - [i31]Patricia Bouyer, Nathanaël Fijalkow, Mickael Randour, Pierre Vandenhove:
How to Play Optimally for Regular Objectives? CoRR abs/2210.09703 (2022) - 2021
- [j37]Giovanni Bacci, Patricia Bouyer, Uli Fahrenberg, Kim G. Larsen, Nicolas Markey, Pierre-Alain Reynier:
Optimal and robust controller synthesis using energy timed automata with uncertainty. Formal Aspects Comput. 33(1): 3-25 (2021) - [j36]Nathalie Bertrand, Patricia Bouyer, Anirban Majumdar:
Reconfiguration and Message Losses in Parameterized Broadcast Networks. Log. Methods Comput. Sci. 17(1) (2021) - [j35]Patricia Bouyer, Léo Henry, Samy Jaziri, Thierry Jéron, Nicolas Markey:
Diagnosing timed automata using timed markings. Int. J. Softw. Tools Technol. Transf. 23(2): 229-253 (2021) - [c101]Patricia Bouyer, Youssouf Oualhadj, Mickael Randour, Pierre Vandenhove:
Arena-Independent Finite-Memory Determinacy in Stochastic Games. CONCUR 2021: 26:1-26:18 - [c100]Benjamin Bordais, Patricia Bouyer, Stéphane Le Roux:
From Local to Global Determinacy in Concurrent Graph Games. FSTTCS 2021: 41:1-41:14 - [p2]Patricia Bouyer:
Timed automata. Handbook of Automata Theory (II.) 2021: 1261-1294 - [i30]Patricia Bouyer, Youssouf Oualhadj, Mickael Randour, Pierre Vandenhove:
Arena-Independent Finite-Memory Determinacy in Stochastic Games. CoRR abs/2102.10104 (2021) - [i29]Benjamin Bordais, Patricia Bouyer, Stéphane Le Roux:
From local to global determinacy in concurrent graph games. CoRR abs/2107.04081 (2021) - [i28]Patricia Bouyer, Stéphane Le Roux, Nathan Thomasset:
Finite-memory strategies in two-player infinite games. CoRR abs/2107.09945 (2021) - [i27]Patricia Bouyer, Mickael Randour, Pierre Vandenhove:
Characterizing Omega-Regularity through Finite-Memory Determinacy of Games on Infinite Graphs. CoRR abs/2110.01276 (2021) - [i26]Benjamin Bordais, Patricia Bouyer, Stéphane Le Roux:
Optimal strategies in concurrent reachability games. CoRR abs/2110.14724 (2021) - 2020
- [j34]Aniello Murano, Patricia Bouyer, Pierluigi San Pietro, Andrea Orlandini:
Preface. Inf. Comput. 272: 104497 (2020) - [j33]Patrick Gardy, Patricia Bouyer, Nicolas Markey:
Dependences in Strategy Logic. Theory Comput. Syst. 64(3): 467-507 (2020) - [c99]Luca Aceto, Jos C. M. Baeten, Patricia Bouyer-Decitre, Holger Hermanns, Alexandra Silva:
CONCUR Test-Of-Time Award 2020 Announcement (Invited Paper). CONCUR 2020: 5:1-5:3 - [c98]Patricia Bouyer, Stéphane Le Roux, Youssouf Oualhadj, Mickael Randour, Pierre Vandenhove:
Games Where You Can Play Optimally with Arena-Independent Finite Memory. CONCUR 2020: 24:1-24:22 - [c97]Patricia Bouyer, Orna Kupferman, Nicolas Markey, Bastien Maubert, Aniello Murano, Giuseppe Perelli:
Reasoning About Quality and Fuzziness of Strategic Behaviours. ECAI 2020: 2887-2888 - [c96]Nathalie Bertrand, Patricia Bouyer, Anirban Majumdar:
Synthesizing Safe Coalition Strategies. FSTTCS 2020: 39:1-39:17 - [c95]Béatrice Bérard, Benedikt Bollig, Patricia Bouyer, Matthias Függer, Nathalie Sznajder:
Synthesis in Presence of Dynamic Links. GandALF 2020: 33-49 - [c94]Patricia Bouyer, Thomas Brihaye, Mickael Randour, Cédric Rivière, Pierre Vandenhove:
Decisiveness of Stochastic Systems and its Application to Hybrid Models. GandALF 2020: 149-165 - [i25]Patricia Bouyer, Stéphane Le Roux, Youssouf Oualhadj, Mickael Randour, Pierre Vandenhove:
Games Where You Can Play Optimally with Finite Memory. CoRR abs/2001.03894 (2020) - [i24]Nathalie Bertrand, Patricia Bouyer, Anirban Majumdar:
Synthesizing safe coalition strategies. CoRR abs/2008.03770 (2020) - [i23]Nathalie Bertrand, Patricia Bouyer, Thomas Brihaye, Paulin Fournier:
Taming denumerable Markov decision processes with decisiveness. CoRR abs/2008.10426 (2020) - [i22]Patricia Bouyer, Thomas Brihaye, Mickael Randour, Cédric Rivière, Pierre Vandenhove:
Decisiveness of Stochastic Systems and its Application to Hybrid Models (Full Version). CoRR abs/2009.13152 (2020)
2010 – 2019
- 2019
- [c93]Patricia Bouyer:
A Note on Game Theory and Verification. ATVA 2019: 3-22 - [c92]Nathalie Bertrand, Patricia Bouyer, Anirban Majumdar:
Reconfiguration and Message Losses in Parameterized Broadcast Networks. CONCUR 2019: 32:1-32:15 - [c91]Benedikt Bollig, Patricia Bouyer, Fabian Reiter:
Identifiers in Registers - Describing Network Algorithms with Logic. FoSSaCS 2019: 115-132 - [c90]Nathalie Bertrand, Patricia Bouyer, Anirban Majumdar:
Concurrent Parameterized Games. FSTTCS 2019: 31:1-31:15 - [c89]Patricia Bouyer, Orna Kupferman, Nicolas Markey, Bastien Maubert, Aniello Murano, Giuseppe Perelli:
Reasoning about Quality and Fuzziness of Strategic Behaviours. IJCAI 2019: 1588-1594 - [c88]Patricia Bouyer, Nathan Thomasset:
Nash Equilibria in Games over Graphs Equipped with a Communication Mechanism. MFCS 2019: 9:1-9:14 - [c87]Patricia Bouyer:
On the Computation of Nash Equilibria in Games on Graphs (Invited Talk). TIME 2019: 3:1-3:3 - [i21]Patricia Bouyer, Orna Kupferman, Nicolas Markey, Bastien Maubert, Aniello Murano, Giuseppe Perelli:
Reasoning about Quality and Fuzziness of Strategic Behaviours. CoRR abs/1905.11537 (2019) - [i20]Patricia Bouyer, Nathan Thomasset:
Nash equilibria in games over graphs equipped with a communication mechanism. CoRR abs/1906.07753 (2019) - [i19]Nathalie Bertrand, Patricia Bouyer, Anirban Majumdar:
Reconfiguration and Message Losses in Parameterized Broadcast Networks. CoRR abs/1912.07042 (2019) - 2018
- [j32]Patricia Bouyer, Nicolas Markey, Mickael Randour, Kim G. Larsen, Simon Laursen:
Average-energy games. Acta Informatica 55(2): 91-127 (2018) - [j31]Nathalie Bertrand, Patricia Bouyer, Thomas Brihaye, Pierre Carlier:
When are stochastic transition systems tameable? J. Log. Algebraic Methods Program. 99: 41-96 (2018) - [c86]Béatrice Bérard, Patricia Bouyer, Vincent Jugé:
Finite Bisimulations for Dynamical Systems with Overlapping Trajectories. CSL 2018: 26:1-26:17 - [c85]Giovanni Bacci, Patricia Bouyer, Uli Fahrenberg, Kim Guldstrand Larsen, Nicolas Markey, Pierre-Alain Reynier:
Optimal and Robust Controller Synthesis - Using Energy Timed Automata with Uncertainty. FM 2018: 203-221 - [c84]Patricia Bouyer:
Games on Graphs with a Public Signal Monitoring. FoSSaCS 2018: 530-547 - [c83]Patricia Bouyer, Samy Jaziri, Nicolas Markey:
Efficient Timed Diagnosis Using Automata with Timed Domains. RV 2018: 205-221 - [c82]Patrick Gardy, Patricia Bouyer, Nicolas Markey:
Dependences in Strategy Logic. STACS 2018: 34:1-34:15 - [c81]Patricia Bouyer, Mauricio González, Nicolas Markey, Mickael Randour:
Multi-weighted Markov Decision Processes with Reachability Objectives. GandALF 2018: 250-264 - [p1]Patricia Bouyer, Uli Fahrenberg, Kim Guldstrand Larsen, Nicolas Markey, Joël Ouaknine, James Worrell:
Model Checking Real-Time Systems. Handbook of Model Checking 2018: 1001-1046 - [i18]Giovanni Bacci, Patricia Bouyer, Uli Fahrenberg, Kim G. Larsen, Nicolas Markey, Pierre-Alain Reynier:
Optimal and Robust Controller Synthesis: using Energy Timed Automata with Uncertainty. CoRR abs/1805.00847 (2018) - [i17]Benedikt Bollig, Patricia Bouyer, Fabian Reiter:
Identifiers in Registers - Describing Network Algorithms with Logic. CoRR abs/1811.08197 (2018) - 2017
- [j30]Patricia Bouyer, Nicolas Markey, Steen Vester:
Nash equilibria in symmetric graph games with partial observation. Inf. Comput. 254: 238-258 (2017) - [j29]Patricia Bouyer, Nicolas Markey, Nicolas Perrin, Philipp Schlehuber-Caissier:
Timed-automata abstraction of switched dynamical systems using control invariants. Real Time Syst. 53(3): 327-353 (2017) - [c80]Patricia Bouyer, François Laroussinie, Nicolas Markey, Joël Ouaknine, James Worrell:
Timed Temporal Logics. Models, Algorithms, Logics and Tools 2017: 211-230 - [c79]Patricia Bouyer, Serge Haddad, Vincent Jugé:
Unbounded Product-Form Petri Nets. CONCUR 2017: 31:1-31:16 - [c78]Patricia Bouyer, Samy Jaziri, Nicolas Markey:
On the Determinization of Timed Systems. FORMATS 2017: 25-41 - [c77]Patricia Bouyer, Piotr Hofman, Nicolas Markey, Mickael Randour, Martin Zimmermann:
Bounding Average-Energy Games. FoSSaCS 2017: 179-195 - [c76]Patricia Bouyer, Vincent Jugé:
Dynamic Complexity of the Dyck Reachability. FoSSaCS 2017: 265-280 - [e2]Patricia Bouyer, Andrea Orlandini, Pierluigi San Pietro:
Proceedings Eighth International Symposium on Games, Automata, Logics and Formal Verification, GandALF 2017, Roma, Italy, 20-22 September 2017. EPTCS 256, 2017 [contents] - [i16]Patricia Bouyer-Decitre, Vincent Jugé, Nicolas Markey:
Courcelle's Theorem Made Dynamic. CoRR abs/1702.05183 (2017) - [i15]Nathalie Bertrand, Patricia Bouyer, Thomas Brihaye, Pierre Carlier:
When are Stochastic Transition Systems Tameable? CoRR abs/1703.04806 (2017) - [i14]Patricia Bouyer, Serge Haddad, Vincent Jugé:
Unbounded product-form Petri nets. CoRR abs/1708.05847 (2017) - [i13]Patrick Gardy, Patricia Bouyer, Nicolas Markey:
Dependences in Strategy Logic. CoRR abs/1708.05849 (2017) - [i12]Patricia Bouyer:
Games on graphs with a public signal monitoring. CoRR abs/1710.07163 (2017) - 2016
- [j28]Patricia Bouyer, Patrick Gardy, Nicolas Markey:
On the semantics of Strategy Logic. Inf. Process. Lett. 116(2): 75-79 (2016) - [c75]Patricia Bouyer, Maximilien Colange, Nicolas Markey:
Symbolic Optimal Reachability in Weighted Timed Automata. CAV (1) 2016: 513-530 - [c74]Patricia Bouyer, Thomas Brihaye, Pierre Carlier, Quentin Menet:
Compositional Design of Stochastic Timed Automata. CSR 2016: 117-130 - [c73]Nathalie Bertrand, Patricia Bouyer, Thomas Brihaye, Pierre Carlier:
Analysing Decisive Stochastic Processes. ICALP 2016: 101:1-101:14 - [c72]Patricia Bouyer, Nicolas Markey, Mickael Randour, Arnaud Sangnier, Daniel Stan:
Reachability in Networks of Register Protocols under Stochastic Schedulers. ICALP 2016: 106:1-106:14 - [c71]Patricia Bouyer-Decitre:
Optimal Reachability in Weighted Timed Automata and Games. MFCS 2016: 3:1-3:3 - [c70]S. Akshay, Patricia Bouyer, Shankara Narayanan Krishna, Lakshmi Manasa, Ashutosh Trivedi:
Stochastic Timed Games Revisited. MFCS 2016: 8:1-8:14 - [c69]Patricia Bouyer, Nicolas Markey, Daniel Stan:
Stochastic Equilibria under Imprecise Deviations in Terminal-Reward Concurrent Games. GandALF 2016: 61-75 - [i11]Patricia Bouyer, Maximilien Colange, Nicolas Markey:
Symbolic Optimal Reachability in Weighted Timed Automata. CoRR abs/1602.00481 (2016) - [i10]Patricia Bouyer, Nicolas Markey, Mickael Randour, Arnaud Sangnier, Daniel Stan:
Reachability in Networks of Register Protocols under Stochastic Schedulers. CoRR abs/1602.05928 (2016) - [i9]S. Akshay, Patricia Bouyer, Shankara Narayanan Krishna, Lakshmi Manasa, Ashutosh Trivedi:
Stochastic Timed Games Revisited. CoRR abs/1607.05671 (2016) - [i8]Patricia Bouyer, Vincent Jugé, Nicolas Markey:
Dynamic Complexity of Parity Games with Bounded Tree-Width. CoRR abs/1610.00571 (2016) - [i7]Patricia Bouyer, Vincent Jugé:
Dynamic Complexity of the Dyck Reachability. CoRR abs/1610.07499 (2016) - [i6]Patricia Bouyer, Piotr Hofman, Nicolas Markey, Mickael Randour, Martin Zimmermann:
Bounding Average-energy Games. CoRR abs/1610.07858 (2016) - 2015
- [j27]Patricia Bouyer, Romain Brenguier, Nicolas Markey, Michael Ummels:
Pure Nash Equilibria in Concurrent Deterministic Games. Log. Methods Comput. Sci. 11(2) (2015) - [j26]Patricia Bouyer, Erwin Fang, Nicolas Markey:
Permissive strategies in timed automata and games. Electron. Commun. Eur. Assoc. Softw. Sci. Technol. 72 (2015) - [j25]Patricia Bouyer, Nicolas Markey, Ocan Sankur:
Robust reachability in timed automata and games: A game-based approach. Theor. Comput. Sci. 563: 43-74 (2015) - [c68]Patricia Bouyer, Samy Jaziri, Nicolas Markey:
On the Value Problem in Weighted Timed Games. CONCUR 2015: 311-324 - [c67]Patricia Bouyer, Nicolas Markey, Nicolas Perrin, Philipp Schlehuber-Caissier:
Timed-Automata Abstraction of Switched Dynamical Systems Using Control Funnels. FORMATS 2015: 60-75 - [c66]Patricia Bouyer, Patrick Gardy, Nicolas Markey:
Weighted Strategy Logic with Boolean Goals Over One-Counter Games. FSTTCS 2015: 69-83 - [c65]Patricia Bouyer:
On the optimal reachability problem in weighted timed automata and games. NCMA 2015: 11-36 - [c64]Patricia Bouyer, Nicolas Markey, Mickael Randour, Kim Guldstrand Larsen, Simon Laursen:
Average-energy games. GandALF 2015: 1-15 - [i5]Patricia Bouyer, Nicolas Markey, Mickael Randour, Kim G. Larsen, Simon Laursen:
Average-energy games (full version). CoRR abs/1512.08106 (2015) - 2014
- [j24]Nathalie Bertrand, Patricia Bouyer, Thomas Brihaye, Quentin Menet, Christel Baier, Marcus Größer, Marcin Jurdzinski:
Stochastic Timed Automata. Log. Methods Comput. Sci. 10(4) (2014) - [j23]Ocan Sankur, Patricia Bouyer, Nicolas Markey:
Shrinking timed automata. Inf. Comput. 234: 107-132 (2014) - [j22]Patricia Bouyer, Kim G. Larsen, Nicolas Markey:
Lower-bound-constrained runs in weighted timed automata. Perform. Evaluation 73: 91-109 (2014) - [c63]Patricia Bouyer, Patrick Gardy, Nicolas Markey:
Quantitative Verification of Weighted Kripke Structures. ATVA 2014: 64-80 - [c62]Patricia Bouyer, Nicolas Markey, Raj Mohan Matteplackel:
Averaging in LTL. CONCUR 2014: 266-280 - [c61]Patricia Bouyer, Nicolas Markey, Daniel Stan:
Mixed Nash Equilibria in Concurrent Terminal-Reward Games. FSTTCS 2014: 351-363 - [c60]Patricia Bouyer, Nicolas Markey, Steen Vester:
Nash Equilibria in Symmetric Games with Partial Observation. SR 2014: 49-55 - 2013
- [c59]Ocan Sankur, Patricia Bouyer, Nicolas Markey, Pierre-Alain Reynier:
Robust Controller Synthesis in Timed Automata. CONCUR 2013: 546-560 - [c58]Patricia Bouyer, Nicolas Markey, Ocan Sankur:
Robust Weighted Timed Automata and Games. FORMATS 2013: 31-46 - [c57]Patricia Bouyer, Nicolas Markey, Ocan Sankur:
Robustness in Timed Automata. RP 2013: 1-18 - [i4]Nathalie Bertrand, Patricia Bouyer, Thomas Brihaye, Amélie Stainer:
Emptiness and Universality Problems in Timed Automata with Positive Frequency. CoRR abs/1309.2842 (2013) - 2012
- [j21]Patricia Bouyer, Nicolas Markey, Joël Ouaknine, Philippe Schnoebelen, James Worrell:
On termination and invariance for faulty channel machines. Formal Aspects Comput. 24(4-6): 595-607 (2012) - [c56]Patricia Bouyer, Romain Brenguier, Nicolas Markey, Michael Ummels:
Concurrent Games with Ordered Objectives. FoSSaCS 2012: 301-315 - [c55]Patricia Bouyer, Nicolas Markey, Ocan Sankur:
Robust Reachability in Timed Automata: A Game-Based Approach. ICALP (2) 2012: 128-140 - [c54]Patricia Bouyer, Kim Guldstrand Larsen, Nicolas Markey:
Lower-Bound Constrained Runs in Weighted Timed Automata. QEST 2012: 128-137 - [c53]Patricia Bouyer, Thomas Brihaye, Marcin Jurdzinski, Quentin Menet:
Almost-Sure Model-Checking of Reactive Timed Automata. QEST 2012: 138-147 - 2011
- [j20]Patricia Bouyer, Uli Fahrenberg, Kim G. Larsen, Nicolas Markey:
Quantitative analysis of real-time systems using priced timed automata. Commun. ACM 54(9): 78-87 (2011) - [j19]Patricia Bouyer, Franck Cassez, François Laroussinie:
Timed Modal Logics for Real-Time Systems - Specification, Verification and Control. J. Log. Lang. Inf. 20(2): 169-203 (2011) - [c52]Patricia Bouyer, Nicolas Markey, Jörg Olschewski, Michael Ummels:
Measuring Permissiveness in Parity Games: Mean-Payoff Parity Games Revisited. ATVA 2011: 135-149 - [c51]Patricia Bouyer, Kim G. Larsen, Nicolas Markey, Ocan Sankur, Claus R. Thrane:
Timed Automata Can Always Be Made Implementable. CONCUR 2011: 76-91 - [c50]Patricia Bouyer, Nicolas Markey, Ocan Sankur:
Robust Model-Checking of Timed Automata via Pumping in Channel Machines. FORMATS 2011: 97-112 - [c49]Ocan Sankur, Patricia Bouyer, Nicolas Markey:
Shrinking Timed Automata. FSTTCS 2011: 90-102 - [c48]Patricia Bouyer, Romain Brenguier, Nicolas Markey, Michael Ummels:
Nash Equilibria in Concurrent Games with Büchi Objectives. FSTTCS 2011: 375-386 - [c47]Nathalie Bertrand, Patricia Bouyer, Thomas Brihaye, Amélie Stainer:
Emptiness and Universality Problems in Timed Automata with Positive Frequency. ICALP (2) 2011: 246-257 - [i3]Patricia Bouyer, Nicolas Markey, Jörg Olschewski, Michael Ummels:
Measuring Permissiveness in Parity Games: Mean-Payoff Parity Games Revisited. CoRR abs/1102.3615 (2011) - 2010
- [j18]Patricia Bouyer, Thomas Brihaye, Fabrice Chevalier:
O-Minimal Hybrid Reachability Games. Log. Methods Comput. Sci. 6(1) (2010) - [j17]Patricia Bouyer, Fabrice Chevalier, Nicolas Markey:
On the expressiveness of TPTL and MTL. Inf. Comput. 208(2): 97-116 (2010) - [c46]Patricia Bouyer, Romain Brenguier, Nicolas Markey:
Nash Equilibria for Reachability Objectives in Multi-player Timed Games. CONCUR 2010: 192-206 - [c45]Patricia Bouyer, Romain Brenguier, Nicolas Markey:
Computing Equilibria in Two-Player Timed Games via Turn-Based Finite Games. FORMATS 2010: 62-76 - [c44]Paul Hunter, Patricia Bouyer, Nicolas Markey, Joël Ouaknine, James Worrell:
Computing Rational Radical Sums in Uniform TC^0. FSTTCS 2010: 308-316 - [c43]Patricia Bouyer, Uli Fahrenberg, Kim G. Larsen, Nicolas Markey:
Timed automata with observers under energy constraints. HSCC 2010: 61-70
2000 – 2009
- 2009
- [j16]Patricia Bouyer, Thomas Brihaye, Fabrice Chevalier:
Weighted o-minimal hybrid systems. Ann. Pure Appl. Log. 161(3): 268-288 (2009) - [j15]Patricia Bouyer, Serge Haddad, Pierre-Alain Reynier:
Undecidability Results for Timed Automata with Silent Transitions. Fundam. Informaticae 92(1-2): 1-25 (2009) - [c42]Patricia Bouyer, Marie Duflot, Nicolas Markey, Gabriel Renault:
Measuring Permissivity in Finite Games. CONCUR 2009: 196-210 - [c41]Christel Baier, Nathalie Bertrand, Patricia Bouyer, Thomas Brihaye:
When Are Timed Automata Determinizable? ICALP (2) 2009: 43-54 - [c40]Patricia Bouyer, Vojtech Forejt:
Reachability in Stochastic Timed Games. ICALP (2) 2009: 103-114 - 2008
- [j14]Patricia Bouyer, Ed Brinksma, Kim Guldstrand Larsen:
Optimal infinite scheduling for multi-priced timed automata. Formal Methods Syst. Des. 32(1): 3-23 (2008) - [j13]Patricia Bouyer, Serge Haddad, Pierre-Alain Reynier:
Timed Petri nets and timed automata: On the discriminating power of zeno sequences. Inf. Comput. 206(1): 73-107 (2008) - [j12]Patricia Bouyer, Kim Guldstrand Larsen, Nicolas Markey:
Model Checking One-Clock Priced Timed Automata. Log. Methods Comput. Sci. 4(2) (2008) - [c39]Patricia Bouyer, Ulrich Fahrenberg, Kim Guldstrand Larsen, Nicolas Markey, Jirí Srba:
Infinite Runs in Weighted Timed Automata with Energy Constraints. FORMATS 2008: 33-47 - [c38]Patricia Bouyer, Thomas Brihaye, Marcin Jurdzinski, Ranko Lazic, Michal Rutkowski:
Average-Price and Reachability-Price Games on Hybrid Automata with Strong Resets. FORMATS 2008: 63-77 - [c37]Patricia Bouyer, Nicolas Markey, Pierre-Alain Reynier:
Robust Analysis of Timed Automata via Channel Machines. FoSSaCS 2008: 157-171 - [c36]Patricia Bouyer, Nicolas Markey, Joël Ouaknine, James Worrell:
On Expressiveness and Complexity in Real-Time Model Checking. ICALP (2) 2008: 124-135 - [c35]Christel Baier, Nathalie Bertrand, Patricia Bouyer, Thomas Brihaye, Marcus Größer:
Almost-Sure Model Checking of Infinite Paths in One-Clock Timed Automata. LICS 2008: 217-226 - [c34]Nathalie Bertrand, Patricia Bouyer, Thomas Brihaye, Nicolas Markey:
Quantitative Model-Checking of One-Clock Timed Automata under Probabilistic Semantics. QEST 2008: 55-64 - [c33]Patricia Bouyer, Nicolas Markey, Joël Ouaknine, Philippe Schnoebelen, James Worrell:
On Termination for Faulty Channel Machines. STACS 2008: 121-132 - [i2]Patricia Bouyer, Nicolas Markey, Joël Ouaknine, Philippe Schnoebelen, James Worrell:
On Termination for Faulty Channel Machines. CoRR abs/0802.2839 (2008) - [i1]Patricia Bouyer, Kim Guldstrand Larsen, Nicolas Markey:
Model Checking One-clock Priced Timed Automata. CoRR abs/0805.1457 (2008) - 2007
- [j11]Patricia Bouyer, Thomas Brihaye, Véronique Bruyère, Jean-François Raskin:
On the optimal reachability problem of weighted timed automata. Formal Methods Syst. Des. 31(2): 135-175 (2007) - [c32]Patricia Bouyer, Nicolas Markey:
Costs Are Expensive! FORMATS 2007: 53-68 - [c31]Patricia Bouyer, Kim Guldstrand Larsen, Nicolas Markey:
Model-Checking One-Clock Priced Timed Automata. FoSSaCS 2007: 108-122 - [c30]Christel Baier, Nathalie Bertrand, Patricia Bouyer, Thomas Brihaye, Marcus Größer:
Probabilistic and Topological Semantics for Timed Automata. FSTTCS 2007: 179-191 - [c29]Patricia Bouyer, Thomas Brihaye, Fabrice Chevalier:
Weighted O-Minimal Hybrid Systems Are More Decidable Than Weighted Timed Automata! LFCS 2007: 69-83 - [c28]Patricia Bouyer, Nicolas Markey, Joël Ouaknine, James Worrell:
The Cost of Punctuality. LICS 2007: 109-120 - [c27]Patricia Bouyer:
Model-checking Timed Temporal Logics. M4M 2007: 323-341 - 2006
- [j10]Patricia Bouyer, Fabrice Chevalier:
On the Control of Timed and Hybrid Systems. Bull. EATCS 89: 79-96 (2006) - [j9]Patricia Bouyer, Thomas Brihaye, Nicolas Markey:
Improved undecidability results on weighted timed automata. Inf. Process. Lett. 98(5): 188-194 (2006) - [j8]Gerd Behrmann, Patricia Bouyer, Kim Guldstrand Larsen, Radek Pelánek:
Lower and upper bounds in zone-based abstractions of timed automata. Int. J. Softw. Tools Technol. Transf. 8(3): 204-215 (2006) - [c26]Patricia Bouyer, Pierre-Alain Reynier, Serge Haddad:
Extended Timed Automata and Time Petri Nets. ACSD 2006: 91-100 - [c25]Patricia Bouyer, Serge Haddad, Pierre-Alain Reynier:
Timed Unfoldings for Networks of Timed Automata. ATVA 2006: 292-306 - [c24]Houda Bel Mokadem, Béatrice Bérard, Patricia Bouyer, François Laroussinie:
Timed Temporal Logics for Abstracting Transient States. ATVA 2006: 337-351 - [c23]Patricia Bouyer, Laura Bozzelli, Fabrice Chevalier:
Controller Synthesis for MTL Specifications. CONCUR 2006: 450-464 - [c22]Patricia Bouyer, Kim Guldstrand Larsen, Nicolas Markey, Jacob Illum Rasmussen:
Almost Optimal Strategies in One Clock Priced Timed Games. FSTTCS 2006: 345-356 - [c21]Patricia Bouyer, Serge Haddad, Pierre-Alain Reynier:
Timed Petri Nets and Timed Automata: On the Discriminating Power of Zeno Sequences. ICALP (2) 2006: 420-431 - [c20]Patricia Bouyer, Nicolas Markey, Pierre-Alain Reynier:
Robust Model-Checking of Linear-Time Properties in Timed Automata. LATIN 2006: 238-249 - [c19]Patricia Bouyer, Thomas Brihaye, Fabrice Chevalier:
Control in o-minimal Hybrid Systems. LICS 2006: 367-378 - [c18]Patricia Bouyer:
Weighted Timed Automata: Model-Checking and Games. MFPS 2006: 3-17 - [e1]Eugene Asarin, Patricia Bouyer:
Formal Modeling and Analysis of Timed Systems, 4th International Conference, FORMATS 2006, Paris, France, September 25-27, 2006, Proceedings. Lecture Notes in Computer Science 4202, Springer 2006, ISBN 3-540-45026-2 [contents] - 2005
- [j7]Patricia Bouyer, Fabrice Chevalier:
On Conciseness of Extensions of Timed Automata. J. Autom. Lang. Comb. 10(4): 393-405 (2005) - [c17]Patricia Bouyer, Franck Cassez, François Laroussinie:
Modal Logics for Timed Control. CONCUR 2005: 81-94 - [c16]Houda Bel Mokadem, Béatrice Bérard, Patricia Bouyer, François Laroussinie:
A New Modality for Almost Everywhere Properties in Timed Automata. CONCUR 2005: 110-124 - [c15]Patricia Bouyer, François Laroussinie, Pierre-Alain Reynier:
Diagonal Constraints in Timed Automata: Forward Analysis of Timed Systems. FORMATS 2005: 112-126 - [c14]Patricia Bouyer, Fabrice Chevalier, Deepak D'Souza:
Fault Diagnosis Using Timed Automata. FoSSaCS 2005: 219-233 - [c13]Patricia Bouyer, Fabrice Chevalier, Nicolas Markey:
On the Expressiveness of TPTL and MTL. FSTTCS 2005: 432-443 - 2004
- [j6]Patricia Bouyer:
Forward Analysis of Updatable Timed Automata. Formal Methods Syst. Des. 24(3): 281-320 (2004) - [j5]Patricia Bouyer, Catherine Dufourd, Emmanuel Fleury, Antoine Petit:
Updatable timed automata. Theor. Comput. Sci. 321(2-3): 291-345 (2004) - [c12]Patricia Bouyer, Franck Cassez, Emmanuel Fleury, Kim Guldstrand Larsen:
Optimal Strategies in Priced Timed Game Automata. FSTTCS 2004: 148-160 - [c11]Patricia Bouyer, Ed Brinksma, Kim Guldstrand Larsen:
Staying Alive as Cheaply as Possible. HSCC 2004: 203-218 - [c10]Gerd Behrmann, Patricia Bouyer, Kim Guldstrand Larsen, Radek Pelánek:
Lower and Upper Bounds in Zone Based Abstractions of Timed Automata. TACAS 2004: 312-326 - [c9]Patricia Bouyer, Franck Cassez, Emmanuel Fleury, Kim Guldstrand Larsen:
Synthesis of Optimal Strategies Using HyTech. GDV@CAV 2004: 11-31 - 2003
- [j4]Patricia Bouyer, Antoine Petit, Denis Thérien:
An algebraic approach to data languages and timed languages. Inf. Comput. 182(2): 137-162 (2003) - [j3]Luca Aceto, Patricia Bouyer, Augusto Burgueño, Kim Guldstrand Larsen:
The power of reachability testing for timed automata. Theor. Comput. Sci. 300(1-3): 411-475 (2003) - [c8]Patricia Bouyer, Deepak D'Souza, P. Madhusudan, Antoine Petit:
Timed Control with Partial Observability. CAV 2003: 180-192 - [c7]Patricia Bouyer:
Untameable Timed Automata! STACS 2003: 620-631 - [c6]Gerd Behrmann, Patricia Bouyer, Emmanuel Fleury, Kim Guldstrand Larsen:
Static Guard Analysis in Timed Automata Verification. TACAS 2003: 254-277 - 2002
- [j2]Patricia Bouyer:
A logical characterization of data languages. Inf. Process. Lett. 84(2): 75-85 (2002) - [j1]Patricia Bouyer, Antoine Petit:
A Kleene/Büchi-like Theorem for Clock Languages. J. Autom. Lang. Comb. 7(2): 167-186 (2002) - 2001
- [c5]Patricia Bouyer, Antoine Petit, Denis Thérien:
An Algebraic Characterization of Data and Timed Languages. CONCUR 2001: 248-261 - 2000
- [c4]Patricia Bouyer, Catherine Dufourd, Emmanuel Fleury, Antoine Petit:
Are Timed Automata Updatable? CAV 2000: 464-479 - [c3]Patricia Bouyer, Catherine Dufourd, Emmanuel Fleury, Antoine Petit:
Expressiveness of Updatable Timed Automata. MFCS 2000: 232-242
1990 – 1999
- 1999
- [c2]Patricia Bouyer, Antoine Petit:
Decomposition and Composition of Timed Automata. ICALP 1999: 210-219 - 1998
- [c1]Luca Aceto, Patricia Bouyer, Augusto Burgueño, Kim Guldstrand Larsen:
The Power of Reachability Testing for Timed Automata. FSTTCS 1998: 245-256
Coauthor Index
Kim G. Larsen
aka: Kim Guldstrand Larsen
aka: Kim Guldstrand Larsen
[j41] [i36] [j37] [j35] [j33] [c97] [c89] [i21] [j32] [c85] [c83] [c82] [c81] [p1] [i18] [j30] [j29] [c80] [c78] [c77] [i16] [i13] [j28] [c75] [c72] [c69] [i11] [i10] [i8] [i6] [j27] [j26] [j25] [c68] [c67] [c66] [c64] [i5] [j23] [j22] [c63] [c62] [c61] [c60] [c59] [c58] [c57] [j21] [c56] [c55] [c54] [j20] [c52] [c51] [c50] [c49] [c48] [i3] [j17] [c46] [c45] [c44] [c43] [c42] [j12] [c39] [c37] [c36] [c34] [c33] [i2] [i1] [c32] [c31] [c28] [j9] [c22] [c20] [c13]
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 2025-02-27 23:49 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
