Semi-Markov switches
R. L. Disney, D. C. McNickle (1985)
Applicationes Mathematicae
Similarity:
R. L. Disney, D. C. McNickle (1985)
Applicationes Mathematicae
Similarity:
Guglielmo D'Amico (2014)
Applications of Mathematics
Similarity:
Markov chain usage models were successfully used to model systems and software. The most prominent approaches are the so-called failure state models Whittaker and Thomason (1994) and the arc-based Bayesian models Sayre and Poore (2000). In this paper we propose arc-based semi-Markov usage models to test systems. We extend previous studies that rely on the Markov chain assumption to the more general semi-Markovian setting. Among the obtained results we give a closed form representation...
Giovanni Masala, Giuseppina Cannas, Marco Micocci (2014)
Biometrical Letters
Similarity:
In this paper we apply a parametric semi-Markov process to model the dynamic evolution of HIV-1 infected patients. The seriousness of the infection is rendered by the CD4+ T-lymphocyte counts. For this purpose we introduce the main features of nonhomogeneous semi-Markov models. After determining the transition probabilities and the waiting time distributions in each state of the disease, we solve the evolution equations of the process in order to estimate the interval transition probabilities....
Maria Jankiewicz (1978)
Applicationes Mathematicae
Similarity:
Christiane Cocozza-Thivent, Michel Roussignol (2010)
ESAIM: Probability and Statistics
Similarity:
We study the evolution of a multi-component system which is modeled by a semi-Markov process. We give formulas for the avaibility and the reliability of the system. In the r-positive case, we prove that the quasi-stationary probability on the working states is the normalised left eigenvector of some computable matrix and that the asymptotic failure rate is equal to the absolute value of the convergence parameter r.
Margarita Karaliopoulou (2009)
ESAIM: Probability and Statistics
Similarity:
Let a finite alphabet . We consider a sequence of letters from generated by a discrete time semi-Markov process We derive the probability of a word occurrence in the sequence. We also obtain results for the mean and variance of the number of overlapping occurrences of a word in a finite discrete time semi-Markov sequence of letters under certain conditions.
Zbyněk Šidák (1976)
Aplikace matematiky
Similarity:
D'Amico, Guglielmo, Janssen, Jacques, Manca, Raimondo (2009)
Journal of Applied Mathematics and Decision Sciences
Similarity:
Xiangxiang Huang, Yonghui Huang (2017)
Kybernetika
Similarity:
This paper deals with a first passage mean-variance problem for semi-Markov decision processes in Borel spaces. The goal is to minimize the variance of a total discounted reward up to the system's first entry to some target set, where the optimization is over a class of policies with a prescribed expected first passage reward. The reward rates are assumed to be possibly unbounded, while the discount factor may vary with states of the system and controls. We first develop some suitable...