Benjamin Monmege

From MaRDI portal
Person:453532

Available identifiers

zbMath Open monmege.benjaminMaRDI QIDQ453532

List of research outcomes





PublicationDate of PublicationType
Regular \(\mathcal{D}\)-length: a tool for improved prefix-stable forward Ramsey factorisations2024-09-11Paper
Decidability of one-clock weighted timed games with arbitrary weights2024-08-13Paper
https://portal.mardi4nfdi.de/entity/Q61249342024-04-10Paper
Robust controller synthesis in timed Büchi automata: a symbolic approach2024-02-16Paper
Optimal controller synthesis for timed systems2023-08-26Paper
Dynamics on Games: Simulation-Based Techniques and Applications to Routing2023-02-03Paper
Timed-automata-based verification of MITL over signals2023-02-03Paper
https://portal.mardi4nfdi.de/entity/Q51013502022-08-30Paper
https://portal.mardi4nfdi.de/entity/Q50924392022-07-21Paper
Symbolic Approximation of Weighted Timed Games2022-07-21Paper
Reaching Your Goal Optimally by Playing at Random with No Memory2022-07-18Paper
\textsc{MightyL}: a compositional translation from MITL to timed automata2022-07-01Paper
A unifying survey on weighted logics and weighted automata. Core weighted logic: minimal and versatile specification of quantitative properties2018-10-22Paper
Interval iteration algorithm for MDPs and IMDPs2018-06-05Paper
Logical characterization of weighted pebble walking automata2018-04-23Paper
Real-Time Synthesis is Hard!2018-02-16Paper
https://portal.mardi4nfdi.de/entity/Q53577112017-09-12Paper
https://portal.mardi4nfdi.de/entity/Q52753742017-07-13Paper
https://portal.mardi4nfdi.de/entity/Q52753752017-07-13Paper
Optimal Reachability in Divergent Weighted Timed Games2017-05-19Paper
Pseudopolynomial iterative algorithm to solve total-payoff games and min-cost reachability games2017-04-03Paper
Reachability in MDPs: Refining Convergence of Value Iteration2015-10-28Paper
A Robust Class of Data Languages and an Application to Learning2015-01-15Paper
Adding Negative Prices to Priced Timed Games2014-09-15Paper
Pebble Weighted Automata and Weighted Logics2014-07-17Paper
Adding pebbles to weighted automata: easy specification \& efficient evaluation2014-04-29Paper
A Fresh Approach to Learning Register Automata2013-06-28Paper
Weighted Specifications over Nested Words2013-03-18Paper
A Probabilistic Kleene Theorem2012-11-21Paper
Bounded underapproximations2012-09-27Paper
Adding Pebbles to Weighted Automata2012-09-20Paper
Pebble Weighted Automata and Transitive Closure Logics2010-09-07Paper

Research outcomes over time

This page was built for person: Benjamin Monmege