| Publication | Date of Publication | Type |
|---|
| The geometry of reachability in continuous vector addition systems with states | 2024-12-03 | Paper |
| Parikh one-counter automata | 2024-12-03 | Paper |
| A framework for the competitive analysis of model predictive controllers | 2024-10-23 | Paper |
| Automata with timers | 2024-05-03 | Paper |
| Learning realtime one-counter automata | 2024-01-23 | Paper |
| Validating streaming JSON documents with learned VPAs | 2023-12-13 | Paper |
Continuous One-counter Automata
ACM Transactions on Computational Logic | 2023-02-07 | Paper |
On the Complexity of Reachability in Parametric Markov Decision Processes
(available as arXiv preprint) | 2023-02-03 | Paper |
Correction to: ``Reactive synthesis without regret
Acta Informatica | 2022-09-26 | Paper |
On the Complexity of Value Iteration
(available as arXiv preprint) | 2022-07-21 | Paper |
scientific article; zbMATH DE number 7559494 (Why is no real title available?)
(available as arXiv preprint) | 2022-07-18 | Paper |
Active learning of sequential transducers with side information about the domain
(available as arXiv preprint) | 2022-03-25 | Paper |
Safe learning for near-optimal scheduling
(available as arXiv preprint) | 2022-03-24 | Paper |
Learning-based mean-payoff optimization in an unknown MDP under omega-regular constraints
(available as arXiv preprint) | 2021-08-04 | Paper |
| When is containment decidable for probabilistic automata? | 2021-07-28 | Paper |
Weak cost register automata are still powerful
International Journal of Foundations of Computer Science | 2021-04-19 | Paper |
The complexity of reachability in parametric Markov decision processes
Journal of Computer and System Sciences | 2021-04-14 | Paper |
The complexity of reachability in parametric Markov decision processes
Journal of Computer and System Sciences | 2021-04-14 | Paper |
When are emptiness and containment decidable for probabilistic automata?
Journal of Computer and System Sciences | 2021-04-14 | Paper |
When are emptiness and containment decidable for probabilistic automata?
Journal of Computer and System Sciences | 2021-04-14 | Paper |
| On delay and regret determinization of max-plus automata | 2021-01-19 | Paper |
On delay and regret determinization of max-plus automata
(available as arXiv preprint) | 2021-01-19 | Paper |
The impatient may use limited optimism to minimize regret
(available as arXiv preprint) | 2020-01-28 | Paper |
Partial solvers for generalized parity games
(available as arXiv preprint) | 2019-10-22 | Paper |
Looking at mean payoff through foggy windows
Acta Informatica | 2018-12-12 | Paper |
Weak cost register automata are still powerful
(available as arXiv preprint) | 2018-11-22 | Paper |
The complexity of graph-based reductions for reachability in Markov decision processes
(available as arXiv preprint) | 2018-07-17 | Paper |
Mean-payoff games with partial observation
Theoretical Computer Science | 2018-06-05 | Paper |
scientific article; zbMATH DE number 6862070 (Why is no real title available?)
(available as arXiv preprint) | 2018-04-19 | Paper |
| Reactive Synthesis Without Regret | 2017-09-12 | Paper |
Minimizing regret in discounted-sum games
(available as arXiv preprint) | 2017-07-19 | Paper |
Quantitative games under failures
(available as arXiv preprint) | 2017-07-13 | Paper |
Reactive synthesis without regret
Acta Informatica | 2017-04-03 | Paper |
Non-zero sum games for reactive synthesis
Language and Automata Theory and Applications | 2016-04-13 | Paper |
Looking at mean-payoff through foggy windows
Automated Technology for Verification and Analysis | 2016-01-08 | Paper |
Mean-payoff games with partial-observation (extended abstract)
Lecture Notes in Computer Science | 2015-10-28 | Paper |
| Modeling and estimation of parameters in the shape of radiation domains in photons dosimetry | 2002-10-31 | Paper |
