default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBenjamin Monmege
Person information
- affiliation: Aix Marseille University, France
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[j11]Théodore Lopez, Benjamin Monmege
, Jean-Marc Talbot:
Regular D-length: A tool for improved prefix-stable forward Ramsey factorisations. Inf. Process. Lett. 187: 106497 (2025)- 2024
- [j10]Markus Bläser, Benjamin Monmege:
Preface of STACS 2021 Special Issue. Theory Comput. Syst. 68(4): 835-837 (2024) - [c29]Benjamin Monmege, Julie Parreaux, Pierre-Alain Reynier:
Synthesis of Robust Optimal Real-Time Systems. MFCS 2024: 74:1-74:15 - [c28]Gelareh Hasel Mehri, Benjamin Monmege, Clara Bertolissi, Nicola Zannone:
A Bargaining-Game Framework for Multi-Party Access Control. SACMAT 2024 - [i18]Benjamin Monmege, Julie Parreaux, Pierre-Alain Reynier:
Synthesis of Robust Optimal Strategies in Weighted Timed Games. CoRR abs/2403.06921 (2024) - 2023
- [j9]Damien Busatto-Gaston, Benjamin Monmege, Pierre-Alain Reynier:
Optimal controller synthesis for timed systems. Log. Methods Comput. Sci. 19(1) (2023) - [c27]Dhruv Nevatia, Benjamin Monmege:
An Automata Theoretic Characterization of Weighted First-Order Logic. ATVA (1) 2023: 115-133 - [i17]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 abs/2305.10546 (2023) - [i16]Dhruv Nevatia, Benjamin Monmege:
An Automata Theoretic Characterization of Weighted First-Order Logic. CoRR abs/2307.14707 (2023) - 2022
- [b2]Benjamin Monmege:
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). Aix-Marseille University, France, 2022 - [j8]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) - [c26]Benjamin Monmege, Julie Parreaux, Pierre-Alain Reynier:
Decidability of One-Clock Weighted Timed Games with Arbitrary Weights. CONCUR 2022: 15:1-15:22 - [c25]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: 6:1-6:16 - [e2]Petra Berenbrink, Benjamin Monmege:
39th International Symposium on Theoretical Aspects of Computer Science, STACS 2022, March 15-18, 2022, Marseille, France (Virtual Conference). LIPIcs 219, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2022, ISBN 978-3-95977-222-8 [contents] - [i15]Benjamin Monmege, Julie Parreaux, Pierre-Alain Reynier:
Decidability of One-Clock Weighted Timed Games with Arbitrary Weights. CoRR abs/2207.01608 (2022) - 2021
- [c24]Benjamin Monmege, Julie Parreaux, Pierre-Alain Reynier:
Playing Stochastically in Weighted Timed Games to Emulate Memory. ICALP 2021: 137:1-137:17 - [e1]Markus Bläser, Benjamin Monmege:
38th International Symposium on Theoretical Aspects of Computer Science, STACS 2021, March 16-19, 2021, Saarbrücken, Germany (Virtual Conference). LIPIcs 187, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2021, ISBN 978-3-95977-180-1 [contents] - [i14]Damien Busatto-Gaston, Benjamin Monmege, Pierre-Alain Reynier:
Optimal controller synthesis for timed systems. CoRR abs/2104.12577 (2021) - [i13]Benjamin Monmege, Julie Parreaux, Pierre-Alain Reynier:
Playing Stochastically in Weighted Timed Games to Emulate Memory. CoRR abs/2105.00984 (2021) - [i12]Nicolas Baudru, Louis-Marie Dando, Nathan Lhote, Benjamin Monmege, Pierre-Alain Reynier, Jean-Marc Talbot:
Weighted Automata and Expressions over Pre-Rational Monoids. CoRR abs/2110.12395 (2021) - 2020
- [c23]Benjamin Monmege, Julie Parreaux, Pierre-Alain Reynier:
Reaching Your Goal Optimally by Playing at Random with No Memory. CONCUR 2020: 26:1-26:21 - [i11]Benjamin Monmege, Julie Parreaux, Pierre-Alain Reynier:
Reaching Your Goal Optimally by Playing at Random. CoRR abs/2005.04985 (2020) - [i10]Thomas Brihaye, Gilles Geeraerts, Axel Haddad, Engel Lefaucheux, Benjamin Monmege:
One-Clock Priced Timed Games with Arbitrary Weights. CoRR abs/2009.03074 (2020)
2010 – 2019
- 2019
- [c22]Damien Busatto-Gaston, Benjamin Monmege, Pierre-Alain Reynier, Ocan Sankur:
Robust Controller Synthesis in Timed Büchi Automata: A Symbolic Approach. CAV (1) 2019: 572-590 - [c21]Thomas Brihaye, Gilles Geeraerts, Marion Hallet, Benjamin Monmege, Bruno Quoitin:
Dynamics on Games: Simulation-Based Techniques and Applications to Routing. FSTTCS 2019: 35:1-35:14 - [c20]Théodore Lopez, Benjamin Monmege, Jean-Marc Talbot:
Determinisation of Finitely-Ambiguous Copyless Cost Register Automata. MFCS 2019: 75:1-75:15 - [i9]Thomas Brihaye, Gilles Geeraerts, Marion Hallet, Benjamin Monmege, Bruno Quoitin:
Dynamics on Games: Simulation-Based Techniques and Applications to Routing. CoRR abs/1910.00094 (2019) - 2018
- [j7]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): 1047-1065 (2018) - [j6]Serge Haddad, Benjamin Monmege:
Interval iteration algorithm for MDPs and IMDPs. Theor. Comput. Sci. 735: 111-131 (2018) - [c19]Damien Busatto-Gaston, Benjamin Monmege, Pierre-Alain Reynier:
Symbolic Approximation of Weighted Timed Games. FSTTCS 2018: 28:1-28:16 - [c18]Thomas Brihaye, Gilles Geeraerts, Hsi-Ming Ho, Arthur Milchior, Benjamin Monmege:
Efficient Algorithms and Tools for MITL Model-Checking and Synthesis. ICECCS 2018: 180-184 - [i8]Damien Busatto-Gaston, Benjamin Monmege, Pierre-Alain Reynier:
Symbolic Approximation of Weighted Timed Games. CoRR abs/1812.01062 (2018) - 2017
- [j5]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): 85-125 (2017) - [c17]Thomas Brihaye, Gilles Geeraerts, Hsi-Ming Ho, Benjamin Monmege:
MightyL: A Compositional Translation from MITL to Timed Automata. CAV (1) 2017: 421-440 - [c16]Damien Busatto-Gaston, Benjamin Monmege, Pierre-Alain Reynier:
Optimal Reachability in Divergent Weighted Timed Games. FoSSaCS 2017: 162-178 - [c15]Thomas Brihaye, Gilles Geeraerts, Hsi-Ming Ho, Benjamin Monmege:
Timed-Automata-Based Verification of MITL over Signals. TIME 2017: 7:1-7:19 - [i7]Damien Busatto-Gaston, Benjamin Monmege, Pierre-Alain Reynier:
Optimal Reachability in Divergent Weighted Timed Games. CoRR abs/1701.03716 (2017) - 2016
- [c14]Thomas Brihaye, Morgane Estiévenart, Gilles Geeraerts, Hsi-Ming Ho, Benjamin Monmege, Nathalie Sznajder:
Real-Time Synthesis is Hard! FORMATS 2016: 105-120 - [c13]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: 1-12 - [i6]Thomas Brihaye, Morgane Estiévenart, Gilles Geeraerts, Hsi-Ming Ho, Benjamin Monmege, Nathalie Sznajder:
Real-Time Synthesis is Hard! CoRR abs/1606.07124 (2016) - 2015
- [c12]Thomas Brihaye, Gilles Geeraerts, Axel Haddad, Benjamin Monmege:
To Reach or not to Reach? Efficient Algorithms for Total-Payoff Games. CONCUR 2015: 297-310 - [c11]Thomas Brihaye, Gilles Geeraerts, Axel Haddad, Engel Lefaucheux, Benjamin Monmege:
Simple Priced Timed Games are not That Simple. FSTTCS 2015: 278-292 - [c10]Thomas Brihaye, Gilles Geeraerts, Axel Haddad, Benjamin Monmege, Guillermo A. Pérez, Gabriel Renault:
Quantitative Games under Failures. FSTTCS 2015: 293-306 - [i5]Thomas Brihaye, Gilles Geeraerts, Axel Haddad, Benjamin Monmege, Guillermo A. Pérez, Gabriel Renault:
Quantitative Games under Failures. CoRR abs/1504.06744 (2015) - [i4]Thomas Brihaye, Gilles Geeraerts, Axel Haddad, Engel Lefaucheux, Benjamin Monmege:
Simple Priced Timed Games Are Not That Simple. CoRR abs/1507.03786 (2015) - 2014
- [j4]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) - [j3]Paul Gastin, Benjamin Monmege:
Adding pebbles to weighted automata: Easy specification & efficient evaluation. Theor. Comput. Sci. 534: 24-44 (2014) - [j2]Benedikt Bollig, Paul Gastin, Benjamin Monmege, Marc Zeitoun:
Pebble Weighted Automata and Weighted Logics. ACM Trans. Comput. Log. 15(2): 15:1-15:35 (2014) - [c9]Thomas Brihaye, Gilles Geeraerts, Shankara Narayanan Krishna, Lakshmi Manasa, Benjamin Monmege, Ashutosh Trivedi:
Adding Negative Prices to Priced Timed Games. CONCUR 2014: 560-575 - [c8]Benedikt Bollig, Paul Gastin, Benjamin Monmege, Marc Zeitoun:
Logical characterization of weighted pebble walking automata. CSL-LICS 2014: 19:1-19:10 - [c7]Serge Haddad, Benjamin Monmege:
Reachability in MDPs: Refining Convergence of Value Iteration. RP 2014: 125-137 - [i3]Thomas Brihaye, Gilles Geeraerts, Shankara Narayanan Krishna, Lakshmi Manasa, Benjamin Monmege, Ashutosh Trivedi:
Adding Negative Prices to Priced Timed Games. CoRR abs/1404.5894 (2014) - [i2]Thomas Brihaye, Gilles Geeraerts, Axel Haddad, Benjamin Monmege:
To Reach or not to Reach? Efficient Algorithms for Total-Payoff Games. CoRR abs/1407.5030 (2014) - 2013
- [b1]Benjamin Monmege:
Specification and verification of quantitative properties : expressions, logics, and automata. (Spécification et vérification de propriétés quantitatives : expressions, logiques et automates). École normale supérieure de Cachan, Paris, France, 2013 - [c6]Benedikt Bollig, Peter Habermehl, Martin Leucker, Benjamin Monmege:
A Fresh Approach to Learning Register Automata. Developments in Language Theory 2013: 118-130 - [c5]Benedikt Bollig, Paul Gastin, Benjamin Monmege:
Weighted Specifications over Nested Words. FoSSaCS 2013: 385-400 - 2012
- [j1]Pierre Ganty, Rupak Majumdar, Benjamin Monmege:
Bounded underapproximations. Formal Methods Syst. Des. 40(2): 206-231 (2012) - [c4]Benedikt Bollig, Paul Gastin, Benjamin Monmege, Marc Zeitoun:
A Probabilistic Kleene Theorem. ATVA 2012: 400-415 - [c3]Paul Gastin, Benjamin Monmege:
Adding Pebbles to Weighted Automata. CIAA 2012: 28-51 - 2010
- [c2]Pierre Ganty, Rupak Majumdar, Benjamin Monmege:
Bounded Underapproximations. CAV 2010: 600-614 - [c1]Benedikt Bollig, Paul Gastin, Benjamin Monmege, Marc Zeitoun:
Pebble Weighted Automata and Transitive Closure Logics. ICALP (2) 2010: 587-598
2000 – 2009
- 2008
- [i1]Pierre Ganty, Rupak Majumdar, Benjamin Monmege:
Parikh-Equivalent Bounded Underapproximations. CoRR abs/0809.1236 (2008)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-23 20:24 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
