Benjamin Monmege
Benjamin Monmege
Assistant Professor, Aix-Marseille Université, Laboratoire d'Informatique et Systèmes
Bestätigte E-Mail-Adresse bei univ-amu.fr - Startseite
Titel
Zitiert von
Zitiert von
Jahr
Interval iteration algorithm for MDPs and IMDPs
S Haddad, B Monmege
Theoretical Computer Science 735, 111-131, 2018
482018
Reachability in MDPs: Refining convergence of value iteration
S Haddad, B Monmege
International Workshop on Reachability Problems, 125-137, 2014
432014
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
362010
Bounded Underapproximations
P Ganty, R Majumdar, B Monmege
Formal Methods in System Design 40 (2), 206-231, 2012
272012
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
262013
Bounded underapproximations
P Ganty, R Majumdar, B Monmege
International Conference on Computer Aided Verification, 600-614, 2010
262010
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
222017
Adding negative prices to priced timed games
T Brihaye, G Geeraerts, SN Krishna, L Manasa, B Monmege, A Trivedi
International Conference on Concurrency Theory, 560-575, 2014
182014
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
172017
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
172014
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
15*2014
A unifying survey on weighted logics and weighted automata
P Gastin, B Monmege
Soft Computing 22 (4), 1047-1065, 2018
122018
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
Adding Pebbles to Weighted Automata
P Gastin, B Monmege
Implementation and Application of Automata, 28-51, 2012
92012
A Probabilistic Kleene Theorem
B Bollig, P Gastin, B Monmege, M Zeitoun
9*
Simple priced timed games are not that simple
T Brihaye, G Geeraerts, A Haddad, E Lefaucheux, B Monmege
arXiv preprint arXiv:1507.03786, 2015
82015
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
72014
Adding pebbles to weighted automata: Easy specification & efficient evaluation
P Gastin, B Monmege
Theoretical Computer Science 534, 24-44, 2014
72014
Weighted specifications over nested words
B Bollig, P Gastin, B Monmege
International Conference on Foundations of Software Science and …, 2013
62013
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–20