Greatest fixed points of probabilistic min/max polynomial equations, and reachability for branching Markov decision processes (Q1641009): Difference between revisions
From MaRDI portal
EloiFerrer (talk | contribs) Changed label, description and/or aliases in en, and other parts |
EloiFerrer (talk | contribs) Page on [mardi] deleted: Publication:1641009 |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 14:42, 2 May 2024
No description defined
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Greatest fixed points of probabilistic min/max polynomial equations, and reachability for branching Markov decision processes |
No description defined |
Statements
Greatest fixed points of probabilistic min/max polynomial equations, and reachability for branching Markov decision processes (English)
0 references
14 June 2018
0 references
branching Markov decision processes
0 references
greatest fixed point
0 references
Bellman optimality equations
0 references
