The complexity of probabilistic verification
Journal of the ACM (JACM)
On the approximability of trade-offs and optimal access of Web sources
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Multicriteria Optimization
Automatic verification of probabilistic concurrent finite state programs
SFCS '85 Proceedings of the 26th Annual Symposium on Foundations of Computer Science
Markov decision processes with multiple objectives
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
Succinct approximate convex pareto curves
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II
Markov decision processes with multiple long-run average objectives
FSTTCS'07 Proceedings of the 27th international conference on Foundations of software technology and theoretical computer science
Bounded rational search for on-the-fly model checking of LTL properties
FSEN'09 Proceedings of the Third IPM international conference on Fundamentals of Software Engineering
Assume-Guarantee verification for probabilistic systems
TACAS'10 Proceedings of the 16th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Compositional reverification of probabilistic safety properties for large-scale complex IT systems
Proceedings of the 17th Monterey conference on Large-Scale Complex IT Systems: development, operation and management
An incremental verification framework for component-based software systems
Proceedings of the 16th International ACM Sigsoft symposium on Component-based software engineering
From software verification to `everyware' verification
Computer Science - Research and Development
Compositional probabilistic verification through multi-objective model checking
Information and Computation
Hi-index | 0.00 |
We study and provide efficient algorithms for multi-objective model checking problems for Markov Decision Processes (MDPs). Given an MDP, M, and given multiple linear-time (ω-regular or LTL) properties ϕi, and probabilities ri ∈ [0, 1], i = 1, . . . , k, we ask whether there exists a strategy α for the controller such that, for all i, the probability that a trajectory of M controlled by α satisfies ϕi is at least ri. We provide an algorithm that decides whether there exists such a strategy and if so produces it, and which runs in time polynomial in the size of the MDP. Such a strategy may require the use of both randomization and memory. We also consider more general multi-objective ω-regular queries, which we motivate with an application to assume-guarantee compositional reasoning for probabilistic systems. Note that there can be trade-offs between different properties: satisfying property ϕ1 with high probability may necessitate satisfying ϕ2 with low probability. Viewing this as a multi-objective optimization problem, we want information about the "trade-off curve" or Pareto curve for maximizing the probabilities of different properties. We show that one can compute an approximate Pareto curve with respect to a set of ω-regular properties in time polynomial in the size of the MDP. Our quantitative upper bounds use LP methods. We also study qualitative multi-objective model checking problems, and we show that these can be analysed by purely graph-theoretic methods, even though the strategies may still require both randomization and memory.