Efficient computation of time-bounded reachability probabilities in uniform continuous-time Markov decision processes (Q2575731): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: PRISM / rank | |||
Normal rank | |||
Revision as of 22:56, 29 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Efficient computation of time-bounded reachability probabilities in uniform continuous-time Markov decision processes |
scientific article |
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
