Decomposition and Composition of Timed Automata. - Patricia Bouyer; Antoine Petit 001 (ICALP, 1999)

Are Timed Automata Updatable? - Patricia Bouyer; Catherine Dufourd; Emmanuel Fleury; Antoine Petit 001 (CAV, 2000)

Expressiveness of Updatable Timed Automata. - Patricia Bouyer; Catherine Dufourd; Emmanuel Fleury; Antoine Petit 001 (MFCS, 2000)

An Algebraic Characterization of Data and Timed Languages. - Patricia Bouyer; Antoine Petit 001; Denis Thérien (CONCUR, 2001)

A logical characterization of data languages. - Patricia Bouyer (Inf. Process. Lett., 2002)

A Kleene/Büchi-like Theorem for Clock Languages. - Patricia Bouyer; Antoine Petit 001 (J. Autom. Lang. Comb., 2002)

Timed Control with Partial Observability. - Patricia Bouyer; Deepak D'Souza; P. Madhusudan; Antoine Petit 001 (CAV, 2003)

Untameable Timed Automata! - Patricia Bouyer (STACS, 2003)

Static Guard Analysis in Timed Automata Verification. - Gerd Behrmann; Patricia Bouyer; Emmanuel Fleury; Kim Guldstrand Larsen (TACAS, 2003)

An algebraic approach to data languages and timed languages. - Patricia Bouyer; Antoine Petit 001; Denis Thérien (Inf. Comput., 2003)

The power of reachability testing for timed automata. - Luca Aceto; Patricia Bouyer; Augusto Burgueño; Kim Guldstrand Larsen (Theor. Comput. Sci., 2003)

Optimal Strategies in Priced Timed Game Automata. - Patricia Bouyer; Franck Cassez; Emmanuel Fleury; Kim Guldstrand Larsen (FSTTCS, 2004)

Staying Alive as Cheaply as Possible. - Patricia Bouyer; Ed Brinksma; Kim Guldstrand Larsen (HSCC, 2004)

Synthesis of Optimal Strategies Using HyTech. - Patricia Bouyer; Franck Cassez; Emmanuel Fleury; Kim Guldstrand Larsen (GDV@CAV, 2004)

Forward Analysis of Updatable Timed Automata. - Patricia Bouyer (Formal Methods Syst. Des., 2004)

Updatable timed automata. - Patricia Bouyer; Catherine Dufourd; Emmanuel Fleury; Antoine Petit 001 (Theor. Comput. Sci., 2004)

Modal Logics for Timed Control. - Patricia Bouyer; Franck Cassez; François Laroussinie (CONCUR, 2005)

A New Modality for Almost Everywhere Properties in Timed Automata. - Houda Bel Mokadem; Béatrice Bérard; Patricia Bouyer; François Laroussinie (CONCUR, 2005)

Diagonal Constraints in Timed Automata: Forward Analysis of Timed Systems. - Patricia Bouyer; François Laroussinie; Pierre-Alain Reynier (FORMATS, 2005)

Fault Diagnosis Using Timed Automata. - Patricia Bouyer; Fabrice Chevalier; Deepak D'Souza (FoSSaCS, 2005)

On Conciseness of Extensions of Timed Automata. - Patricia Bouyer; Fabrice Chevalier (J. Autom. Lang. Comb., 2005)

Extended Timed Automata and Time Petri Nets. - Patricia Bouyer; Pierre-Alain Reynier; Serge Haddad (ACSD, 2006)

Timed Unfoldings for Networks of Timed Automata. - Patricia Bouyer; Serge Haddad; Pierre-Alain Reynier (ATVA, 2006)

Timed Temporal Logics for Abstracting Transient States. - Houda Bel Mokadem; Béatrice Bérard; Patricia Bouyer; François Laroussinie (ATVA, 2006)

Controller Synthesis for MTL Specifications. - Patricia Bouyer; Laura Bozzelli; Fabrice Chevalier (CONCUR, 2006)

Almost Optimal Strategies in One Clock Priced Timed Games. - Patricia Bouyer; Kim Guldstrand Larsen; Nicolas Markey; Jacob Illum Rasmussen (FSTTCS, 2006)

Robust Model-Checking of Linear-Time Properties in Timed Automata. - Patricia Bouyer; Nicolas Markey; Pierre-Alain Reynier (LATIN, 2006)

Control in o-minimal Hybrid Systems. - Patricia Bouyer; Thomas Brihaye; Fabrice Chevalier (LICS, 2006)

