On the Complexity of Deciding fair Termination of Probabilistic Concurrent Finite-State Programs.
Louis E. RosierHsu-Chun YenPublished in: Theor. Comput. Sci. (1988)
Keyphrases
- finite state
- markov chain
- markov decision processes
- model checking
- optimal policy
- decision problems
- bayesian networks
- probabilistic context free grammars
- partially observable markov decision processes
- context free
- tree automata
- reinforcement learning
- information retrieval
- action sets
- generative model
- np hard
- vector quantizer
- completely independent