Benjamin Monmege

ORCID

Publication Activity (10 Years)

Years Active: 2008-2024
Publications (10 Years): 35

Top Venues

CoRR

CONCUR

FSTTCS

Log. Methods Comput. Sci.

École normale supérieure de Cachan, Paris, France (PHD)

Education History

École normale supérieure de Cachan, Paris, France

PHD

Publications

Gelareh Hasel Mehri, Benjamin Monmege, Clara Bertolissi, Nicola Zannone
A Bargaining-Game Framework for Multi-Party Access Control. SACMAT (2024)
Benjamin Monmege, Julie Parreaux, Pierre-Alain Reynier
Synthesis of Robust Optimal Real-Time Systems. MFCS (2024)
Benjamin Monmege, Julie Parreaux, Pierre-Alain Reynier
Synthesis of Robust Optimal Strategies in Weighted Timed Games. CoRR (2024)
Dhruv Nevatia, Benjamin Monmege
An Automata Theoretic Characterization of Weighted First-Order Logic. CoRR (2023)
Dhruv Nevatia, Benjamin Monmege
An Automata Theoretic Characterization of Weighted First-Order Logic. ATVA (1) (2023)
Nathanaël Fijalkow, Nathalie Bertrand, Patricia Bouyer-Decitre, Romain Brenguier, Arnaud Carayol, John Fearnley, Hugo Gimbert, Florian Horn, Rasmus Ibsen-Jensen, Nicolas Markey, Benjamin Monmege, Petr Novotný, Mickael Randour, Ocan Sankur, Sylvain Schmitz, Olivier Serre, Mateusz Skomra
Games on Graphs. CoRR (2023)
Damien Busatto-Gaston, Benjamin Monmege, Pierre-Alain Reynier
Optimal controller synthesis for timed systems. Log. Methods Comput. Sci. 19 (1) (2023)
Benjamin Monmege, Julie Parreaux, Pierre-Alain Reynier
Decidability of One-Clock Weighted Timed Games with Arbitrary Weights. CoRR (2022)
Thomas Brihaye, Gilles Geeraerts, Axel Haddad, Engel Lefaucheux, Benjamin Monmege
One-Clock Priced Timed Games with Negative Weights. Log. Methods Comput. Sci. 18 (3) (2022)
Nicolas Baudru, Louis-Marie Dando, Nathan Lhote, Benjamin Monmege, Pierre-Alain Reynier, Jean-Marc Talbot
Weighted Automata and Expressions over Pre-Rational Monoids. CSL (2022)
Benjamin Monmege, Julie Parreaux, Pierre-Alain Reynier
Decidability of One-Clock Weighted Timed Games with Arbitrary Weights. CONCUR (2022)
Nicolas Baudru, Louis-Marie Dando, Nathan Lhote, Benjamin Monmege, Pierre-Alain Reynier, Jean-Marc Talbot
Weighted Automata and Expressions over Pre-Rational Monoids. CoRR (2021)
Benjamin Monmege, Julie Parreaux, Pierre-Alain Reynier
Playing Stochastically in Weighted Timed Games to Emulate Memory. ICALP (2021)
Benjamin Monmege, Julie Parreaux, Pierre-Alain Reynier
Playing Stochastically in Weighted Timed Games to Emulate Memory. CoRR (2021)
Damien Busatto-Gaston, Benjamin Monmege, Pierre-Alain Reynier
Optimal controller synthesis for timed systems. CoRR (2021)
Benjamin Monmege, Julie Parreaux, Pierre-Alain Reynier
Reaching Your Goal Optimally by Playing at Random. CoRR (2020)
Thomas Brihaye, Gilles Geeraerts, Axel Haddad, Engel Lefaucheux, Benjamin Monmege
One-Clock Priced Timed Games with Arbitrary Weights. CoRR (2020)
Benjamin Monmege, Julie Parreaux, Pierre-Alain Reynier
Reaching Your Goal Optimally by Playing at Random with No Memory. CONCUR (2020)
Thomas Brihaye, Gilles Geeraerts, Marion Hallet, Benjamin Monmege, Bruno Quoitin
Dynamics on Games: Simulation-Based Techniques and Applications to Routing. FSTTCS (2019)
Théodore Lopez, Benjamin Monmege, Jean-Marc Talbot
Determinisation of Finitely-Ambiguous Copyless Cost Register Automata. MFCS (2019)
Damien Busatto-Gaston, Benjamin Monmege, Pierre-Alain Reynier, Ocan Sankur
Robust Controller Synthesis in Timed Büchi Automata: A Symbolic Approach. CAV (1) (2019)
Thomas Brihaye, Gilles Geeraerts, Marion Hallet, Benjamin Monmege, Bruno Quoitin
Dynamics on Games: Simulation-Based Techniques and Applications to Routing. CoRR (2019)
Damien Busatto-Gaston, Benjamin Monmege, Pierre-Alain Reynier
Symbolic Approximation of Weighted Timed Games. CoRR (2018)
Thomas Brihaye, Gilles Geeraerts, Hsi-Ming Ho, Arthur Milchior, Benjamin Monmege
Efficient Algorithms and Tools for MITL Model-Checking and Synthesis. ICECCS (2018)
Damien Busatto-Gaston, Benjamin Monmege, Pierre-Alain Reynier
Symbolic Approximation of Weighted Timed Games. FSTTCS (2018)
Serge Haddad, Benjamin Monmege
Interval iteration algorithm for MDPs and IMDPs. Theor. Comput. Sci. 735 (2018)
Paul Gastin, Benjamin Monmege
A unifying survey on weighted logics and weighted automata - Core weighted logic: minimal and versatile specification of quantitative properties. Soft Comput. 22 (4) (2018)
Thomas Brihaye, Gilles Geeraerts, Axel Haddad, Benjamin Monmege
Pseudopolynomial iterative algorithm to solve total-payoff games and min-cost reachability games. Acta Informatica 54 (1) (2017)
Thomas Brihaye, Gilles Geeraerts, Hsi-Ming Ho, Benjamin Monmege
MightyL: A Compositional Translation from MITL to Timed Automata. CAV (1) (2017)
Damien Busatto-Gaston, Benjamin Monmege, Pierre-Alain Reynier
Optimal Reachability in Divergent Weighted Timed Games. CoRR (2017)
Thomas Brihaye, Gilles Geeraerts, Hsi-Ming Ho, Benjamin Monmege
Timed-Automata-Based Verification of MITL over Signals. TIME (2017)
Damien Busatto-Gaston, Benjamin Monmege, Pierre-Alain Reynier
Optimal Reachability in Divergent Weighted Timed Games. FoSSaCS (2017)
Thomas Brihaye, Morgane Estiévenart, Gilles Geeraerts, Hsi-Ming Ho, Benjamin Monmege, Nathalie Sznajder
Real-Time Synthesis is Hard! FORMATS (2016)
Thomas Brihaye, Amit Kumar Dhar, Gilles Geeraerts, Axel Haddad, Benjamin Monmege
Efficient Energy Distribution in a Smart Grid using Multi-Player Games. Cassting/SynCoP (2016)
Thomas Brihaye, Morgane Estiévenart, Gilles Geeraerts, Hsi-Ming Ho, Benjamin Monmege, Nathalie Sznajder
Real-Time Synthesis is Hard! CoRR (2016)
Thomas Brihaye, Gilles Geeraerts, Axel Haddad, Benjamin Monmege, Guillermo A. Pérez, Gabriel Renault
Quantitative Games under Failures. CoRR (2015)
Thomas Brihaye, Gilles Geeraerts, Axel Haddad, Engel Lefaucheux, Benjamin Monmege
Simple Priced Timed Games Are Not That Simple. CoRR (2015)
Thomas Brihaye, Gilles Geeraerts, Axel Haddad, Benjamin Monmege
To Reach or not to Reach? Efficient Algorithms for Total-Payoff Games. CONCUR (2015)
Thomas Brihaye, Gilles Geeraerts, Axel Haddad, Benjamin Monmege, Guillermo A. Pérez, Gabriel Renault
Quantitative Games under Failures. FSTTCS (2015)
Thomas Brihaye, Gilles Geeraerts, Axel Haddad, Engel Lefaucheux, Benjamin Monmege
Simple Priced Timed Games are not That Simple. FSTTCS (2015)
Benedikt Bollig, Paul Gastin, Benjamin Monmege, Marc Zeitoun
Pebble Weighted Automata and Weighted Logics. ACM Trans. Comput. Log. 15 (2) (2014)
Benedikt Bollig, Peter Habermehl, Martin Leucker, Benjamin Monmege
A Robust Class of Data Languages and an Application to Learning. Log. Methods Comput. Sci. 10 (4) (2014)
Thomas Brihaye, Gilles Geeraerts, Shankara Narayanan Krishna, Lakshmi Manasa, Benjamin Monmege, Ashutosh Trivedi
Adding Negative Prices to Priced Timed Games. CONCUR (2014)
Paul Gastin, Benjamin Monmege
Adding pebbles to weighted automata: Easy specification & efficient evaluation. Theor. Comput. Sci. 534 (2014)
Thomas Brihaye, Gilles Geeraerts, Shankara Narayanan Krishna, Lakshmi Manasa, Benjamin Monmege, Ashutosh Trivedi
Adding Negative Prices to Priced Timed Games. CoRR (2014)
Serge Haddad, Benjamin Monmege
Reachability in MDPs: Refining Convergence of Value Iteration. RP (2014)
Thomas Brihaye, Gilles Geeraerts, Axel Haddad, Benjamin Monmege
To Reach or not to Reach? Efficient Algorithms for Total-Payoff Games. CoRR (2014)
Benedikt Bollig, Paul Gastin, Benjamin Monmege, Marc Zeitoun
Logical characterization of weighted pebble walking automata. CSL-LICS (2014)
Benedikt Bollig, Paul Gastin, Benjamin Monmege
Weighted Specifications over Nested Words. FoSSaCS (2013)
Benedikt Bollig, Peter Habermehl, Martin Leucker, Benjamin Monmege
A Fresh Approach to Learning Register Automata. Developments in Language Theory (2013)
Benedikt Bollig, Paul Gastin, Benjamin Monmege, Marc Zeitoun
A Probabilistic Kleene Theorem. ATVA (2012)
Paul Gastin, Benjamin Monmege
Adding Pebbles to Weighted Automata. CIAA (2012)
Pierre Ganty, Rupak Majumdar, Benjamin Monmege
Bounded underapproximations. Formal Methods Syst. Des. 40 (2) (2012)
Pierre Ganty, Rupak Majumdar, Benjamin Monmege
Bounded Underapproximations. CAV (2010)
Benedikt Bollig, Paul Gastin, Benjamin Monmege, Marc Zeitoun
Pebble Weighted Automata and Transitive Closure Logics. ICALP (2) (2010)
Pierre Ganty, Rupak Majumdar, Benjamin Monmege
Parikh-Equivalent Bounded Underapproximations CoRR (2008)

Benjamin Monmege.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Benjamin Monmege