On the Control of Timed and Hybrid Systems. - Patricia Bouyer; Fabrice Chevalier (Bull. EATCS, 2006)

Weighted Timed Automata: Model-Checking and Games. - Patricia Bouyer (MFPS, 2006)

Improved undecidability results on weighted timed automata. - Patricia Bouyer; Thomas Brihaye; Nicolas Markey (Inf. Process. Lett., 2006)

Lower and upper bounds in zone-based abstractions of timed automata. - Gerd Behrmann; Patricia Bouyer; Kim Guldstrand Larsen; Radek Pelánek (Int. J. Softw. Tools Technol. Transf., 2006)

Costs Are Expensive! - Patricia Bouyer; Nicolas Markey (FORMATS, 2007)

Probabilistic and Topological Semantics for Timed Automata. - Christel Baier; Nathalie Bertrand 001; Patricia Bouyer; Thomas Brihaye; Marcus Größer (FSTTCS, 2007)

Weighted O-Minimal Hybrid Systems Are More Decidable Than Weighted Timed Automata! - Patricia Bouyer; Thomas Brihaye; Fabrice Chevalier (LFCS, 2007)

The Cost of Punctuality. - Patricia Bouyer; Nicolas Markey; Joël Ouaknine; James Worrell 001 (LICS, 2007)

Model-checking Timed Temporal Logics. - Patricia Bouyer (M4M, 2007)

On the optimal reachability problem of weighted timed automata. - Patricia Bouyer; Thomas Brihaye; Véronique Bruyère; Jean-François Raskin (Formal Methods Syst. Des., 2007)

Average-Price and Reachability-Price Games on Hybrid Automata with Strong Resets. - Patricia Bouyer; Thomas Brihaye; Marcin Jurdzinski; Ranko Lazic 001; Michal Rutkowski (FORMATS, 2008)

Infinite Runs in Weighted Timed Automata with Energy Constraints. - Patricia Bouyer; Ulrich Fahrenberg; Kim Guldstrand Larsen; Nicolas Markey; Jirí Srba (FORMATS, 2008)

Robust Analysis of Timed Automata via Channel Machines. - Patricia Bouyer; Nicolas Markey; Pierre-Alain Reynier (FoSSaCS, 2008)

On Expressiveness and Complexity in Real-Time Model Checking. - Patricia Bouyer; Nicolas Markey; Joël Ouaknine; James Worrell 001 (ICALP (2), 2008)

Almost-Sure Model Checking of Infinite Paths in One-Clock Timed Automata. - Christel Baier; Nathalie Bertrand 001; Patricia Bouyer; Thomas Brihaye; Marcus Größer (LICS, 2008)

Quantitative Model-Checking of One-Clock Timed Automata under Probabilistic Semantics. - Nathalie Bertrand 001; Patricia Bouyer; Thomas Brihaye; Nicolas Markey (QEST, 2008)

On Termination for Faulty Channel Machines. - Patricia Bouyer; Nicolas Markey; Joël Ouaknine; Philippe Schnoebelen; James Worrell 001 (STACS, 2008)

Optimal infinite scheduling for multi-priced timed automata. - Patricia Bouyer; Ed Brinksma; Kim Guldstrand Larsen (Formal Methods Syst. Des., 2008)

Timed Petri nets and timed automata: On the discriminating power of zeno sequences. - Patricia Bouyer; Serge Haddad; Pierre-Alain Reynier (Inf. Comput., 2008)

Model Checking One-Clock Priced Timed Automata. - Patricia Bouyer; Kim Guldstrand Larsen; Nicolas Markey (Log. Methods Comput. Sci., 2008)

Measuring Permissivity in Finite Games. - Patricia Bouyer; Marie Duflot; Nicolas Markey; Gabriel Renault (CONCUR, 2009)

When Are Timed Automata Determinizable? - Christel Baier; Nathalie Bertrand 001; Patricia Bouyer; Thomas Brihaye (ICALP (2), 2009)

Reachability in Stochastic Timed Games. - Patricia Bouyer; Vojtech Forejt (ICALP (2), 2009)

Weighted o-minimal hybrid systems. - Patricia Bouyer; Thomas Brihaye; Fabrice Chevalier (Ann. Pure Appl. Log., 2009)

Undecidability Results for Timed Automata with Silent Transitions. - Patricia Bouyer; Serge Haddad; Pierre-Alain Reynier (Fundam. Informaticae, 2009)

Nash Equilibria for Reachability Objectives in Multi-player Timed Games. - Patricia Bouyer; Romain Brenguier; Nicolas Markey (CONCUR, 2010)

