Zobrazeno 1 - 1
of 1
pro vyhledávání: '"Engelen, Kasper"'
We study the complexity of reductions for weighted reachability in parametric Markov decision processes. That is, we say a state p is never worse than q if for all valuations of the polynomial indeterminates it is the case that the maximal expected w
Externí odkaz:
http://arxiv.org/abs/2305.05739