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).

[BibT_eX]

[DOI]

Benjamin Monmege

, 2022

2021

Playing Stochastically in Weighted Timed Games to Emulate Memory.

[BibT_eX]

[DOI]

Benjamin Monmege

Julie Parreaux

Pierre-Alain Reynier

Proceedings of the 48th International Colloquium on Automata, Languages, and Programming, 2021

2020

One-Clock Priced Timed Games with Arbitrary Weights.

[BibT_eX]

[DOI]

CoRR, 2020

Reaching Your Goal Optimally by Playing at Random.

[BibT_eX]

[DOI]

Benjamin Monmege

Julie Parreaux

Pierre-Alain Reynier

CoRR, 2020

Reaching Your Goal Optimally by Playing at Random with No Memory.

[BibT_eX]

[DOI]

Benjamin Monmege

Julie Parreaux

Pierre-Alain Reynier

Proceedings of the 31st International Conference on Concurrency Theory, 2020

2019

Determinisation of Finitely-Ambiguous Copyless Cost Register Automata.

[BibT_eX]

[DOI]

Théodore Lopez

Benjamin Monmege

Jean-Marc Talbot

Proceedings of the 44th International Symposium on Mathematical Foundations of Computer Science, 2019

Dynamics on Games: Simulation-Based Techniques and Applications to Routing.

[BibT_eX]

[DOI]

Proceedings of the 39th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2019

Robust Controller Synthesis in Timed Büchi Automata: A Symbolic Approach.

[BibT_eX]

[DOI]

Damien Busatto-Gaston

Benjamin Monmege

Pierre-Alain Reynier

Ocan Sankur

Proceedings of the Computer Aided Verification - 31st International Conference, 2019

2018

Interval iteration algorithm for MDPs and IMDPs.

[BibT_eX]

[DOI]

Serge Haddad

Benjamin Monmege

Theor. Comput. Sci., 2018

A unifying survey on weighted logics and weighted automata - Core weighted logic: minimal and versatile specification of quantitative properties.

[BibT_eX]

[DOI]

Paul Gastin

Benjamin Monmege

Soft Comput., 2018

Efficient Algorithms and Tools for MITL Model-Checking and Synthesis.

[BibT_eX]

[DOI]

Proceedings of the 23rd International Conference on Engineering of Complex Computer Systems, 2018

Symbolic Approximation of Weighted Timed Games.

[BibT_eX]

[DOI]

Damien Busatto-Gaston

Benjamin Monmege

Pierre-Alain Reynier

Proceedings of the 38th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2018

2017

Pseudopolynomial iterative algorithm to solve total-payoff games and min-cost reachability games.

[BibT_eX]

[DOI]

Acta Informatica, 2017

Timed-Automata-Based Verification of MITL over Signals.

[BibT_eX]

[DOI]

Proceedings of the 24th International Symposium on Temporal Representation and Reasoning, 2017

Optimal Reachability in Divergent Weighted Timed Games.

[BibT_eX]

[DOI]

Damien Busatto-Gaston

Benjamin Monmege

Pierre-Alain Reynier

Proceedings of the Foundations of Software Science and Computation Structures, 2017

MightyL: A Compositional Translation from MITL to Timed Automata.

[BibT_eX]

[DOI]

Proceedings of the Computer Aided Verification - 29th International Conference, 2017

2016

Efficient Energy Distribution in a Smart Grid using Multi-Player Games.

[BibT_eX]

[DOI]

Proceedings of the Proceedings Cassting Workshop on Games for the Synthesis of Complex Systems and 3rd International Workshop on Synthesis of Complex Parameters, 2016

Real-Time Synthesis is Hard!

[BibT_eX]

[DOI]

Proceedings of the Formal Modeling and Analysis of Timed Systems, 2016

2015

Quantitative Games under Failures.

[BibT_eX]

[DOI]

Proceedings of the 35th IARCS Annual Conference on Foundation of Software Technology and Theoretical Computer Science, 2015

Simple Priced Timed Games are not That Simple.

[BibT_eX]

[DOI]

Proceedings of the 35th IARCS Annual Conference on Foundation of Software Technology and Theoretical Computer Science, 2015

To Reach or not to Reach? Efficient Algorithms for Total-Payoff Games.

[BibT_eX]

[DOI]

Proceedings of the 26th International Conference on Concurrency Theory, 2015

2014

Pebble Weighted Automata and Weighted Logics.

[BibT_eX]

[DOI]

ACM Trans. Comput. Log., 2014

Adding pebbles to weighted automata: Easy specification & efficient evaluation.

[BibT_eX]

[DOI]

Paul Gastin

Benjamin Monmege

Theor. Comput. Sci., 2014

A Robust Class of Data Languages and an Application to Learning.

[BibT_eX]

[DOI]

Log. Methods Comput. Sci., 2014

Reachability in MDPs: Refining Convergence of Value Iteration.

[BibT_eX]

[DOI]

Serge Haddad

Benjamin Monmege

Proceedings of the Reachability Problems - 8th International Workshop, 2014

Logical characterization of weighted pebble walking automata.

[BibT_eX]

[DOI]

Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 2014

Adding Negative Prices to Priced Timed Games.

[BibT_eX]

[DOI]

Thomas Brihaye

Gilles Geeraerts

Shankara Narayanan Krishna

Lakshmi Manasa

Benjamin Monmege

Ashutosh Trivedi

Proceedings of the CONCUR 2014 - Concurrency Theory - 25th International Conference, 2014

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).

[BibT_eX]

[DOI]

Benjamin Monmege

PhD thesis, 2013

Weighted Specifications over Nested Words.

[BibT_eX]

[DOI]

Benedikt Bollig

Paul Gastin

Benjamin Monmege

Proceedings of the Foundations of Software Science and Computation Structures, 2013

A Fresh Approach to Learning Register Automata.