Reference
[HermannsWZ08] Probabilistic CEGAR. In CAV, pages 162-175, Springer, LNCS 5123, 2008.Downloads: pdf, bibAbstract. Counterexample-guided abstraction refinement (CEGAR) has been en vogue for the automatic verification of very large systems in the past years. When trying to apply CEGAR to the verification of probabilistic systems, various foundational questions arise. This paper explores them in the context of predicate abstraction.