Moments' analysis in homogeneous Markov reward models (Q1041298): Difference between revisions
From MaRDI portal
Removed claims |
Changed an Item |
||
Property / author | |||
Property / author: Francois Castella / rank | |||
Normal rank | |||
Property / author | |||
Property / author: Bruno Sericola / rank | |||
Normal rank | |||
Property / reviewed by | |||
Property / reviewed by: Zoran Vondraček / rank | |||
Normal rank |
Revision as of 16:05, 10 February 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Moments' analysis in homogeneous Markov reward models |
scientific article |
Statements
Moments' analysis in homogeneous Markov reward models (English)
0 references
2 December 2009
0 references
Let \(X=(X_t:\, t\geq 0)\) be a continuous-time Markov process with finite state space \(S\), and let \(f:S\to \mathbb{R}\) be a reward function. The (normalized) accumulated reward over time interval \((0,t)\) is defined by \[ Y_t=\frac{1}{t\|f\|_{\infty}} \int_0^t f(X_s)\, ds\, . \] This paper deals with numerical computation of the moments of \(Y_t\). The proposed algorithm depends on the uniformization method which reduces the computation of moments to computation of certain coefficients \(U_i(n,r)\). By analyzing convergence of those coefficients as \(n\to \infty\) (\textit{stationarity detection}), the authors derive an improved procedure for the numerical computation of first moments. The paper concludes with an example dealing with fault-tolerant multiprocessor system.
0 references
Markov models
0 references
accumulated reward
0 references
performability
0 references
uniformization
0 references