Benjamin Monmege

Cited by

	All	Since 2018
Citations	556	368
h-index	12	10
i10-index	16	11

120

201020112012201320142015201620172018201920202021202220232 10 14 17 27 36 35 41 49 44 67 48 113 46

Public access

View all

8 articles

0 articles

available

not available

Based on funding mandates

Co-authors

Thomas BrihayeUMONSVerified email at umons.ac.be
Gilles GeeraertsAssociate Prof. of Computer Science, Université libre de Bruxelles (ULB)Verified email at ulb.be
Paul GastinProfessor, LMF, ENS Paris-SaclayVerified email at lmf.cnrs.fr
Benedikt BolligCNRS, LMF, ENS Paris-Saclay, Université Paris-SaclayVerified email at lsv.ens-cachan.fr
Axel HaddadPostdoctoral Researcher, Effective Mathematics Team, Mons University, BelgiumVerified email at umons.ac.be
Pierre-Alain ReynierLIS, Aix-Marseille UniversitéVerified email at lif.univ-mrs.fr
Hsi-Ming HoUniversity of SussexVerified email at sussex.ac.uk
Serge HaddadProfessor of Computer Science, ENS Paris-SaclayVerified email at lsv.fr
Peter HabermehlAssistant Professor of Computer Science, IRIF, University Paris CitéVerified email at irif.fr
Martin LeuckerProfessor of Computer Science, University of LübeckVerified email at isp.uni-luebeck.de
Pierre GantyAssociate Research Professor, IMDEA Software InstituteVerified email at imdea.org
Rupak MajumdarMPI for Software SystemsVerified email at mpi-sws.org
Engel LefaucheuxMPI-SWSVerified email at mpi-sws.org
Ashutosh TrivediAssociate Professor, University of Colorado at BoulderVerified email at colorado.edu
Lakshmi ManasaPhD Student, IIT BombayVerified email at cse.iitb.ac.in
Ocan SankurUniv Rennes, CNRSVerified email at irisa.fr
Amit Kumar DharAssistant ProfessorVerified email at iitbhilai.ac.in
Guillermo A. PérezAssistant Professor, University of AntwerpVerified email at uantwerp.be
Markus BläserSaarland University, Saarland Informatics Campus, Saarbrücken, GermanyVerified email at cs.uni-saarland.de
Bruno QuoitinProfessor of Computer Science, University of MonsVerified email at umons.ac.be

Benjamin Monmege

Assistant Professor, Aix-Marseille Université, Laboratoire d'Informatique et Systèmes

Verified email at univ-amu.fr - Homepage

Formal languages Automata Quantitative specifications Verification Game Theory


Title Sort by citations Sort by year Sort by title	Cited by Cited by	Year
Interval iteration algorithm for MDPs and IMDPs S Haddad, B Monmege Theoretical Computer Science 735, 111-131, 2018	70	2018
Reachability in MDPs: Refining convergence of value iteration S Haddad, B Monmege Reachability Problems: 8th International Workshop, RP 2014, Oxford, UK …, 2014	54	2014
Bounded Underapproximations P Ganty, R Majumdar, B Monmege Formal Methods in System Design 40 (2), 206-231, 2012	47	2012
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	36	2010
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	35	2013
MightyL: A Compositional Translation from MITL to Timed Automata T Brihaye, G Geeraerts, HM Ho, B Monmege Computer Aided Verification: 29th International Conference, CAV 2017 …, 2017	31	2017
A robust class of data languages and an application to learning B Bollig, P Habermehl, M Leucker, B Monmege Logical Methods in Computer Science 10, 2014	24	2014
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	23	2014
Pseudopolynomial iterative algorithm to solve total-payoff games and min-cost reachability games T Brihaye, G Geeraerts, A Haddad, B Monmege Acta Informatica 54, 85-125, 2017	22	2017
A unifying survey on weighted logics and weighted automata: Core weighted logic: minimal and versatile specification of quantitative properties P Gastin, B Monmege Soft Computing 22, 1047-1065, 2018	19	2018
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	19*	2014
Simple priced timed games are not that simple T Brihaye, G Geeraerts, A Haddad, E Lefaucheux, B Monmege arXiv preprint arXiv:1507.03786, 2015	13	2015
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	12	2014
Optimal reachability in divergent weighted timed games D Busatto-Gaston, B Monmege, PA Reynier Foundations of Software Science and Computation Structures: 20th …, 2017	11	2017
Real-time synthesis is hard! T Brihaye, M Estiévenart, G Geeraerts, HM Ho, B Monmege, N Sznajder International Conference on Formal Modeling and Analysis of Timed Systems …, 2016	10	2016
Adding Pebbles to Weighted Automata P Gastin, B Monmege Implementation and Application of Automata, 28-51, 2012	10	2012
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	9	2014
Specification and verification of quantitative properties: expressions, logics, and automata B Monmege École normale supérieure de Cachan-ENS Cachan, 2013	9	2013
A Probabilistic Kleene Theorem B Bollig, P Gastin, B Monmege, M Zeitoun	9*
Robust controller synthesis in timed büchi automata: A symbolic approach D Busatto-Gaston, B Monmege, PA Reynier, O Sankur Computer Aided Verification: 31st International Conference, CAV 2019, New …, 2019	8	2019

The system can't perform the operation now. Try again later.

Articles 1–20

Citations per year

Duplicate citations

Merged citations

Add co-authorsCo-authors

Follow

Cited by

Co-authors