Benjamin Monmege

71 papers A* 2A 2B 14C 4Journal 35Unranked 12

Year	Rank	Type	Title / Venue / Authors
2026	B	`conf`	Reasoning About Quality in Hyperproperties. CSL Samuel Graepler, Benjamin Monmege, Jean-Marc Talbot
2026	B	`conf`	Synthesising Asynchronous Automata from Fair Specifications. FoSSaCS Béatrice Bérard, Benjamin Monmege, B. Srivathsan, Arnab Sur
2025	J	`jnl`	Decidability of One-Clock Weighted Timed Games with Arbitrary Weights. Log. Methods Comput. Sci. Benjamin Monmege, Julie Parreaux, Pierre-Alain Reynier
2025	B	`conf`	Permissive Equilibria in Multiplayer Reachability Games. CSL Aline Goeminne, Benjamin Monmege
2025	J	`jnl`	Playing Stochastically in Weighted Timed Games to Emulate Memory. Log. Methods Comput. Sci. Benjamin Monmege, Julie Parreaux, Pierre-Alain Reynier
2025	J	`jnl`	Reasoning about Quality in Hyperproperties. CoRR Samuel Graepler, Benjamin Monmege, Jean-Marc Talbot
2025	J	`jnl`	Regular D-length: A tool for improved prefix-stable forward Ramsey factorisations. Inf. Process. Lett. Théodore Lopez, Benjamin Monmege, Jean-Marc Talbot
2025	J	`jnl`	Special issue on 10th international workshop Weighted Automata: Theory and Applications (WATA 2020). Inf. Comput. Manfred Droste, Paul Gastin, Benjamin Monmege
2025	J	`jnl`	Synthesising Asynchronous Automata from Fair Specifications. CoRR Béatrice Bérard, Benjamin Monmege, B. Srivathsan, Arnab Sur
2024	C	`conf`	A Bargaining-Game Framework for Multi-Party Access Control. SACMAT Gelareh Hasel Mehri, Benjamin Monmege, Clara Bertolissi, Nicola Zannone
2024	J	`jnl`	Permissive Equilibria in Multiplayer Reachability Games. CoRR Aline Goeminne, Benjamin Monmege
2024	J	`jnl`	Preface of STACS 2021 Special Issue. Theory Comput. Syst. Markus Bläser, Benjamin Monmege
2024	B	`conf`	Synthesis of Robust Optimal Real-Time Systems. MFCS Benjamin Monmege, Julie Parreaux, Pierre-Alain Reynier
2024	J	`jnl`	Synthesis of Robust Optimal Strategies in Weighted Timed Games. CoRR Benjamin Monmege, Julie Parreaux, Pierre-Alain Reynier
2023	—	`conf`	An Automata Theoretic Characterization of Weighted First-Order Logic. ATVA (1) Dhruv Nevatia, Benjamin Monmege
2023	J	`jnl`	An Automata Theoretic Characterization of Weighted First-Order Logic. CoRR Dhruv Nevatia, Benjamin Monmege
2023	J	`jnl`	Games on Graphs. CoRR 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
2023	J	`jnl`	Optimal controller synthesis for timed systems. Log. Methods Comput. Sci. Damien Busatto-Gaston, Benjamin Monmege, Pierre-Alain Reynier
2022	A	`ed.`	39th International Symposium on Theoretical Aspects of Computer Science, STACS 2022, Marseille, France (Virtual Conference), March 15-18, 2022 STACS Petra Berenbrink, Benjamin Monmege
2022	B	`conf`	Decidability of One-Clock Weighted Timed Games with Arbitrary Weights. CONCUR Benjamin Monmege, Julie Parreaux, Pierre-Alain Reynier
2022	J	`jnl`	Decidability of One-Clock Weighted Timed Games with Arbitrary Weights. CoRR Benjamin Monmege, Julie Parreaux, Pierre-Alain Reynier
2022	—	`book`	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	J	`jnl`	One-Clock Priced Timed Games with Negative Weights. Log. Methods Comput. Sci. Thomas Brihaye, Gilles Geeraerts, Axel Haddad, Engel Lefaucheux, Benjamin Monmege
2022	B	`conf`	Weighted Automata and Expressions over Pre-Rational Monoids. CSL Nicolas Baudru, Louis-Marie Dando, Nathan Lhote, Benjamin Monmege, Pierre-Alain Reynier, Jean-Marc Talbot
2021	A	`ed.`	38th International Symposium on Theoretical Aspects of Computer Science, STACS 2021, Saarbrücken, Germany (Virtual Conference), March 16-19, 2021 STACS Markus Bläser, Benjamin Monmege
2021	J	`jnl`	Optimal controller synthesis for timed systems. CoRR Damien Busatto-Gaston, Benjamin Monmege, Pierre-Alain Reynier
2021	A*	`conf`	Playing Stochastically in Weighted Timed Games to Emulate Memory. ICALP Benjamin Monmege, Julie Parreaux, Pierre-Alain Reynier
2021	J	`jnl`	Playing Stochastically in Weighted Timed Games to Emulate Memory. CoRR Benjamin Monmege, Julie Parreaux, Pierre-Alain Reynier
2021	J	`jnl`	Weighted Automata and Expressions over Pre-Rational Monoids. CoRR Nicolas Baudru, Louis-Marie Dando, Nathan Lhote, Benjamin Monmege, Pierre-Alain Reynier, Jean-Marc Talbot
2020	J	`jnl`	One-Clock Priced Timed Games with Arbitrary Weights. CoRR Thomas Brihaye, Gilles Geeraerts, Axel Haddad, Engel Lefaucheux, Benjamin Monmege
2020	B	`conf`	Reaching Your Goal Optimally by Playing at Random with No Memory. CONCUR Benjamin Monmege, Julie Parreaux, Pierre-Alain Reynier
2020	J	`jnl`	Reaching Your Goal Optimally by Playing at Random. CoRR Benjamin Monmege, Julie Parreaux, Pierre-Alain Reynier
2019	B	`conf`	Determinisation of Finitely-Ambiguous Copyless Cost Register Automata. MFCS Théodore Lopez, Benjamin Monmege, Jean-Marc Talbot
2019	—	`conf`	Dynamics on Games: Simulation-Based Techniques and Applications to Routing. FSTTCS Thomas Brihaye, Gilles Geeraerts, Marion Hallet, Benjamin Monmege, Bruno Quoitin
2019	J	`jnl`	Dynamics on Games: Simulation-Based Techniques and Applications to Routing. CoRR Thomas Brihaye, Gilles Geeraerts, Marion Hallet, Benjamin Monmege, Bruno Quoitin
2019	—	`conf`	Robust Controller Synthesis in Timed Büchi Automata: A Symbolic Approach. CAV (1) Damien Busatto-Gaston, Benjamin Monmege, Pierre-Alain Reynier, Ocan Sankur
2018	J	`jnl`	A unifying survey on weighted logics and weighted automata - Core weighted logic: minimal and versatile specification of quantitative properties. Soft Comput. Paul Gastin, Benjamin Monmege
2018	B	`conf`	Efficient Algorithms and Tools for MITL Model-Checking and Synthesis. ICECCS Thomas Brihaye, Gilles Geeraerts, Hsi-Ming Ho, Arthur Milchior, Benjamin Monmege
2018	J	`jnl`	Interval iteration algorithm for MDPs and IMDPs. Theor. Comput. Sci. Serge Haddad, Benjamin Monmege
2018	—	`conf`	Symbolic Approximation of Weighted Timed Games. FSTTCS Damien Busatto-Gaston, Benjamin Monmege, Pierre-Alain Reynier
2018	J	`jnl`	Symbolic Approximation of Weighted Timed Games. CoRR Damien Busatto-Gaston, Benjamin Monmege, Pierre-Alain Reynier
2017	—	`conf`	MightyL: A Compositional Translation from MITL to Timed Automata. CAV (1) Thomas Brihaye, Gilles Geeraerts, Hsi-Ming Ho, Benjamin Monmege
2017	B	`conf`	Optimal Reachability in Divergent Weighted Timed Games. FoSSaCS Damien Busatto-Gaston, Benjamin Monmege, Pierre-Alain Reynier
2017	J	`jnl`	Optimal Reachability in Divergent Weighted Timed Games. CoRR Damien Busatto-Gaston, Benjamin Monmege, Pierre-Alain Reynier
2017	J	`jnl`	Pseudopolynomial iterative algorithm to solve total-payoff games and min-cost reachability games. Acta Informatica Thomas Brihaye, Gilles Geeraerts, Axel Haddad, Benjamin Monmege
2017	C	`conf`	Timed-Automata-Based Verification of MITL over Signals. TIME Thomas Brihaye, Gilles Geeraerts, Hsi-Ming Ho, Benjamin Monmege
2016	—	`conf`	Efficient Energy Distribution in a Smart Grid using Multi-Player Games. Cassting/SynCoP Thomas Brihaye, Amit Kumar Dhar, Gilles Geeraerts, Axel Haddad, Benjamin Monmege
2016	—	`conf`	Real-Time Synthesis is Hard! FORMATS Thomas Brihaye, Morgane Estiévenart, Gilles Geeraerts, Hsi-Ming Ho, Benjamin Monmege, Nathalie Sznajder
2016	J	`jnl`	Real-Time Synthesis is Hard! CoRR Thomas Brihaye, Morgane Estiévenart, Gilles Geeraerts, Hsi-Ming Ho, Benjamin Monmege, Nathalie Sznajder
2015	—	`conf`	Quantitative Games under Failures. FSTTCS Thomas Brihaye, Gilles Geeraerts, Axel Haddad, Benjamin Monmege, Guillermo A. Pérez, Gabriel Renault
2015	J	`jnl`	Quantitative Games under Failures. CoRR Thomas Brihaye, Gilles Geeraerts, Axel Haddad, Benjamin Monmege, Guillermo A. Pérez, Gabriel Renault
2015	J	`jnl`	Simple Priced Timed Games Are Not That Simple. CoRR Thomas Brihaye, Gilles Geeraerts, Axel Haddad, Engel Lefaucheux, Benjamin Monmege
2015	—	`conf`	Simple Priced Timed Games are not That Simple. FSTTCS Thomas Brihaye, Gilles Geeraerts, Axel Haddad, Engel Lefaucheux, Benjamin Monmege
2015	B	`conf`	To Reach or not to Reach? Efficient Algorithms for Total-Payoff Games. CONCUR Thomas Brihaye, Gilles Geeraerts, Axel Haddad, Benjamin Monmege
2014	J	`jnl`	A Robust Class of Data Languages and an Application to Learning. Log. Methods Comput. Sci. Benedikt Bollig, Peter Habermehl, Martin Leucker, Benjamin Monmege
2014	B	`conf`	Adding Negative Prices to Priced Timed Games. CONCUR Thomas Brihaye, Gilles Geeraerts, Shankara Narayanan Krishna, Lakshmi Manasa, Benjamin Monmege, Ashutosh Trivedi
2014	J	`jnl`	Adding Negative Prices to Priced Timed Games. CoRR Thomas Brihaye, Gilles Geeraerts, Shankara Narayanan Krishna, Lakshmi Manasa, Benjamin Monmege, Ashutosh Trivedi
2014	J	`jnl`	Adding pebbles to weighted automata: Easy specification & efficient evaluation. Theor. Comput. Sci. Paul Gastin, Benjamin Monmege
2014	—	`conf`	Logical characterization of weighted pebble walking automata. CSL-LICS Benedikt Bollig, Paul Gastin, Benjamin Monmege, Marc Zeitoun
2014	J	`jnl`	Pebble Weighted Automata and Weighted Logics. ACM Trans. Comput. Log. Benedikt Bollig, Paul Gastin, Benjamin Monmege, Marc Zeitoun
2014	—	`conf`	Reachability in MDPs: Refining Convergence of Value Iteration. RP Serge Haddad, Benjamin Monmege
2014	J	`jnl`	To Reach or not to Reach? Efficient Algorithms for Total-Payoff Games. CoRR Thomas Brihaye, Gilles Geeraerts, Axel Haddad, Benjamin Monmege
2013	C	`conf`	A Fresh Approach to Learning Register Automata. Developments in Language Theory Benedikt Bollig, Peter Habermehl, Martin Leucker, Benjamin Monmege
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	B	`conf`	Weighted Specifications over Nested Words. FoSSaCS Benedikt Bollig, Paul Gastin, Benjamin Monmege
2012	B	`conf`	A Probabilistic Kleene Theorem. ATVA Benedikt Bollig, Paul Gastin, Benjamin Monmege, Marc Zeitoun
2012	C	`conf`	Adding Pebbles to Weighted Automata. CIAA Paul Gastin, Benjamin Monmege
2012	J	`jnl`	Bounded underapproximations. Formal Methods Syst. Des. Pierre Ganty, Rupak Majumdar, Benjamin Monmege
2010	A*	`conf`	Bounded Underapproximations. CAV Pierre Ganty, Rupak Majumdar, Benjamin Monmege
2010	—	`conf`	Pebble Weighted Automata and Transitive Closure Logics. ICALP (2) Benedikt Bollig, Paul Gastin, Benjamin Monmege, Marc Zeitoun
2008	J	`jnl`	Parikh-Equivalent Bounded Underapproximations CoRR Pierre Ganty, Rupak Majumdar, Benjamin Monmege