Efficient computation of time-bounded reachability probabilities in uniform continuous-time Markov decision processes (Q2575731): Difference between revisions
From MaRDI portal
Created a new Item |
Normalize DOI. |
||
(9 intermediate revisions by 7 users not shown) | |||
Property / DOI | |||
Property / DOI: 10.1016/j.tcs.2005.07.022 / rank | |||
Property / author | |||
Property / author: Joost-Pieter Katoen / rank | |||
Property / author | |||
Property / author: Joost-Pieter Katoen / rank | |||
Normal rank | |||
Property / describes a project that uses | |||
Property / describes a project that uses: PRISM / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2152342144 / rank | |||
Normal rank | |||
Property / Wikidata QID | |||
Property / Wikidata QID: Q57801899 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4417926 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4835250 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Model-checking continuous-time Markov chains / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Tools and Algorithms for the Construction and Analysis of Systems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: CONCUR 2003 - Concurrency Theory / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5137353 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4368722 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Uniformization for semi-Markov decision processes under stationary policies / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Model checking of probabilistic and nondeterministic systems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Sequencing Tasks with Exponential Service Times to Minimize the Expected Flow Time or Makespan / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Exact and ordinary lumpability in finite Markov chains / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Model-checking large structured Markov chains. / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4813198 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Interactive Markov chains. And the quest for quantified quality / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5820901 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4798030 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4255597 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4472227 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4315289 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4223191 / rank | |||
Normal rank | |||
Property / DBLP publication ID | |||
Property / DBLP publication ID: journals/tcs/BaierHKH05 / rank | |||
Normal rank | |||
Property / DOI | |||
Property / DOI: 10.1016/J.TCS.2005.07.022 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 08:12, 19 December 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
0 references