Journal article icon

Journal article

Reachability in recursive Markov decision processes.

Abstract:

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

Actions


Access Document


Publisher copy:
10.1016/j.ic.2007.09.002

Authors


More by this author
Institution:
University of Oxford
Division:
MPLS
Department:
Computer Science
Role:
Author
Journal:
Inf. Comput.
Volume:
206
Issue:
5
Pages:
520-537
Publication date:
2008-01-01
DOI:
EISSN:
1090-2651
ISSN:
0890-5401
Source identifiers:
316494
Language:
English
Keywords:
Pubs id:
pubs:316494
UUID:
uuid:1ea2fe51-e461-4fee-834b-97c1463db9cf
Local pid:
pubs:316494
Deposit date:
2013-11-16

Terms of use


Views and Downloads






If you are the owner of this record, you can report an update to it here: Report update to this record

TO TOP