Using Semi-Markov Chains to Solve Semi-Markov Processes

This article provides a novel method to solve continuous-time semi-Markov processes by algorithms from discrete-time case, based on the fact that the Markov renewal function in discrete-time case is a finite series. Bounds of approximate errors due to discretization for the transition function matrix of the continuous-time semi-Markov process are investigated. This method is applied to a reliability problem which refers to the availability analysis of the system subject to sequential cyber-attacks. Two cases where sojourn times follow exponential and Weibull distributions are considered and computed in order to verify and illustrate the proposed method.