Probabilistic CEGAR
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 and practical tradeoffs arise. This paper explores th...
| Main Authors: | , , |
|---|---|
| Format: | Conference item |
| Published: |
Springer Verlag
2008
|