Samenvatting
We consider the verification of multiple expected reward objectives at once on Markov decision processes (MDPs). This enables a trade-off analysis among multiple objectives by obtaining a Pareto front. We focus on strategies that are easy to employ and implement. That is, strategies that are pure (no randomization) and have bounded memory. We show that checking whether a point is achievable by a pure stationary strategy is NP-complete, even for two objectives, and we provide an MILP encoding to solve the corresponding problem. The bounded memory case is treated by a product construction. Experimental results using Storm and Gurobi show the feasibility of our algorithms.
Originele taal-2 | English |
---|---|
Titel | Tools and Algorithms for the Construction and Analysis of Systems - 26th International Conference, TACAS 2020, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2020, Dublin, Ireland, April 25-30, 2020, Proceedings, Part I |
Redacteuren | Armin Biere, David Parker |
Uitgeverij | Springer |
Pagina's | 346-364 |
Aantal pagina's | 19 |
Volume | 12078 |
ISBN van elektronische versie | 978-3-030-45190-5 |
ISBN van geprinte versie | 978-3-030-45189-9 |
DOI's | |
Status | Published - 17 apr 2020 |
Evenement | European Joint Conferences on Theory and Practice of Software: Tools and Algorithms for the Construction and Analysis of Systems - Dublin, Ireland Duur: 25 apr 2020 → 30 apr 2020 Congresnummer: 26 https://etaps.org/ |
Publicatie series
Naam | Lecture Notes in Computer Science |
---|---|
Uitgeverij | Springer |
Conference
Conference | European Joint Conferences on Theory and Practice of Software |
---|---|
Verkorte titel | ETAPS 2020 |
Land | Ireland |
Stad | Dublin |
Periode | 25/04/20 → 30/04/20 |
Internet adres |