MOVES Seminar 7 Jan 2009, 11:30

 

Daniel Wagner, Imperial College London

 

Abstractions for probabilistic model checking

 

 

This talk presents some preliminary results on finitary completeness of abstractions for PCTL formulae on discrete-time Markov chains.(Finitary completeness: For all M and phi, s.t M|= phi, there exists a finite-state abstraction A of M, s.t. A|= phi.)

 

Motivated by Dams and Namjoshi's results for the mu-calculus, we define a two-player game to capture the semantics of PCTL. Winning strategies in this game already yield finite abstractions for a fragment of PCTL. Completeness for the full logic will require more expressive abstract models which are still work in progress.

 

The presented results are joint work with Michael Huth, Nir Piterman and Harald Fecher.