MOVES-Seminar, 21. Feb 2008, 14:00

Berteun Damman

 

Representing PCTL Counterexamples

 

 

Abstract:

 

Generating counterexamples is a major strength of model checking. Only
recently algorithms for finding counterexamples in Probabilistic CTL
have been developed. Whereas counterexamples for CTL, for some
formulae, consist of a stringle trace, probabilistic CTL requires a
set of traces to show that a property is violated.

In my thesis, and in this talk, I shall treat the implementation of
these algorithms, and discuss the size of some counterexamples found
in case studies and some techniques that can be used to reduce the
size of the counterexamples and to represent them in a compact
fashion.