scholar.google.com › citations
We show that the qualitative extended reachability problem is decidable in polynomial time, and that the set of all configurations for which there is a winning ...
We show that the qualitative extended reachability problem is decidable in polynomial time, and that the set of all configurations for which there is a winning ...
Reachability in Recursive Markov Decision. Processes*. Tomáš Brázdil, Václav Brozek, Vojtech Forejt, and Antonın Kucera. Faculty of Informatics, Masaryk ...
-player games over graphs generated by BPA systems or (equivalently) 1-exit recursive state machines. An extended reachability objective is specified by two ...
Reachability in recursive Markov decision processes. ... We consider a class of infinite-state Markov decision processes generated by stateless pushdown automata.
We show that the qualitative extended reachability problem is decidable in polynomial time, and that the set of all configurations for which there is a winning ...
We show that the qualitative extended reachability problem is decidable in polynomial time, and that the set of all configurations for which there is a winning ...
Reachability in Recursive Markov Decision Processes. 359 selecting outgoing transitions in the vertices of V2 and V , respectively. Player does not make a ...
-player games over graphs generated by BPA systems or (equivalently) 1-exit recursive state machines. An extended reachability objective is specified by two ...
We show that the qualitative extended reachability problem is decidable in polynomial time, and that the set of all configurations for which there is a winning ...