### Abstract

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

Title of host publication | Providing evidence of likely being on time: Counterexample generation for CTMC model checking |

Editors | K. Namjoshi, T. Yoneda, T. Higashino, Y. Okamura |

Publisher | Springer |

Pages | 331-346 |

Number of pages | 16 |

ISBN (Print) | 978-3-540-75595-1 |

DOIs | |

Publication status | Published - 2007 |

### Publication series

Name | Lecture Notes in Computer Science |
---|---|

Publisher | Springer |

Number | Supplement |

Volume | 4762 |

### Keywords

- IR-62042
- EWI-11508
- METIS-245830

### Cite this

*Providing evidence of likely being on time: Counterexample generation for CTMC model checking*(pp. 331-346). [10.1007/978-3-540-75596-8_24] (Lecture Notes in Computer Science; Vol. 4762, No. Supplement). Springer. https://doi.org/10.1007/978-3-540-75596-8_24

}

*Providing evidence of likely being on time: Counterexample generation for CTMC model checking.*, 10.1007/978-3-540-75596-8_24, Lecture Notes in Computer Science, no. Supplement, vol. 4762, Springer, pp. 331-346. https://doi.org/10.1007/978-3-540-75596-8_24

**Providing evidence of likely being on time - Counterexample generation for CTMC model checking.** / Han, Tingting; Katoen, Joost P.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

TY - GEN

T1 - Providing evidence of likely being on time - Counterexample generation for CTMC model checking

AU - Han, Tingting

AU - Katoen, Joost P.

N1 - 10.1007/978-3-540-75596-8_24

PY - 2007

Y1 - 2007

N2 - Probabilistic model checkers typically provide a list of individual state probabilities on the refutation of a temporal logic formula. For large state spaces, this information is far too detailed to act as useful diagnostic feedback. For quantitative (constrained) reachability problems, sets of paths that carry enough probability mass are more adequate. We recently have shown that in the context of discrete-time probabilistic processes, such sets of smallest size can be efficiently computed by (hop-constrained) $k$-shortest path algorithms. This paper considers the problem of generating counterexamples for continuous-time Markov chains. The key contribution is a set of approximate algorithms for computing small sets of paths that indicate the violation of time-bounded (constrained) reachability probabilities.

AB - Probabilistic model checkers typically provide a list of individual state probabilities on the refutation of a temporal logic formula. For large state spaces, this information is far too detailed to act as useful diagnostic feedback. For quantitative (constrained) reachability problems, sets of paths that carry enough probability mass are more adequate. We recently have shown that in the context of discrete-time probabilistic processes, such sets of smallest size can be efficiently computed by (hop-constrained) $k$-shortest path algorithms. This paper considers the problem of generating counterexamples for continuous-time Markov chains. The key contribution is a set of approximate algorithms for computing small sets of paths that indicate the violation of time-bounded (constrained) reachability probabilities.

KW - IR-62042

KW - EWI-11508

KW - METIS-245830

U2 - 10.1007/978-3-540-75596-8_24

DO - 10.1007/978-3-540-75596-8_24

M3 - Conference contribution

SN - 978-3-540-75595-1

T3 - Lecture Notes in Computer Science

SP - 331

EP - 346

BT - Providing evidence of likely being on time: Counterexample generation for CTMC model checking

A2 - Namjoshi, K.

A2 - Yoneda, T.

A2 - Higashino, T.

A2 - Okamura, Y.

PB - Springer

ER -