Are Good-for-Games Automata Good for Probabilistic Model Checking?
From MaRDI portal
Publication:5404935
DOI10.1007/978-3-319-04921-2_37zbMath1408.68093OpenAlexW2295849114MaRDI QIDQ5404935
David Müller, Sascha Klüppelholz, Joachim Klein, Christel Baier
Publication date: 31 March 2014
Published in: Language and Automata Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-04921-2_37
Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60)
Related Items (10)
Good-for-MDPs Automata for Probabilistic Analysis and Reinforcement Learning ⋮ On Determinisation of Good-for-Games Automata ⋮ Unnamed Item ⋮ Determinization and limit-determinization of Emerson-Lei automata ⋮ Width of Non-deterministic Automata ⋮ Markov chains and unambiguous automata ⋮ Unnamed Item ⋮ Optimal Translation of LTL to Limit Deterministic Automata ⋮ Functional Encryption for Inner Product with Full Function Privacy ⋮ Büchi Good-for-Games Automata Are Efficiently Recognizable
This page was built for publication: Are Good-for-Games Automata Good for Probabilistic Model Checking?