Computing Equilibria in Two-Player Timed Games via Turn-Based Finite Games. - Patricia Bouyer; Romain Brenguier; Nicolas Markey (FORMATS, 2010)

Computing Rational Radical Sums in Uniform TC^0. - Paul Hunter 001; Patricia Bouyer; Nicolas Markey; Joël Ouaknine; James Worrell 001 (FSTTCS, 2010)

Timed automata with observers under energy constraints. - Patricia Bouyer; Uli Fahrenberg; Kim G. Larsen; Nicolas Markey (HSCC, 2010)

O-Minimal Hybrid Reachability Games - Patricia Bouyer; Thomas Brihaye; Fabrice Chevalier (Log. Methods Comput. Sci., 2010)

On the expressiveness of TPTL and MTL. - Patricia Bouyer; Fabrice Chevalier; Nicolas Markey (Inf. Comput., 2010)

Measuring Permissiveness in Parity Games: Mean-Payoff Parity Games Revisited. - Patricia Bouyer; Nicolas Markey; Jörg Olschewski; Michael Ummels (ATVA, 2011)

Timed Automata Can Always Be Made Implementable. - Patricia Bouyer; Kim G. Larsen; Nicolas Markey; Ocan Sankur; Claus R. Thrane (CONCUR, 2011)

Robust Model-Checking of Timed Automata via Pumping in Channel Machines. - Patricia Bouyer; Nicolas Markey; Ocan Sankur (FORMATS, 2011)

Nash Equilibria in Concurrent Games with Büchi Objectives. - Patricia Bouyer; Romain Brenguier; Nicolas Markey; Michael Ummels (FSTTCS, 2011)

Emptiness and Universality Problems in Timed Automata with Positive Frequency. - Nathalie Bertrand 001; Patricia Bouyer; Thomas Brihaye; Amélie Stainer (ICALP (2), 2011)

Quantitative analysis of real-time systems using priced timed automata. - Patricia Bouyer; Uli Fahrenberg; Kim G. Larsen; Nicolas Markey (Commun. ACM, 2011)

Timed Modal Logics for Real-Time Systems - Specification, Verification and Control. - Patricia Bouyer; Franck Cassez; François Laroussinie (J. Log. Lang. Inf., 2011)

Concurrent Games with Ordered Objectives. - Patricia Bouyer; Romain Brenguier; Nicolas Markey; Michael Ummels (FoSSaCS, 2012)

Robust Reachability in Timed Automata: A Game-Based Approach. - Patricia Bouyer; Nicolas Markey; Ocan Sankur (ICALP (2), 2012)

Almost-Sure Model-Checking of Reactive Timed Automata. - Patricia Bouyer; Thomas Brihaye; Marcin Jurdzinski; Quentin Menet (QEST, 2012)

On termination and invariance for faulty channel machines. - Patricia Bouyer; Nicolas Markey; Joël Ouaknine; Philippe Schnoebelen; James Worrell 001 (Formal Aspects Comput., 2012)

Robust Controller Synthesis in Timed Automata. - Ocan Sankur; Patricia Bouyer; Nicolas Markey; Pierre-Alain Reynier (CONCUR, 2013)

Robust Weighted Timed Automata and Games. - Patricia Bouyer; Nicolas Markey; Ocan Sankur (FORMATS, 2013)

Robustness in Timed Automata. - Patricia Bouyer; Nicolas Markey; Ocan Sankur (RP, 2013)

Quantitative Verification of Weighted Kripke Structures. - Patricia Bouyer; Patrick Gardy; Nicolas Markey (ATVA, 2014)

Averaging in LTL. - Patricia Bouyer; Nicolas Markey; Raj Mohan Matteplackel (CONCUR, 2014)

Mixed Nash Equilibria in Concurrent Terminal-Reward Games. - Patricia Bouyer; Nicolas Markey; Daniel Stan (FSTTCS, 2014)

Stochastic Timed Automata. - Nathalie Bertrand 001; Patricia Bouyer; Thomas Brihaye; Quentin Menet; Christel Baier; Marcus Größer; Marcin Jurdzinski (Log. Methods Comput. Sci., 2014)

Nash Equilibria in Symmetric Games with Partial Observation. - Patricia Bouyer; Nicolas Markey; Steen Vester (SR, 2014)

Shrinking timed automata. - Ocan Sankur; Patricia Bouyer; Nicolas Markey (Inf. Comput., 2014)

