Parikh-Equivalent Bounded Underapproximations - Pierre Ganty; Rupak Majumdar; Benjamin Monmege (CoRR, 2008)

Pebble Weighted Automata and Transitive Closure Logics. - Benedikt Bollig; Paul Gastin; Benjamin Monmege; Marc Zeitoun (ICALP (2), 2010)

A Probabilistic Kleene Theorem. - Benedikt Bollig; Paul Gastin; Benjamin Monmege; Marc Zeitoun (ATVA, 2012)

Adding Pebbles to Weighted Automata. - Paul Gastin; Benjamin Monmege (CIAA, 2012)

Bounded underapproximations. - Pierre Ganty; Rupak Majumdar; Benjamin Monmege (Formal Methods Syst. Des., 2012)

A Fresh Approach to Learning Register Automata. - Benedikt Bollig; Peter Habermehl; Martin Leucker; Benjamin Monmege (Developments in Language Theory, 2013)

Weighted Specifications over Nested Words. - Benedikt Bollig; Paul Gastin; Benjamin Monmege (FoSSaCS, 2013)

Specification and verification of quantitative properties : expressions, logics, and automata. (Spécification et vérification de propriétés quantitatives : expressions, logiques et automates). - Benjamin Monmege (2013)

Adding Negative Prices to Priced Timed Games. - Thomas Brihaye; Gilles Geeraerts; Shankara Narayanan Krishna; Lakshmi Manasa; Benjamin Monmege; Ashutosh Trivedi 001 (CONCUR, 2014)

Logical characterization of weighted pebble walking automata. - Benedikt Bollig; Paul Gastin; Benjamin Monmege; Marc Zeitoun (CSL-LICS, 2014)

Reachability in MDPs: Refining Convergence of Value Iteration. - Serge Haddad; Benjamin Monmege (RP, 2014)

A Robust Class of Data Languages and an Application to Learning. - Benedikt Bollig; Peter Habermehl; Martin Leucker; Benjamin Monmege (Log. Methods Comput. Sci., 2014)

Adding pebbles to weighted automata: Easy specification & efficient evaluation. - Paul Gastin; Benjamin Monmege (Theor. Comput. Sci., 2014)

Pebble Weighted Automata and Weighted Logics. - Benedikt Bollig; Paul Gastin; Benjamin Monmege; Marc Zeitoun (ACM Trans. Comput. Log., 2014)

To Reach or not to Reach? Efficient Algorithms for Total-Payoff Games. - Thomas Brihaye; Gilles Geeraerts; Axel Haddad; Benjamin Monmege (CONCUR, 2015)

Simple Priced Timed Games are not That Simple. - Thomas Brihaye; Gilles Geeraerts; Axel Haddad; Engel Lefaucheux; Benjamin Monmege (FSTTCS, 2015)

Quantitative Games under Failures. - Thomas Brihaye; Gilles Geeraerts; Axel Haddad; Benjamin Monmege; Guillermo A. Pérez 001; Gabriel Renault (FSTTCS, 2015)

Real-Time Synthesis is Hard! - Thomas Brihaye; Morgane Estiévenart; Gilles Geeraerts; Hsi-Ming Ho; Benjamin Monmege; Nathalie Sznajder (FORMATS, 2016)

Efficient Energy Distribution in a Smart Grid using Multi-Player Games. - Thomas Brihaye; Amit Kumar Dhar; Gilles Geeraerts; Axel Haddad; Benjamin Monmege (Cassting/SynCoP, 2016)

MightyL: A Compositional Translation from MITL to Timed Automata. - Thomas Brihaye; Gilles Geeraerts; Hsi-Ming Ho; Benjamin Monmege (CAV (1), 2017)

Optimal Reachability in Divergent Weighted Timed Games. - Damien Busatto-Gaston; Benjamin Monmege; Pierre-Alain Reynier (FoSSaCS, 2017)

Timed-Automata-Based Verification of MITL over Signals. - Thomas Brihaye; Gilles Geeraerts; Hsi-Ming Ho; Benjamin Monmege (TIME, 2017)

Pseudopolynomial iterative algorithm to solve total-payoff games and min-cost reachability games. - Thomas Brihaye; Gilles Geeraerts; Axel Haddad; Benjamin Monmege (Acta Informatica, 2017)

Symbolic Approximation of Weighted Timed Games. - Damien Busatto-Gaston; Benjamin Monmege; Pierre-Alain Reynier (FSTTCS, 2018)

