MOVES Seminar 30 Oct 2008

Verifying Linear Real-Time Properties on CTMCs

 

Tingting Han

 

In the talk I will address the following problem: given a continuous-time Markov chain (CTMC) C, and a linear real-time property \phi, what is the probability that C satisfies \phi?  We address this question for properties stated in Metric Temporal Logic (MTL), as well as for deterministic timed automata (DTA).  An approximate algorithm for MTL model checking is provided and it is shown that CTMC model checking versus a DTA specification can be reduced to computing reachability probabilities in piecewise deterministic Markov processes (PDPs). These probabilities can be characterized as the least solution of a system of integral equations and approximated by solving a system of partial differential equations.