Lower-bound-constrained runs in weighted timed automata. - Patricia Bouyer; Kim G. Larsen; Nicolas Markey (Perform. Evaluation, 2014)

On the Value Problem in Weighted Timed Games. - Patricia Bouyer; Samy Jaziri; Nicolas Markey (CONCUR, 2015)

Timed-Automata Abstraction of Switched Dynamical Systems Using Control Funnels. - Patricia Bouyer; Nicolas Markey; Nicolas Perrin 001; Philipp Schlehuber-Caissier (FORMATS, 2015)

Weighted Strategy Logic with Boolean Goals Over One-Counter Games. - Patricia Bouyer; Patrick Gardy; Nicolas Markey (FSTTCS, 2015)

On the optimal reachability problem in weighted timed automata and games. - Patricia Bouyer (NCMA, 2015)

Pure Nash Equilibria in Concurrent Deterministic Games. - Patricia Bouyer; Romain Brenguier; Nicolas Markey; Michael Ummels (Log. Methods Comput. Sci., 2015)

Average-energy games. - Patricia Bouyer; Nicolas Markey; Mickael Randour; Kim Guldstrand Larsen; Simon Laursen (GandALF, 2015)

Average-energy games (full version). - Patricia Bouyer; Nicolas Markey; Mickael Randour; Kim G. Larsen; Simon Laursen (CoRR, 2015)

Permissive strategies in timed automata and games. - Patricia Bouyer; Erwin Fang; Nicolas Markey (Electron. Commun. Eur. Assoc. Softw. Sci. Technol., 2015)

Robust reachability in timed automata and games: A game-based approach. - Patricia Bouyer; Nicolas Markey; Ocan Sankur (Theor. Comput. Sci., 2015)

Symbolic Optimal Reachability in Weighted Timed Automata. - Patricia Bouyer; Maximilien Colange; Nicolas Markey (CAV (1), 2016)

Compositional Design of Stochastic Timed Automata. - Patricia Bouyer; Thomas Brihaye; Pierre Carlier; Quentin Menet (CSR, 2016)

Analysing Decisive Stochastic Processes. - Nathalie Bertrand 001; Patricia Bouyer; Thomas Brihaye; Pierre Carlier (ICALP, 2016)

Reachability in Networks of Register Protocols under Stochastic Schedulers. - Patricia Bouyer; Nicolas Markey; Mickael Randour; Arnaud Sangnier; Daniel Stan (ICALP, 2016)

Stochastic Timed Games Revisited. - S. Akshay 001; Patricia Bouyer; Shankara Narayanan Krishna; Lakshmi Manasa; Ashutosh Trivedi 001 (MFCS, 2016)

Optimal Reachability in Weighted Timed Automata and Games. - Patricia Bouyer-Decitre (MFCS, 2016)

Dynamic Complexity of Parity Games with Bounded Tree-Width. - Patricia Bouyer; Vincent Jugé; Nicolas Markey (CoRR, 2016)

Stochastic Equilibria under Imprecise Deviations in Terminal-Reward Concurrent Games. - Patricia Bouyer; Nicolas Markey; Daniel Stan (GandALF, 2016)

On the semantics of Strategy Logic. - Patricia Bouyer; Patrick Gardy; Nicolas Markey (Inf. Process. Lett., 2016)

Timed Temporal Logics. - Patricia Bouyer; François Laroussinie; Nicolas Markey; Joël Ouaknine; James Worrell 001 (Models, Algorithms, Logics and Tools, 2017)

Unbounded Product-Form Petri Nets. - Patricia Bouyer; Serge Haddad; Vincent Jugé (CONCUR, 2017)

On the Determinization of Timed Systems. - Patricia Bouyer; Samy Jaziri; Nicolas Markey (FORMATS, 2017)

Bounding Average-Energy Games. - Patricia Bouyer; Piotr Hofman; Nicolas Markey; Mickael Randour; Martin Zimmermann 002 (FoSSaCS, 2017)

Dynamic Complexity of the Dyck Reachability. - Patricia Bouyer; Vincent Jugé (FoSSaCS, 2017)

Courcelle's Theorem Made Dynamic. - Patricia Bouyer-Decitre; Vincent Jugé; Nicolas Markey (CoRR, 2017)

Nash equilibria in symmetric graph games with partial observation. - Patricia Bouyer; Nicolas Markey; Steen Vester (Inf. Comput., 2017)

