Name
Abstract | ||
|---|---|---|
The inability to provide counterexamples for the violation of timed probabilistic reachability properties constrains the practical use of CSL model checking for continuous time Markov chains (CTMCs). Counterexamples are essential tools in determining the causes of property violations and are required during debugging. We propose the use of explicit state model checking to determine runs leading into property offending states. Since we are interested in finding paths that carry large amounts of probability mass we employ directed explicit state model checking technology to find such runs using a variety of heuristics guided search algorithms, such as Best First search and Z*. The estimates used in computing the heuristics rely on a uniformisation of the CTMC. We apply our approach to a probabilistic model of the SCSI-2 protocol. |
Year | DOI | Venue |
|---|---|---|
2005 | 10.1007/11603009_15 | FORMATS |
Keywords | Field | DocType |
explicit state model checking,practical use,probabilistic model,property violation,search algorithm,probabilistic reachability property,best first search,scsi-2 protocol,csl model checking,continuous time markov chain,model checking | Probability mass function,Search algorithm,Model checking,Computer science,Markov chain,Algorithm,Theoretical computer science,Reachability,Heuristics,Probabilistic logic,Best-first search | Conference |
Volume | ISSN | ISBN |
3829 | 0302-9743 | 3-540-30946-2 |
Citations | PageRank | References |
20 | 1.02 | 12 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Husain Aljazzar | 1 | 212 | 9.05 |
| Holger Hermanns | 2 | 3418 | 229.22 |
| Stefan Leue | 3 | 1199 | 108.55 |