Multi-objective model checking of Markov decision processes

Logical Methods in Computer Science

Volumn 4, Issue 4, 2008, Pages

  Etessami, Kousha ^a   Kwiatkowska, Marta ^b   Vardi, Moshe Y ^c   Yannakakis, Mihalis ^d  

^a UNIVERSITY OF EDINBURGH   (United Kingdom)

^b UNIVERSITY OF OXFORD   (United Kingdom)

^c Rice University   (United States)

^d Columbia University ^*  (United States)

Author keywords

Markov Decision Processes; Model checking; Multi objective optimization

Indexed keywords

APPROXIMATE PARETO CURVE; COMPOSITIONAL REASONING; GRAPH-THEORETIC METHODS; MARKOV DECISION PROCESSES; MULTI-OBJECTIVE MODELING; MULTI-OBJECTIVE OPTIMIZATION PROBLEM; PROBABILISTIC SYSTEMS; REGULAR PROPERTIES;

ALGORITHMS; ECONOMIC AND SOCIAL EFFECTS; GRAPH THEORY; MARKOV PROCESSES; MULTIOBJECTIVE OPTIMIZATION; PROBABILITY; CURVE FITTING; DECISION MAKING; OPTIMIZATION; RANDOM PROCESSES;

MODEL CHECKING;

EID: 74549126987     PISSN: None     EISSN: 18605974     Source Type: Journal    
DOI: 10.2168/LMCS-4(4:8)2008     Document Type: Article

References (17)

1. [Car83] P. Carstensen. Complexity of some parametric integer and network programming problems. Mathematical Programming, 26(1): 64-75, 1983.
2. [Clí97] J. Clímaco, editor. Multicriteria Analysis. Springer-Verlag, 1997.
3. [CMH06] K. Chatterjee, R. Majumdar, and T. Henzinger. Markov decision processes with multiple objectives. In Proc. of 23rd Symp. on Theoretical Aspects of Computer Science, volume LNCS 3884, pages 325-336, 2006.
4. [CY95] C. Courcoubetis and M. Yannakakis. The complexity of probabilistic verification. Journal of the ACM, 42(4): 857-907, 1995.
5. [CY98] C. Courcoubetis and M. Yannakakis. Markov decision processes and regular events. IEEE Trans. on Automatic Control, 43(10): 1399-1418, 1998.
6. [DY08] I. Diakonikolas and M. Yannakakis. Succinct Approximate Convex Pareto Curves. In Proc. of ACM-SIAM Symp. on Discrete Algorithms (SODA'08), 2008.
7. [Ehr05] M. Ehrgott. Multicriteria optimization. Springer-Verlag, 2005.
8. [Fur80] N. Furukawa. Characterization of optimal policies in vector-valued Markovian decision processes. Mathematics of Operations Research, 5(2): 271-279, 1980.
9. [Gho90] M. K. Ghosh. Markov decision processes with multiple costs. Oper. Res. Lett., 9(4): 257-260, 1990.
10. [GLS93] M. Grötschel, L. Lovász, and A. Schrijver. Geometric Algorithms and Combinatorial Optimization. Springer-Verlag, 2nd edition, 1993.
11. [Hen83] M. I. Henig. Vector-valued dynamic programming. SIAM J. Control Optim., 21(3): 490-499, 1983.
12. [MS01] K. Mulmuley and P. Shah. A lower bound for the shortest path problem. J. Comput. System Sci., 63(2): 253-267, 2001.
13. [Put94] M. L. Puterman. Markov Decision Processes. Wiley, 1994.
14. [PY00] C. Papadimitriou and M. Yannakakis. On the approximability of trade-offs and optimal access of web sources. In Proc. of 41st IEEE Symp. on Foundations of Computer Science, pages 86-92, 2000.
15. [Var85] M. Vardi. Automatic verification of probabilistic concurrent finite-state programs. In Proc. of 26th IEEE FOCS, pages 327-338, 1985.
16. [Whi82] D. J. White. Multi-objective infinite-horizon discounted Markov decision processes. J. Math. Anal. Appl., 89(2): 639-647, 1982.
17. [WT98] K. Wakuta and K. Togawa. Solution procedures for multi-objective Markov decision processes. Optimization. A Journal of Mathematical Programming and Operations Research, 43(1): 29-46, 1998.