A new class of stochastic processes--Markov skeleton processes is introduced, which have the Markov property on a series of random times. Markov skeleton processes include minimal Q processes, Doob processes, Q proces...A new class of stochastic processes--Markov skeleton processes is introduced, which have the Markov property on a series of random times. Markov skeleton processes include minimal Q processes, Doob processes, Q processes of order one, semi-Markov processes , piecewise determinate Markov processes , and the input processes, the queuing lengths and the waiting times of the system GI/G/1, as particular cases. First, the forward and backward equations are given, which are the criteria for the regularity and the formulas to compute the multidimensional distributions of the Markov skeleton processes. Then, three important cases of the Markov skeleton processes are studied: the (H, G, Π)-processes, piecewise determinate Markov skeleton processes and Markov skeleton processes of Markov type. Finally, a vast vistas for the application of the Markov skeleton processes is presented.展开更多
In this paper, we obtain the transition probability of jump chain of semi-Markov pro- cess, the distribution of sojourn time and one-dimensional distribution of semi-Markov process. Furthermore, the semi-Markov proces...In this paper, we obtain the transition probability of jump chain of semi-Markov pro- cess, the distribution of sojourn time and one-dimensional distribution of semi-Markov process. Furthermore, the semi-Markov process X（t, ω） is constructed from the semi-Markov matrix and it is proved that two definitions of semi-Markov process are equivalent.展开更多
In this article, we investigate Programming Evaluation and Review Technique networks with independently and generally distributed activity durations. For any path in this network, we select all the activities related ...In this article, we investigate Programming Evaluation and Review Technique networks with independently and generally distributed activity durations. For any path in this network, we select all the activities related to this path such that the completion time of the sub-network （only consisting of all the related activities） is equal to the completion time of this path. We use the elapsed time as the supplementary variables and model this sub-network as a Markov skeleton process, the state space is related to the subnetwork structure. Then use the backward equation to compute the distribution of the sub-network＇s completion time, which is an important rule in project management and scheduling.展开更多
文摘A new class of stochastic processes--Markov skeleton processes is introduced, which have the Markov property on a series of random times. Markov skeleton processes include minimal Q processes, Doob processes, Q processes of order one, semi-Markov processes , piecewise determinate Markov processes , and the input processes, the queuing lengths and the waiting times of the system GI/G/1, as particular cases. First, the forward and backward equations are given, which are the criteria for the regularity and the formulas to compute the multidimensional distributions of the Markov skeleton processes. Then, three important cases of the Markov skeleton processes are studied: the (H, G, Π)-processes, piecewise determinate Markov skeleton processes and Markov skeleton processes of Markov type. Finally, a vast vistas for the application of the Markov skeleton processes is presented.
基金the National Natural Science Foundation of China （No. 60574002）.
文摘In this paper, we obtain the transition probability of jump chain of semi-Markov pro- cess, the distribution of sojourn time and one-dimensional distribution of semi-Markov process. Furthermore, the semi-Markov process X（t, ω） is constructed from the semi-Markov matrix and it is proved that two definitions of semi-Markov process are equivalent.
基金supported by the National Natural Science Foundation of China(10671212,10901164,90820302)the Graduate Research Innovation Projects in Hunan Province(CX2009B020)the Graduate Degree Thesis Innovation Foundation of Central Sourth University(2009ybfz11)
文摘In this article, we investigate Programming Evaluation and Review Technique networks with independently and generally distributed activity durations. For any path in this network, we select all the activities related to this path such that the completion time of the sub-network （only consisting of all the related activities） is equal to the completion time of this path. We use the elapsed time as the supplementary variables and model this sub-network as a Markov skeleton process, the state space is related to the subnetwork structure. Then use the backward equation to compute the distribution of the sub-network＇s completion time, which is an important rule in project management and scheduling.
