Lazy probabilistic model checking without determinisation
From MaRDI portal
Publication:5357715
DOI10.4230/LIPIcs.CONCUR.2015.354zbMath1374.68290arXiv1311.2928OpenAlexW2962806365MaRDI QIDQ5357715
Sven Schewe, Guangyuan Li, Ernst Moritz Hahn, Andrea Turrini, Li-jun Zhang
Publication date: 12 September 2017
Full work available at URL: https://arxiv.org/abs/1311.2928
Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)
Related Items (13)
Good-for-MDPs Automata for Probabilistic Analysis and Reinforcement Learning ⋮ Determinization and limit-determinization of Emerson-Lei automata ⋮ From LTL to unambiguous Büchi automata via disambiguation of alternating automata ⋮ On the power of finite ambiguity in Büchi complementation ⋮ Alternating good-for-MDPs automata ⋮ Synthesising Strategy Improvement and Recursive Algorithms for Solving 2.5 Player Parity Games ⋮ Unnamed Item ⋮ Generic Emptiness Check for Fun and Profit ⋮ Optimal Translation of LTL to Limit Deterministic Automata ⋮ Functional Encryption for Inner Product with Full Function Privacy ⋮ Identity-Based Cryptosystems and Quadratic Residuosity ⋮ Model-Free Reinforcement Learning for Stochastic Parity Games ⋮ \( \omega \)-automata
This page was built for publication: Lazy probabilistic model checking without determinisation
