×

zbMATH — the first resource for mathematics

Monmege, Benjamin

Compute Distance To:
Author ID: monmege.benjamin Recent zbMATH articles by "Monmege, Benjamin"
Published as: Monmege, Benjamin
Documents Indexed: 20 Publications since 2010

Publications by Year

Citations contained in zbMATH

17 Publications have been cited 40 times in 30 Documents Cited by Year
Reachability in MDPs: refining convergence of value iteration. Zbl 1393.68102
Haddad, Serge; Monmege, Benjamin
6
2014
Pebble weighted automata and transitive closure logics. Zbl 1288.68149
Bollig, Benedikt; Gastin, Paul; Monmege, Benjamin; Zeitoun, Marc
6
2010
Pseudopolynomial iterative algorithm to solve total-payoff games and min-cost reachability games. Zbl 1362.68203
Brihaye, Thomas; Geeraerts, Gilles; Haddad, Axel; Monmege, Benjamin
3
2017
To reach or not to reach? Efficient algorithms for total-payoff games. Zbl 1376.91038
Brihaye, Thomas; Geeraerts, Gilles; Haddad, Axel; Monmege, Benjamin
3
2015
Bounded underapproximations. Zbl 1247.68140
Ganty, Pierre; Majumdar, Rupak; Monmege, Benjamin
3
2012
A unifying survey on weighted logics and weighted automata. Core weighted logic: minimal and versatile specification of quantitative properties. Zbl 1398.03157
Gastin, Paul; Monmege, Benjamin
2
2018
Simple priced timed games are not that simple. Zbl 1366.68137
Brihaye, Thomas; Geeraerts, Gilles; Haddad, Axel; Lefaucheux, Engel; Monmege, Benjamin
2
2015
Adding negative prices to priced timed games. Zbl 1417.68120
Brihaye, Thomas; Geeraerts, Gilles; Narayanan Krishna, Shankara; Manasa, Lakshmi; Monmege, Benjamin; Trivedi, Ashutosh
2
2014
Pebble weighted automata and weighted logics. Zbl 1291.03076
Bollig, Benedikt; Gastin, Paul; Monmege, Benjamin; Zeitoun, Marc
2
2014
Adding pebbles to weighted automata: easy specification & efficient evaluation. Zbl 1359.68167
Gastin, Paul; Monmege, Benjamin
2
2014
A fresh approach to learning register automata. Zbl 1381.68103
Bollig, Benedikt; Habermehl, Peter; Leucker, Martin; Monmege, Benjamin
2
2013
Adding pebbles to weighted automata. Zbl 1297.68128
Gastin, Paul; Monmege, Benjamin
2
2012
Interval iteration algorithm for MDPs and IMDPs. Zbl 1393.68103
Haddad, Serge; Monmege, Benjamin
1
2018
Optimal reachability in divergent weighted timed games. Zbl 06720989
Busatto-Gaston, Damien; Monmege, Benjamin; Reynier, Pierre-Alain
1
2017
Quantitative games under failures. Zbl 1366.68216
Brihaye, Thomas; Geeraerts, Gilles; Haddad, Axel; Monmege, Benjamin; Pérez, Guillermo A.; Renault, Gabriel
1
2015
A robust class of data languages and an application to learning. Zbl 1448.68258
Bollig, Benedikt; Habermehl, Peter; Leucker, Martin; Monmege, Benjamin
1
2014
Weighted specifications over nested words. Zbl 1260.68228
Bollig, Benedikt; Gastin, Paul; Monmege, Benjamin
1
2013
A unifying survey on weighted logics and weighted automata. Core weighted logic: minimal and versatile specification of quantitative properties. Zbl 1398.03157
Gastin, Paul; Monmege, Benjamin
2
2018
Interval iteration algorithm for MDPs and IMDPs. Zbl 1393.68103
Haddad, Serge; Monmege, Benjamin
1
2018
Pseudopolynomial iterative algorithm to solve total-payoff games and min-cost reachability games. Zbl 1362.68203
Brihaye, Thomas; Geeraerts, Gilles; Haddad, Axel; Monmege, Benjamin
3
2017
Optimal reachability in divergent weighted timed games. Zbl 06720989
Busatto-Gaston, Damien; Monmege, Benjamin; Reynier, Pierre-Alain
1
2017
To reach or not to reach? Efficient algorithms for total-payoff games. Zbl 1376.91038
Brihaye, Thomas; Geeraerts, Gilles; Haddad, Axel; Monmege, Benjamin
3
2015
Simple priced timed games are not that simple. Zbl 1366.68137
Brihaye, Thomas; Geeraerts, Gilles; Haddad, Axel; Lefaucheux, Engel; Monmege, Benjamin
2
2015
Quantitative games under failures. Zbl 1366.68216
Brihaye, Thomas; Geeraerts, Gilles; Haddad, Axel; Monmege, Benjamin; Pérez, Guillermo A.; Renault, Gabriel
1
2015
Reachability in MDPs: refining convergence of value iteration. Zbl 1393.68102
Haddad, Serge; Monmege, Benjamin
6
2014
Adding negative prices to priced timed games. Zbl 1417.68120
Brihaye, Thomas; Geeraerts, Gilles; Narayanan Krishna, Shankara; Manasa, Lakshmi; Monmege, Benjamin; Trivedi, Ashutosh
2
2014
Pebble weighted automata and weighted logics. Zbl 1291.03076
Bollig, Benedikt; Gastin, Paul; Monmege, Benjamin; Zeitoun, Marc
2
2014
Adding pebbles to weighted automata: easy specification & efficient evaluation. Zbl 1359.68167
Gastin, Paul; Monmege, Benjamin
2
2014
A robust class of data languages and an application to learning. Zbl 1448.68258
Bollig, Benedikt; Habermehl, Peter; Leucker, Martin; Monmege, Benjamin
1
2014
A fresh approach to learning register automata. Zbl 1381.68103
Bollig, Benedikt; Habermehl, Peter; Leucker, Martin; Monmege, Benjamin
2
2013
Weighted specifications over nested words. Zbl 1260.68228
Bollig, Benedikt; Gastin, Paul; Monmege, Benjamin
1
2013
Bounded underapproximations. Zbl 1247.68140
Ganty, Pierre; Majumdar, Rupak; Monmege, Benjamin
3
2012
Adding pebbles to weighted automata. Zbl 1297.68128
Gastin, Paul; Monmege, Benjamin
2
2012
Pebble weighted automata and transitive closure logics. Zbl 1288.68149
Bollig, Benedikt; Gastin, Paul; Monmege, Benjamin; Zeitoun, Marc
6
2010

Citations by Year