no code implementations • 24 Apr 2018 • Krishnendu Chatterjee, Hongfei Fu, Amir Kafshdar Goharshady, Nastaran Okati
We consider the stochastic shortest path (SSP) problem for succinct Markov decision processes (MDPs), where the MDP consists of a set of variables, and a set of nondeterministic rules that update the variables.
no code implementations • 28 Oct 2015 • Krishnendu Chatterjee, Hongfei Fu, Petr Novotny, Rouzbeh Hasheminezhad
Firstly, we show that the membership problem of LRAPP (i) can be decided in polynomial time for APP's with at most demonic non-determinism, and (ii) is NP-hard and in PSPACE for APP's with angelic non-determinism; moreover, the NP-hardness result holds already for APP's without probability and demonic non-determinism.
Logic in Computer Science Programming Languages D.2.4
