Algorithm for computing transition probability between components in Internetware

Effective acquisition of transition probability matrix is directly related to Internetware reliability computation. The characteristics of Markov chain in Internetware are discussed and analyzed, the construction of Markov chain and the acquisition of transition probability of Internetware are studied, the Internetware model based on Markov chain is constructed. Quantitative calculation method of transition probability based on the smallest quadratic difference is presented by using the occupancy of component executing the transition as the sample statistics to calculate transition probability. The approximation algorithm for computing transition probability matrix based on the modified projection gradient is designed, and it effectively guarantees the transition law of Markov chain and the characteristics of transition probability matrix. The experiment proves that the presented method and the designed algorithm can effectively compute transition probability matrix with great value in Internetware reliability computation.

[1]  Scott D. Grimshaw,et al.  Markov chain models for delinquency: Transition matrix estimation and forecasting , 2011 .

[2]  Gang Wang,et al.  Bayesian estimation of transition probabilities in hybrid systems via convex optimization , 2008, 2008 IEEE International Conference on Acoustics, Speech and Signal Processing.

[3]  H H Asada,et al.  Estimation of state-transition probability matrices in asynchronous population Markov processes , 2010, Proceedings of the 2010 American Control Conference.

[4]  Michael A. McCarthy,et al.  Bayesian Estimates of Transition Probabilities in Seven Small Lithophytic Orchid Populations: Maximizing Data Availability from Many Small Samples , 2014, PloS one.

[5]  Dulcy M. Abraham,et al.  Estimating Transition Probabilities in Markov Chain-Based Deterioration Models for Management of Wastewater Systems , 2006 .

[6]  Wang Yong.  Research of transition probability computation method for grid workflow , 2007 .

[7]  Arun Sharma,et al.  Reliability of component based systems: a critical survey , 2011, SOEN.

[8]  X. R. Li,et al.  Online Bayesian estimation of transition probabilities for Markovian jump systems , 2004, IEEE Transactions on Signal Processing.

[9]  Hany H. Ammar,et al.  A scenario-based reliability analysis approach for component-based software , 2004, IEEE Transactions on Reliability.

[10]  Ye Wu,et al.  An architecture-based software reliability model , 1999, Proceedings 1999 Pacific Rim International Symposium on Dependable Computing.

[11]  Wang Zuo.  A New Re-estimation Algorithm of HMM′s Transition Probability , 2001 .

[12]  Chin-Yu Huang,et al.  An Adaptive Reliability Analysis Using Path Testing for Complex Component-Based Software Systems , 2011, IEEE Transactions on Reliability.

[13]  Roger C. Cheung.  A User-Oriented Software Reliability Model , 1980, IEEE Trans. Software Eng..

[14]  Katerina Goseva-Popstojanova,et al.  Architecture-based approach to reliability assessment of software systems , 2001, Perform. Evaluation.

[15]  Shudong Sun,et al.  A Hidden Semi-Markov Model with Duration-Dependent State Transition Probabilities for Prognostics , 2014 .

[16]  Jinggang Huang,et al.  Estimating Future Transition Probabilities when the Value of Side Information Decays, with Applications to Credit Modeling , 2010 .

[17]  Francisco Blasques,et al.  Time‐Varying Transition Probabilities for Markov Regime Switching Models , 2017 .

[18]  B. Craig,et al.  Estimation of the transition matrix of a discrete-time Markov chain. , 2002, Health economics.