Patricia Bouyer

Centre National de la Recherche Scientifique — France

Computer Science · Physical Sciences

36h-index4.0kcitations210works0.32yr avg
OpenAlex↗ORCID↗Google Scholar↗Lab page↗

Accepting Students?

No reports yet. Know if this professor is taking students?

Research Topics

Formal Methods in Verification(164), Logic, programming, and type systems(78), Petri Nets in System Modeling(59), Model-Driven Software Engineering Techniques(39), semigroups and automata theory(28)

Publications210 total

Report on the 36th International Conference on Concurrency Theory (CONCUR 2025)
ACM SIGLOG News·2025Open Access
Decisiveness for Countable MDPs and Insights for NPLCSs and POMDPs
Lecture notes in computer science·2025
Model-checking real-time systems: revisiting the alternating automaton route
arXiv (Cornell University)·2025Open Access
Model-Checking Real-Time Systems: Revisiting the Alternating Automaton Route
Lecture notes in computer science·2025Open Access
36th International Conference on Concurrency Theory (CONCUR 2025)
SPIRE - Sciences Po Institutional REpository·2025· 1 citedOpen Access
Half-Positional Objectives Recognized by Deterministic B\"uchi Automata
Logical Methods in Computer Science·2024· 1 citedOpen Access
Beyond Decisiveness of Infinite Markov Chains
SPIRE - Sciences Po Institutional REpository·2024Open Access
Arena-Independent Finite-Memory Determinacy in Stochastic Games
Logical Methods in Computer Science·2023· 6 citedOpen Access
From Local To Global Optimality in Concurrent Parity Games
arXiv (Cornell University)·2023Open Access
Half-Positional Objectives Recognized by Deterministic Büchi Automata (Extended Abstract)
2023Open Access
Games on Graphs: From Logic and Automata to Algorithms
arXiv (Cornell University)·2023· 8 citedOpen Access
Reasoning about Quality and Fuzziness of Strategic Behaviors
ACM Transactions on Computational Logic·2023· 7 citedOpen Access
Sub-game optimal strategies in concurrent games with prefix-independent objectives
arXiv (Cornell University)·2023· 1 citedOpen Access
Characterizing Omega-Regularity through Finite-Memory Determinacy of Games on Infinite Graphs
TheoretiCS·2023· 10 citedOpen Access
LIPIcs, Volume 254, STACS 2023, Complete Volume
SPIRE - Sciences Po Institutional REpository·2023Open Access
Subgame Optimal Strategies in Finite Concurrent Games with Prefix-Independent Objectives
Lecture notes in computer science·2023· 1 citedOpen Access
How to Play Optimally for Regular Objectives?
arXiv (Cornell University)·2022· 2 citedOpen Access
Zone-based verification of timed automata: extrapolations, simulations and what next?
arXiv (Cornell University)·2022· 4 citedOpen Access
Playing (Almost-)Optimally in Concurrent Büchi and co-Büchi Games
arXiv (Cornell University)·2022· 1 citedOpen Access
Games Where You Can Play Optimally with Arena-Independent Finite Memory
Logical Methods in Computer Science·2022· 18 citedOpen Access
page 1 of 11Next →

Frequent Co-authors

Nicolas Markey(17), Kim G. Larsen(15), Antoine Petit(8), Thomas Brihaye(7), Emmanuel Fleury(6), Fabrice Chevalier(5), Nathalie Bertrand(5), Uli Fahrenberg(4), Christel Baier(4), Gerd Behrmann(3), Catherine Dufourd(3), Joël Ouaknine(3), James Worrell(3), Michael Ummels(3), Pierre-Alain Reynier(3), Radek Pelánek(2), Luca Aceto(2), Augusto Burgueño(2), Franck Cassez(2), Denis Thérien(2)