On the Markovian Randomized Strategy of Controller for Markov Decision Processes
暂无分享,去创建一个
[1] G. Sacks. A DECISION METHOD FOR ELEMENTARY ALGEBRA AND GEOMETRY , 2003 .
[2] Wolfgang Thomas,et al. Infinite Games and Verification (Extended Abstract of a Tutorial) , 2002, CAV.
[3] Christel Baier,et al. Controller Synthesis for Probabilistic Systems , 2004, IFIP TCS.
[4] D. Grigor'ev. Complexity of deciding Tarski algebra , 1988 .
[5] Martin L. Puterman,et al. Markov Decision Processes: Discrete Stochastic Dynamic Programming , 1994 .
[6] Bengt Jonsson,et al. A logic for reasoning about time and reliability , 1990, Formal Aspects of Computing.
[7] Alex K. Simpson,et al. Computational Adequacy in an Elementary Topos , 1998, CSL.
[8] Mihalis Yannakakis,et al. The complexity of probabilistic verification , 1995, JACM.
[9] Marie-Françoise Roy,et al. On the combinatorial and algebraic complexity of Quanti erEliminationS , 1994 .
[10] Krishnendu Chatterjee,et al. Simple Stochastic Parity Games , 2003, CSL.
[11] J. Filar,et al. Competitive Markov Decision Processes , 1996 .
[12] Andrea Bianco,et al. Model Checking of Probabalistic and Nondeterministic Systems , 1995, FSTTCS.