| Publication | Date of Publication | Type |
|---|
Playing stochastically in weighted timed games to emulate memory
Logical Methods in Computer Science | 2025-03-06 | Paper |
Decidability of one-clock weighted timed games with arbitrary weights
Logical Methods in Computer Science | 2025-01-31 | Paper |
Regular \(\mathcal{D}\)-length: a tool for improved prefix-stable forward Ramsey factorisations
Information Processing Letters | 2024-09-11 | Paper |
| Decidability of one-clock weighted timed games with arbitrary weights | 2024-08-13 | Paper |
scientific article; zbMATH DE number 7830362 (Why is no real title available?)
(available as arXiv preprint) | 2024-04-10 | Paper |
Robust controller synthesis in timed Büchi automata: a symbolic approach
Computer Aided Verification | 2024-02-16 | Paper |
Optimal controller synthesis for timed systems
Logical Methods in Computer Science | 2023-08-26 | Paper |
Dynamics on Games: Simulation-Based Techniques and Applications to Routing
(available as arXiv preprint) | 2023-02-03 | Paper |
Timed-automata-based verification of MITL over signals
1515.68173 | 2023-02-03 | Paper |
scientific article; zbMATH DE number 7577581 (Why is no real title available?)
(available as arXiv preprint) | 2022-08-30 | Paper |
| scientific article; zbMATH DE number 7577581 (Why is no real title available?) | 2022-08-30 | Paper |
| Determinisation of finitely-ambiguous copyless cost register automata | 2022-07-21 | Paper |
Symbolic Approximation of Weighted Timed Games
(available as arXiv preprint) | 2022-07-21 | Paper |
Reaching Your Goal Optimally by Playing at Random with No Memory
(available as arXiv preprint) | 2022-07-18 | Paper |
| \textsc{MightyL}: a compositional translation from MITL to timed automata | 2022-07-01 | Paper |
A unifying survey on weighted logics and weighted automata. Core weighted logic: minimal and versatile specification of quantitative properties
Soft Computing | 2018-10-22 | Paper |
Interval iteration algorithm for MDPs and IMDPs
Theoretical Computer Science | 2018-06-05 | Paper |
Logical characterization of weighted pebble walking automata
Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) | 2018-04-23 | Paper |
Real-time synthesis is hard!
Lecture Notes in Computer Science | 2018-02-16 | Paper |
To reach or not to reach? Efficient algorithms for total-payoff games
(available as arXiv preprint) | 2017-09-12 | Paper |
Simple priced timed games are not that simple
(available as arXiv preprint) | 2017-07-13 | Paper |
Quantitative games under failures
(available as arXiv preprint) | 2017-07-13 | Paper |
Optimal reachability in divergent weighted timed games
Lecture Notes in Computer Science | 2017-05-19 | Paper |
Pseudopolynomial iterative algorithm to solve total-payoff games and min-cost reachability games
Acta Informatica | 2017-04-03 | Paper |
Reachability in MDPs: refining convergence of value iteration
Lecture Notes in Computer Science | 2015-10-28 | Paper |
A robust class of data languages and an application to learning
Logical Methods in Computer Science | 2015-01-15 | Paper |
Adding negative prices to priced timed games
CONCUR 2014 – Concurrency Theory | 2014-09-15 | Paper |
Pebble weighted automata and weighted logics
ACM Transactions on Computational Logic | 2014-07-17 | Paper |
Adding pebbles to weighted automata: easy specification \& efficient evaluation
Theoretical Computer Science | 2014-04-29 | Paper |
A fresh approach to learning register automata
Developments in Language Theory | 2013-06-28 | Paper |
Weighted specifications over nested words
Lecture Notes in Computer Science | 2013-03-18 | Paper |
A probabilistic Kleene theorem
Automated Technology for Verification and Analysis | 2012-11-21 | Paper |
Bounded underapproximations
Formal Methods in System Design | 2012-09-27 | Paper |
Adding pebbles to weighted automata
Implementation and Application of Automata | 2012-09-20 | Paper |
Pebble weighted automata and transitive closure logics
Automata, Languages and Programming | 2010-09-07 | Paper |
