Name
Abstract | ||
|---|---|---|
The paper introduces the concepts of long-run frequency of path properties for paths in Kripke structures, and their generalization to long-run probabilities for schedulers in Markov decision processes. We then study the natural optimization problem of computing the optimal values of these measures, when ranging over all paths or all schedulers, and the corresponding decision problem when given a threshold. The main results are as follows. For (repeated) reachability and other simple properties, optimal long-run probabilities and corresponding optimal memoryless schedulers are computable in polynomial time. When it comes to constrained reachability properties, memoryless schedulers are no longer sufficient, even in the non-probabilistic setting. Nevertheless, optimal long-run probabilities for constrained reachability are computable in pseudo-polynomial time in the probabilistic setting and in polynomial time for Kripke structures. Finally for co-safety properties expressed by NFA, we give an exponential-time algorithm to compute the optimal long-run frequency, and prove the PSPACE-completeness of the threshold problem. |
Year | DOI | Venue |
|---|---|---|
2019 | 10.1109/LICS.2019.8785672 | 2019 34th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) |
Keywords | DocType | ISSN |
run satisfaction,path properties,Kripke structures,Markov decision processes,natural optimization problem,corresponding decision problem,constrained reachability properties,pseudopolynomial time,optimal memoryless schedulers,PSPACE-completeness | Conference | 1043-6871 |
ISBN | Citations | PageRank |
978-1-7281-3609-7 | 0 | 0.34 |
References | Authors | |
16 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Christel Baier | 1 | 3053 | 185.85 |
| Nathalie Bertrand | 2 | 250 | 17.84 |
| Jakob Piribauer | 3 | 0 | 0.34 |
| Ocan Sankur | 4 | 105 | 14.76 |