Follow
Benjamin Monmege
Benjamin Monmege
Assistant Professor, Aix-Marseille Université, Laboratoire d'Informatique et Systèmes
Verified email at univ-amu.fr - Homepage
Title
Cited by
Cited by
Year
Interval iteration algorithm for MDPs and IMDPs
S Haddad, B Monmege
Theoretical Computer Science 735, 111-131, 2018
562018
Reachability in MDPs: Refining convergence of value iteration
S Haddad, B Monmege
International Workshop on Reachability Problems, 125-137, 2014
452014
Pebble weighted automata and transitive closure logics
B Bollig, P Gastin, B Monmege, M Zeitoun
International Colloquium on Automata, Languages, and Programming, 587-598, 2010
372010
MightyL: A Compositional Translation from MITL to Timed Automata
T Brihaye, G Geeraerts, HM Ho, B Monmege
International Conference on Computer Aided Verification, 421-440, 2017
282017
A fresh approach to learning register automata
B Bollig, P Habermehl, M Leucker, B Monmege
International Conference on Developments in Language Theory, 118-130, 2013
282013
Bounded Underapproximations
P Ganty, R Majumdar, B Monmege
Formal Methods in System Design 40 (2), 206-231, 2012
262012
Bounded underapproximations
P Ganty, R Majumdar, B Monmege
International Conference on Computer Aided Verification, 600-614, 2010
242010
A robust class of data languages and an application to learning
B Monmege, M Leucker, P Habermehl, B Bollig
Logical Methods in Computer Science 10, 2014
212014
Adding negative prices to priced timed games
T Brihaye, G Geeraerts, S Narayanan Krishna, L Manasa, B Monmege, ...
International Conference on Concurrency Theory, 560-575, 2014
212014
Pseudopolynomial iterative algorithm to solve total-payoff games and min-cost reachability games
T Brihaye, G Geeraerts, A Haddad, B Monmege
Acta Informatica 54 (1), 85-125, 2017
202017
To reach or not to reach? Efficient algorithms for total-payoff games
T Brihaye, G Geeraerts, A Haddad, B Monmege
arXiv preprint arXiv:1407.5030, 2014
18*2014
A unifying survey on weighted logics and weighted automata
P Gastin, B Monmege
Soft Computing 22 (4), 1047-1065, 2018
162018
Simple priced timed games are not that simple
T Brihaye, G Geeraerts, A Haddad, E Lefaucheux, B Monmege
arXiv preprint arXiv:1507.03786, 2015
122015
Optimal reachability in divergent weighted timed games
D Busatto-Gaston, B Monmege, PA Reynier
International Conference on Foundations of Software Science and Computation …, 2017
102017
Adding Pebbles to Weighted Automata
P Gastin, B Monmege
Implementation and Application of Automata, 28-51, 2012
102012
Pebble weighted automata and weighted logics
B Bollig, P Gastin, B Monmege, M Zeitoun
ACM Transactions on Computational Logic (TOCL) 15 (2), 1-35, 2014
92014
Specification and verification of quantitative properties: expressions, logics, and automata
B Monmege
École normale supérieure de Cachan-ENS Cachan, 2013
92013
Logical characterization of weighted pebble walking automata
B Bollig, P Gastin, B Monmege, M Zeitoun
Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference …, 2014
82014
A Probabilistic Kleene Theorem
B Bollig, P Gastin, B Monmege, M Zeitoun
8*
Robust controller synthesis in timed büchi automata: A symbolic approach
D Busatto-Gaston, B Monmege, PA Reynier, O Sankur
International Conference on Computer Aided Verification, 572-590, 2019
72019
The system can't perform the operation now. Try again later.
Articles 1–20