Model Checking of Continuous-Time Markov Chains Against Timed Automata Specifications

Details Model Checking of Continuous-Time Markov Chains Against Timed Automata Specifications Model Checking of Continuous-Time Markov Chains Against Timed Automata Specifications

2011-01-19

arxiv.org/abs/1101.3694v2

LMCS 7 (1:12) 2011

Computer Science

Logic in Computer Science

Scientific paper

10.2168/LMCS-7(1:12)2011

We study the verification of a finite continuous-time Markov chain (CTMC) C against a linear real-time specification given as a deterministic timed automaton (DTA) A with finite or Muller acceptance conditions. The central question that we address is: what is the probability of the set of paths of C that are accepted by A, i.e., the likelihood that C satisfies A? It is shown that under finite acceptance criteria this equals the reachability probability in a finite piecewise deterministic Markov process (PDP), whereas for Muller acceptance criteria it coincides with the reachability probability of terminal strongly connected components in such a PDP. Qualitative verification is shown to amount to a graph analysis of the PDP. Reachability probabilities in our PDPs are then characterized as the least solution of a system of Volterra integral equations of the second type and are shown to be approximated by the solution of a system of partial differential equations. For single-clock DTA, this integral equation system can be transformed into a system of linear equations where the coefficients are solutions of ordinary differential equations. As the coefficients are in fact transient probabilities in CTMCs, this result implies that standard algorithms for CTMC analysis suffice to verify single-clock DTA specifications.

Affiliated with

Also associated with

No associations

Rating

Model Checking of Continuous-Time Markov Chains Against Timed Automata Specifications does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Model Checking of Continuous-Time Markov Chains Against Timed Automata Specifications, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Model Checking of Continuous-Time Markov Chains Against Timed Automata Specifications will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-157000