[HermannsWZ08] Probabilistic CEGAR Hermanns, H.; Wachter, B. and Zhang, L. In Computer Aided Verification, 20th International Conference (CAV), pages 162-175, Springer, Lecture Notes in Computer Science 5123, 2008.
Downloads: pdf, bibURL: Abstract. 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.