Timed-automata abstraction of switched dynamical systems using control invariants. - Patricia Bouyer; Nicolas Markey; Nicolas Perrin 001; Philipp Schlehuber-Caissier (Real Time Syst., 2017)

Finite Bisimulations for Dynamical Systems with Overlapping Trajectories. - Béatrice Bérard; Patricia Bouyer; Vincent Jugé (CSL, 2018)

Games on Graphs with a Public Signal Monitoring. - Patricia Bouyer (FoSSaCS, 2018)

Efficient Timed Diagnosis Using Automata with Timed Domains. - Patricia Bouyer; Samy Jaziri; Nicolas Markey (RV, 2018)

Multi-weighted Markov Decision Processes with Reachability Objectives. - Patricia Bouyer; Mauricio González; Nicolas Markey; Mickael Randour (GandALF, 2018)

When are stochastic transition systems tameable? - Nathalie Bertrand 001; Patricia Bouyer; Thomas Brihaye; Pierre Carlier (J. Log. Algebraic Methods Program., 2018)

Model Checking Real-Time Systems. - Patricia Bouyer; Uli Fahrenberg; Kim Guldstrand Larsen; Nicolas Markey; Joël Ouaknine; James Worrell 001 (Handbook of Model Checking, 2018)

A Note on Game Theory and Verification. - Patricia Bouyer (ATVA, 2019)

Identifiers in Registers - Describing Network Algorithms with Logic. - Benedikt Bollig; Patricia Bouyer; Fabian Reiter (FoSSaCS, 2019)

Concurrent Parameterized Games. - Nathalie Bertrand 001; Patricia Bouyer; Anirban Majumdar 002 (FSTTCS, 2019)

Nash Equilibria in Games over Graphs Equipped with a Communication Mechanism. - Patricia Bouyer; Nathan Thomasset (MFCS, 2019)

On the Computation of Nash Equilibria in Games on Graphs (Invited Talk). - Patricia Bouyer (TIME, 2019)

CONCUR Test-Of-Time Award 2020 Announcement (Invited Paper). - Luca Aceto; Jos C. M. Baeten; Patricia Bouyer-Decitre; Holger Hermanns; Alexandra Silva 001 (CONCUR, 2020)

Reasoning About Quality and Fuzziness of Strategic Behaviours. - Patricia Bouyer; Orna Kupferman; Nicolas Markey; Bastien Maubert; Aniello Murano; Giuseppe Perelli (ECAI, 2020)

Synthesizing Safe Coalition Strategies. - Nathalie Bertrand 001; Patricia Bouyer; Anirban Majumdar 002 (FSTTCS, 2020)

Games Where You Can Play Optimally with Finite Memory. - Patricia Bouyer; Stéphane Le Roux 001; Youssouf Oualhadj; Mickael Randour; Pierre Vandenhove (CoRR, 2020)

Decisiveness of Stochastic Systems and its Application to Hybrid Models. - Patricia Bouyer; Thomas Brihaye; Mickael Randour; Cédric Rivière; Pierre Vandenhove (GandALF, 2020)

Synthesis in Presence of Dynamic Links. - Béatrice Bérard; Benedikt Bollig; Patricia Bouyer; Matthias Függer; Nathalie Sznajder (GandALF, 2020)

Taming denumerable Markov decision processes with decisiveness. - Nathalie Bertrand 001; Patricia Bouyer; Thomas Brihaye; Paulin Fournier (CoRR, 2020)

Decisiveness of Stochastic Systems and its Application to Hybrid Models (Full Version). - Patricia Bouyer; Thomas Brihaye; Mickael Randour; Cédric Rivière; Pierre Vandenhove (CoRR, 2020)

Preface. - Aniello Murano; Patricia Bouyer; Pierluigi San Pietro; Andrea Orlandini (Inf. Comput., 2020)

Dependences in Strategy Logic. - Patrick Gardy; Patricia Bouyer; Nicolas Markey (Theory Comput. Syst., 2020)

Timed automata. - Patricia Bouyer (Handbook of Automata Theory (II.), 2021)

From Local to Global Determinacy in Concurrent Graph Games. - Benjamin Bordais; Patricia Bouyer; Stéphane Le Roux 001 (FSTTCS, 2021)

Optimal and robust controller synthesis using energy timed automata with uncertainty. - Giovanni Bacci 001; Patricia Bouyer; Uli Fahrenberg; Kim G. Larsen; Nicolas Markey; Pierre-Alain Reynier (Formal Aspects Comput., 2021)

