### Abstract

Original language | Undefined |
---|---|

Pages (from-to) | 12:1-12:34 |

Number of pages | 34 |

Journal | Logical methods in computer science |

Volume | 7 |

Issue number | 1-12 |

DOIs | |

Publication status | Published - 2011 |

### Keywords

- IR-79353
- EWI-21245

### Cite this

*Logical methods in computer science*,

*7*(1-12), 12:1-12:34. https://doi.org/10.2168/LMCS-7(1:12)2011

}

*Logical methods in computer science*, vol. 7, no. 1-12, pp. 12:1-12:34. https://doi.org/10.2168/LMCS-7(1:12)2011

**Model Checking of Continuous-Time Markov Chains Against Timed Automata Specifications.** / Chen, T.; Han, Tingting; Katoen, Joost P.; Mereacre, Alexandru.

Research output: Contribution to journal › Article › Academic › peer-review

TY - JOUR

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

AU - Chen, T.

AU - Han, Tingting

AU - Katoen, Joost P.

AU - Mereacre, Alexandru

N1 - Open Access

PY - 2011

Y1 - 2011

N2 - 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.

AB - 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.

KW - IR-79353

KW - EWI-21245

U2 - 10.2168/LMCS-7(1:12)2011

DO - 10.2168/LMCS-7(1:12)2011

M3 - Article

VL - 7

SP - 12:1-12:34

JO - Logical methods in computer science

JF - Logical methods in computer science

SN - 1860-5974

IS - 1-12

ER -