MOVES Seminar 8 July 2010, 10:00

 

Benoit Barbot

 

Model checking of Continious-Time Markov Chains against single clock Deterministic Timed Automata

 

Abstract:

 

In this presentation we will see how to do model checking of
Continuous Time Markov Chains (CTMC) against Deterministic
Time Automaton specification (DTA).

First we will explain how to
resolve this problem in the general case, then we will look
at the case of single clock DTA specification which can be
resolved efficiently. This resolution can be speed it up
by using an adapted algorithm of Bi-simulation.
An implementation of this algorithm on different case
studies shows that this speed up is effective.

Finally we will come back to the general case which can
be resolved using a discretization of the clock value and
we will compare the result of an implementation of this
algorithm to the previous one.