Efficient computation of time-bounded reachability probabilities in uniform continuous-time Markov decision processes (Q2575731)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 2235819
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Efficient computation of time-bounded reachability probabilities in uniform continuous-time Markov decision processes |
scientific article; zbMATH DE number 2235819 |
Statements
Efficient computation of time-bounded reachability probabilities in uniform continuous-time Markov decision processes (English)
0 references
6 December 2005
0 references
Continuous-time
0 references
Markov decision process
0 references
Temporal logic
0 references
Model checking
0 references
Time-bounded reachability
0 references
0 references
0.9996907711029052
0 references
0.8477984666824341
0 references
0.8290408253669739
0 references
0.8164834380149841
0 references
0.811716616153717
0 references
