IEEE Transactions on Computers · 1996 · 65 citations · 10 references
ComputingComputer ScienceMathematicsAlgorithmsTheory Of ComputationAlgorithm AnalysisAlgorithmic ComplexityApproximation AlgorithmsComputational ComplexityTime ComplexityComplexity Of Numerical AlgorithmsExecution Time AnalysisTruncation
We propose, in this paper, a new algorithm to compute the performability distribution. Its computational complexity is polynomial and it deals only with nonnegative numbers bounded by one. This important property allows us to determine truncation steps and so to improve the execution time of the algorithm.
10
Performability analysis using semi-Markov reward processes
Gianfranco Ciardo, Raymond A. Marie, Bruno Séricola et al. · IEEE Transactions on Computers · 1990 · 151 citations