Benjamin Monmege
Publication record assembled from the DBLP archive of ranked conferences.
Papers indexed
24
Venues
11
Active years
2010–2026
Best venue rank
A*
Where they publish
Papers
24 indexed papers, newest first.
| Year | Venue | Title | Authors |
|---|---|---|---|
| 2026 | CSL | Reasoning About Quality in Hyperproperties. | Samuel Graepler, Benjamin Monmege, Jean-Marc Talbot |
| 2026 | FOSSACS | Synthesising Asynchronous Automata from Fair Specifications. | Batrice Brard, Benjamin Monmege, B. Srivathsan, Arnab Sur |
| 2025 | CSL | Permissive Equilibria in Multiplayer Reachability Games. | Aline Goeminne, Benjamin Monmege |
| 2024 | MFCS | Synthesis of Robust Optimal Real-Time Systems. | Benjamin Monmege, Julie Parreaux, Pierre-Alain Reynier |
| 2024 | SACMAT | A Bargaining-Game Framework for Multi-Party Access Control. | Gelareh Hasel Mehri, Benjamin Monmege, Clara Bertolissi, Nicola Zannone |
| 2023 | ATVA | An Automata Theoretic Characterization of Weighted First-Order Logic. | Dhruv Nevatia, Benjamin Monmege |
| 2022 | CONCUR | Decidability of One-Clock Weighted Timed Games with Arbitrary Weights. | Benjamin Monmege, Julie Parreaux, Pierre-Alain Reynier |
| 2022 | CSL | Weighted Automata and Expressions over Pre-Rational Monoids. | Nicolas Baudru, Louis-Marie Dando, Nathan Lhote, Benjamin Monmege, Pierre-Alain Reynier, Jean-Marc Talbot |
| 2021 | ICALP | Playing Stochastically in Weighted Timed Games to Emulate Memory. | Benjamin Monmege, Julie Parreaux, Pierre-Alain Reynier |
| 2020 | CONCUR | Reaching Your Goal Optimally by Playing at Random with No Memory. | Benjamin Monmege, Julie Parreaux, Pierre-Alain Reynier |
| 2019 | CAV | Robust Controller Synthesis in Timed Bchi Automata: A Symbolic Approach. | Damien Busatto-Gaston, Benjamin Monmege, Pierre-Alain Reynier, Ocan Sankur |
| 2019 | MFCS | Determinisation of Finitely-Ambiguous Copyless Cost Register Automata. | Thodore Lopez, Benjamin Monmege, Jean-Marc Talbot |
| 2018 | ICECCS | Efficient Algorithms and Tools for MITL Model-Checking and Synthesis. | Thomas Brihaye, Gilles Geeraerts, Hsi-Ming Ho, Arthur Milchior, Benjamin Monmege |
| 2017 | CAV | MightyL: A Compositional Translation from MITL to Timed Automata. | Thomas Brihaye, Gilles Geeraerts, Hsi-Ming Ho, Benjamin Monmege |
| 2017 | FOSSACS | Optimal Reachability in Divergent Weighted Timed Games. | Damien Busatto-Gaston, Benjamin Monmege, Pierre-Alain Reynier |
| 2017 | TIME | Timed-Automata-Based Verification of MITL over Signals. | Thomas Brihaye, Gilles Geeraerts, Hsi-Ming Ho, Benjamin Monmege |
| 2015 | CONCUR | To Reach or not to Reach? Efficient Algorithms for Total-Payoff Games. | Thomas Brihaye, Gilles Geeraerts, Axel Haddad, Benjamin Monmege |
| 2014 | CONCUR | Adding Negative Prices to Priced Timed Games. | Thomas Brihaye, Gilles Geeraerts, Shankara Narayanan Krishna, Lakshmi Manasa, Benjamin Monmege, Ashutosh Trivedi |
| 2014 | CSL | Logical characterization of weighted pebble walking automata. | Benedikt Bollig, Paul Gastin, Benjamin Monmege, Marc Zeitoun |
| 2013 | DLT | A Fresh Approach to Learning Register Automata. | Benedikt Bollig, Peter Habermehl, Martin Leucker, Benjamin Monmege |
| 2013 | FOSSACS | Weighted Specifications over Nested Words. | Benedikt Bollig, Paul Gastin, Benjamin Monmege |
| 2012 | ATVA | A Probabilistic Kleene Theorem. | Benedikt Bollig, Paul Gastin, Benjamin Monmege, Marc Zeitoun |
| 2010 | CAV | Bounded Underapproximations. | Pierre Ganty, Rupak Majumdar, Benjamin Monmege |
| 2010 | ICALP | Pebble Weighted Automata and Transitive Closure Logics. | Benedikt Bollig, Paul Gastin, Benjamin Monmege, Marc Zeitoun |