Efficient Algorithms and Tools for MITL Model-Checking and Synthesis. - Thomas Brihaye; Gilles Geeraerts; Hsi-Ming Ho; Arthur Milchior; Benjamin Monmege (ICECCS, 2018)

A unifying survey on weighted logics and weighted automata - Core weighted logic: minimal and versatile specification of quantitative properties. - Paul Gastin; Benjamin Monmege (Soft Comput., 2018)

Interval iteration algorithm for MDPs and IMDPs. - Serge Haddad; Benjamin Monmege (Theor. Comput. Sci., 2018)

Robust Controller Synthesis in Timed Büchi Automata: A Symbolic Approach. - Damien Busatto-Gaston; Benjamin Monmege; Pierre-Alain Reynier; Ocan Sankur (CAV (1), 2019)

Dynamics on Games: Simulation-Based Techniques and Applications to Routing. - Thomas Brihaye; Gilles Geeraerts; Marion Hallet; Benjamin Monmege; Bruno Quoitin (FSTTCS, 2019)

Determinisation of Finitely-Ambiguous Copyless Cost Register Automata. - Théodore Lopez; Benjamin Monmege; Jean-Marc Talbot (MFCS, 2019)

Reaching Your Goal Optimally by Playing at Random with No Memory. - Benjamin Monmege; Julie Parreaux; Pierre-Alain Reynier (CONCUR, 2020)

Reaching Your Goal Optimally by Playing at Random. - Benjamin Monmege; Julie Parreaux; Pierre-Alain Reynier (CoRR, 2020)

One-Clock Priced Timed Games with Arbitrary Weights. - Thomas Brihaye; Gilles Geeraerts; Axel Haddad; Engel Lefaucheux; Benjamin Monmege (CoRR, 2020)

Game Theory for Real-Time Synthesis: Decision, Approximation, and Randomness. (Théorie des jeux pour la synthèse temps-réel: décision, approximation et aléatoire). - Benjamin Monmege (2022)

Weighted Automata and Expressions over Pre-Rational Monoids. - Nicolas Baudru; Louis-Marie Dando; Nathan Lhote; Benjamin Monmege; Pierre-Alain Reynier; Jean-Marc Talbot (CSL, 2022)

One-Clock Priced Timed Games with Negative Weights. - Thomas Brihaye; Gilles Geeraerts; Axel Haddad; Engel Lefaucheux; Benjamin Monmege (Log. Methods Comput. Sci., 2022)

An Automata Theoretic Characterization of Weighted First-Order Logic. - Dhruv Nevatia; Benjamin Monmege (ATVA (1), 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)

Optimal controller synthesis for timed systems. - Damien Busatto-Gaston; Benjamin Monmege; Pierre-Alain Reynier (Log. Methods Comput. Sci., 2023)

Synthesis of Robust Optimal Real-Time Systems. - Benjamin Monmege; Julie Parreaux; Pierre-Alain Reynier (MFCS, 2024)

A Bargaining-Game Framework for Multi-Party Access Control. - Gelareh Hasel Mehri; Benjamin Monmege; Clara Bertolissi; Nicola Zannone (SACMAT, 2024)

Synthesis of Robust Optimal Strategies in Weighted Timed Games. - Benjamin Monmege; Julie Parreaux; Pierre-Alain Reynier (CoRR, 2024)

Preface of STACS 2021 Special Issue. - Markus Bläser; Benjamin Monmege (Theory Comput. Syst., 2024)

Permissive Equilibria in Multiplayer Reachability Games. - Aline Goeminne; Benjamin Monmege (CSL, 2025)

Special issue on 10th international workshop Weighted Automata: Theory and Applications (WATA 2020). - Manfred Droste; Paul Gastin; Benjamin Monmege (Inf. Comput., 2025)

Regular D-length: A tool for improved prefix-stable forward Ramsey factorisations. - Théodore Lopez; Benjamin Monmege; Jean-Marc Talbot (Inf. Process. Lett., 2025)

Decidability of One-Clock Weighted Timed Games with Arbitrary Weights. - Benjamin Monmege; Julie Parreaux; Pierre-Alain Reynier (Log. Methods Comput. Sci., 2025)

Playing Stochastically in Weighted Timed Games to Emulate Memory. - Benjamin Monmege; Julie Parreaux; Pierre-Alain Reynier (Log. Methods Comput. Sci., 2025)

Synthesising Asynchronous Automata from Fair Specifications. - Béatrice Bérard; Benjamin Monmege; B. Srivathsan; Arnab Sur (CoRR, 2025)