_id,doi,title
14317,10.1007/978-3-031-37709-9_5,"MDPs as distribution transformers: Affine invariant synthesis for safety objectives"
14417,10.4230/LIPIcs.MFCS.2023.15,Entropic risk for turn-based stochastic games
14518,10.3233/FAIA230264,Reachability poorman discrete-bidding games
14990,10.5281/ZENODO.7548214,Artefact for: Correct Approximation of Stationary Distributions
13139,10.1007/978-3-031-30823-9_25,"Correct approximation of stationary distributions"
13967,10.1109/LICS56636.2023.10175771,Stopping criteria for value iteration on stochastic games with quantitative objectives
14259,10.1007/978-3-031-37706-8_20,"Guessing winning policies in LTL synthesis by semantic learning"
12676,10.1137/1.9781611977554.ch173,Faster algorithm for turn-based stochastic games with bounded treewidth
10602,10.1007/s00236-021-00412-y,Index appearance record with preorders
12000,10.1007/978-3-031-13185-1_4,"Sound and complete certificates for auantitative termination analysis of probabilistic programs"
12102,10.4230/LIPIcs.FSTTCS.2022.29,Algorithms and hardness results for computing cores of Markov chains
12170,10.1007/978-3-031-19992-9_20,"PET – A partial exploration tool for probabilistic verification"
12568,10.1609/aaai.v36i9.21222,Risk-aware stochastic shortest path
12775,10.4230/LIPIcs.CONCUR.2022.11,Anytime guarantees for reachability in uncountable Markov decision processes
13160,10.1007/978-3-662-54577-5_26,Index appearance record for transforming Rabin automata into parity automata