Reconfiguration and Message Losses in Parameterized Broadcast Networks. - Nathalie Bertrand 001; Patricia Bouyer; Anirban Majumdar 002 (Log. Methods Comput. Sci., 2021)

Diagnosing timed automata using timed markings. - Patricia Bouyer; Léo Henry; Samy Jaziri; Thierry Jéron; Nicolas Markey (Int. J. Softw. Tools Technol. Transf., 2021)

Optimal Strategies in Concurrent Reachability Games. - Benjamin Bordais; Patricia Bouyer; Stéphane Le Roux 001 (CSL, 2022)

Finite-Memory Strategies in Two-Player Infinite Games. - Patricia Bouyer; Stéphane Le Roux 001; Nathan Thomasset (CSL, 2022)

Zone-Based Verification of Timed Automata: Extrapolations, Simulations and What Next? - Patricia Bouyer; Paul Gastin; Frédéric Herbreteau; Ocan Sankur; B. Srivathsan (FORMATS, 2022)

Playing (Almost-)Optimally in Concurrent Büchi and Co-Büchi Games. - Benjamin Bordais; Patricia Bouyer; Stéphane Le Roux 001 (FSTTCS, 2022)

The True Colors of Memory: A Tour of Chromatic-Memory Strategies in Zero-Sum Games on Graphs (Invited Talk). - Patricia Bouyer; Mickael Randour; Pierre Vandenhove (FSTTCS, 2022)

Games Where You Can Play Optimally with Arena-Independent Finite Memory. - Patricia Bouyer; Stéphane Le Roux 001; Youssouf Oualhadj; Mickael Randour; Pierre Vandenhove (Log. Methods Comput. Sci., 2022)

Subgame Optimal Strategies in Finite Concurrent Games with Prefix-Independent Objectives. - Benjamin Bordais; Patricia Bouyer; Stéphane Le Roux 001 (FoSSaCS, 2023)

How to Play Optimally for Regular Objectives? - Patricia Bouyer; Nathanaël Fijalkow; Mickael Randour; Pierre Vandenhove (ICALP, 2023)

Half-Positional Objectives Recognized by Deterministic Büchi Automata (Extended Abstract). - Patricia Bouyer; Antonio Casares; Mickael Randour; Pierre Vandenhove (IJCAI, 2023)

Sub-game optimal strategies in concurrent games with prefix-independent objectives. - Benjamin Bordais; Patricia Bouyer; Stéphane Le Roux 001 (CoRR, 2023)

Games on Graphs. - Nathanaël Fijalkow; Nathalie Bertrand 001; Patricia Bouyer-Decitre; Romain Brenguier; Arnaud Carayol; John Fearnley; Hugo Gimbert; Florian Horn 001; Rasmus Ibsen-Jensen; Nicolas Markey; Benjamin Monmege; Petr Novotný 001; et al. (CoRR, 2023)

Arena-Independent Finite-Memory Determinacy in Stochastic Games. - Patricia Bouyer; Youssouf Oualhadj; Mickael Randour; Pierre Vandenhove (Log. Methods Comput. Sci., 2023)

Characterizing Omega-Regularity through Finite-Memory Determinacy of Games on Infinite Graphs. - Patricia Bouyer; Mickael Randour; Pierre Vandenhove (TheoretiCS, 2023)

Reasoning about Quality and Fuzziness of Strategic Behaviors. - Patricia Bouyer; Orna Kupferman; Nicolas Markey; Bastien Maubert; Aniello Murano; Giuseppe Perelli (ACM Trans. Comput. Log., 2023)

From Local to Global Optimality in Concurrent Parity Games. - Benjamin Bordais; Patricia Bouyer; Stéphane Le Roux 001 (CSL, 2024)

Beyond Decisiveness of Infinite Markov Chains. - Benoît Barbot; Patricia Bouyer; Serge Haddad (FSTTCS, 2024)

Half-Positional Objectives Recognized by Deterministic Büchi Automata. - Patricia Bouyer; Antonio Casares; Mickael Randour; Pierre Vandenhove (Log. Methods Comput. Sci., 2024)

On the Probabilistic and Statistical Verification of Infinite Markov Chains (Invited Talk). - Patricia Bouyer (CSL, 2025)

Model-Checking Real-Time Systems: Revisiting the Alternating Automaton Route. - Patricia Bouyer; B. Srivathsan; Vaishnavi Vishwanath (FoSSaCS, 2025)

Antichains for Concurrent Parameterized Games. - Nathalie Bertrand 001; Patricia Bouyer; Gaëtan Staquet (CoRR, 2025)