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