Reachability in recursive Markov decision processes.
We consider a class of infinite-state Markov decision processes generated by stateless pushdown automata. This class corresponds to 1 frac(1, 2)-player games over graphs generated by BPA systems or (equivalently) 1-exit recursive state machines. An extended reachability objective is specified by two...
| Main Authors: | , , , |
|---|---|
| Format: | Journal article |
| Language: | English |
| Published: |
2008
|