The complexity of probabilistic verification
Journal of the ACM (JACM)
Markov Decision Processes: Discrete Stochastic Dynamic Programming
Markov Decision Processes: Discrete Stochastic Dynamic Programming
Rollout Algorithms for Stochastic Scheduling Problems
Journal of Heuristics
Probabilistic simulations for probabilistic processes
Nordic Journal of Computing
Symbolic Model Checking of Probabilistic Processes Using MTBDDs and the Kronecker Representation
TACAS '00 Proceedings of the 6th International Conference on Tools and Algorithms for Construction and Analysis of Systems: Held as Part of the European Joint Conferences on the Theory and Practice of Software, ETAPS 2000
Model Checking of Probabalistic and Nondeterministic Systems
Proceedings of the 15th Conference on Foundations of Software Technology and Theoretical Computer Science
PRISM 2.0: A Tool for Probabilistic Model Checking
QEST '04 Proceedings of the The Quantitative Evaluation of Systems, First International Conference
Approximate Satisfiability and Equivalence
LICS '06 Proceedings of the 21st Annual IEEE Symposium on Logic in Computer Science
APMC 3.0: Approximate Verification of Discrete and Continuous Time Markov Chains
QEST '06 Proceedings of the 3rd international conference on the Quantitative Evaluation of Systems
Monte-Carlo algorithms for enumeration and reliability problems
SFCS '83 Proceedings of the 24th Annual Symposium on Foundations of Computer Science
Automatic verification of probabilistic concurrent finite state programs
SFCS '85 Proceedings of the 26th Annual Symposium on Foundations of Computer Science
Statistic Analysis for Probabilistic Processes
LICS '09 Proceedings of the 2009 24th Annual IEEE Symposium on Logic In Computer Science
Distribution, Approximation and Probabilistic Model Checking
Electronic Notes in Theoretical Computer Science (ENTCS)
Three High Performance Architectures in the Parallel APMC Boat
PDMC-HIBI '10 Proceedings of the 2010 Ninth International Workshop on Parallel and Distributed Methods in Verification, and Second International Workshop on High Performance Computational Systems Biology
PRISM: a tool for automatic verification of probabilistic systems
TACAS'06 Proceedings of the 12th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Combining model checking and testing with an application to reliability prediction and distribution
Proceedings of the 2013 International Symposium on Software Testing and Analysis
| Hi-index | 0.00 |
We study the planning and verification problems for very large or infinite probabilistic systems, like Markov Decision Processes (MDPs), from a complexity point of view. More precisely, we deal with the problem of designing an efficient approximation method to compute a near-optimal policy for the planning problem of MDPs and the satisfaction probabilities of interesting properties like reachability or safety, over the Markov chain obtained by restricting the MDP to the near-optimal policy. The complexity of the approximation method is independent of the size of the state space and uses only a probabilistic generator of the MDP.