A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf
.
Are Good-for-Games Automata Good for Probabilistic Model Checking?
[chapter]
2014
Lecture Notes in Computer Science
The potential double exponential blow-up for the generation of deterministic ω-automata for linear temporal logic formulas motivates research on weaker forms of determinism. One of these notions is the goodfor-games property that has been introduced by Henzinger and Piterman together with an algorithm for generating good-for-games automata from nondeterministic Büchi automata. The contribution of our paper is twofold. First, we report on an implementation of this algorithms and exhaustive
doi:10.1007/978-3-319-04921-2_37
fatcat:ahxnyvpdhzb4pdq4d3dqyqkbai