Counterexample explanation by learning small strategies in Markov decision processes
From MaRDI portal
Publication:1702916
DOI10.1007/978-3-319-21690-4_10zbMath1381.68104arXiv1502.02834OpenAlexW1554774506MaRDI QIDQ1702916
Andreas Fellner, Krishnendu Chatterjee, Martin Chmelík, Jan Křetínský, Tomáš Brázdil
Publication date: 1 March 2018
Full work available at URL: https://arxiv.org/abs/1502.02834
Computational learning theory (68Q32) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)
Related Items
Farkas Certificates and Minimal Witnesses for Probabilistic Reachability Constraints, Symbolic verification and strategy synthesis for turn-based stochastic games, Natural strategic ability