| No. |
Title |
Author |
Year |
| 1 |
Revisiting Parameter Synthesis for One-Counter Automata |
Pérez, Guillermo A. et al. |
2022 |
| 2 |
Coverability in 1-VASS with Disequality Tests |
Almagor, Shaull et al. |
2020 |
| 3 |
On the Complexity of Reachability in Parametric Markov Decision Processes |
Winkler, Tobias et al. |
2019 |
| 4 |
On the Complexity of Value Iteration |
Balaji, Nikhil et al. |
2019 |
| 5 |
Learning-Based Mean-Payoff Optimization in an Unknown MDP under Omega-Regular Constraints |
Kretínský, Jan et al. |
2018 |
| 6 |
When is Containment Decidable for Probabilistic Automata? |
Daviaud, Laure et al. |
2018 |
| 7 |
Admissibility in Quantitative Graph Games |
Brenguier, Romain et al. |
2016 |
| 8 |
Minimizing Regret in Discounted-Sum Games |
Hunter, Paul et al. |
2016 |
| 9 |
Quantitative Games under Failures |
Brihaye, Thomas et al. |
2015 |
| 10 |
Reactive Synthesis Without Regret |
Hunter, Paul et al. |
2015 |
