Expected Window Mean-Payoff. - Benjamin Bordais; Shibashis Guha; Jean-François Raskin (FSTTCS, 2019)

Performance Evaluation of Metro Regulations Using Probabilistic Model-Checking. - Nathalie Bertrand 001; Benjamin Bordais; Loïc Hélouët; Thomas Mari; Julie Parreaux; Ocan Sankur (RSSRail, 2019)

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

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

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

Strategy Synthesis for Global Window PCTL. - Benjamin Bordais; Damien Busatto-Gaston; Shibashis Guha; Jean-François Raskin (ICALP, 2022)

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

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

Learning Temporal Properties is NP-hard. - Benjamin Bordais; Daniel Neider; Rajarshi Roy 002 (CoRR, 2023)

Concurrent two-player antagonistic games on graphs. (Jeux concurrents à deux joueurs antagonistes sur les graphes). - Benjamin Bordais (2023)

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

Learning Branching-Time Properties in CTL and ATL via Constraint Solving. - Benjamin Bordais; Daniel Neider; Rajarshi Roy 002 (FM (1), 2024)

The Complexity of Learning Temporal Properties. - Benjamin Bordais; Daniel Neider; Rajarshi Roy 002 (CoRR, 2024)

A Framework for Computing Upper Bounds in Passive Learning Settings. - Benjamin Bordais; Daniel Neider (JELIA (2), 2025)

The Complexity of Learning LTL, CTL and ATL Formulas. - Benjamin Bordais; Daniel Neider; Rajarshi Roy 002 (STACS, 2025)