Quantitative controller synthesis for consumption Markov decision processes

Jianling Fu, Cheng-Chao Huang, Yong Li, Jingyi Mei, Ming Xu, Lijun Zhang

Abstract: Highlights•We consider the quantitative reachability probability problems for consumption Markov decision processes.•We prove that the quantitative reachability probability problems are NP-hard.•We solve the synthesis problems with respect to the repeated reachability as well as the usual reachability.