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 sets S and T of safe and terminal stack configurations, where the membership to S and T depends just on the top-of-the-stack symbol. The question is whether there is a suitable strategy such that ...Expand abstract
- Publisher copy:
- Copyright date:
If you are the owner of this record, you can report an update to it here: Report update to this record