Efficient Solutions for an Approximation Technique for the Transient Analysis of Markovian Models

Rosa Carmo 1 Edmundo De Souza E Silva 1 Raymond Marie 2
2 MODEL - Modeling Random Systems
IRISA - Institut de Recherche en Informatique et Systèmes Aléatoires, INRIA Rennes
Abstract : One of the most widely used technique to obtain transient measures is the uniformization method. However, although uniformization have many advantages, the computational cost required to calculate transient probabilities are very large for stiff models. We study efficient solutions that can be applied to an approximate method developed for calculating transient state probabilities of Markov models, and cumulative expected reward measures over a finite interval. The method our work is based on, approximates the state probabilities at time t by the state probabilities calculated at a random time with Erlangian distribution. The original method requires an inversion of a matrix obtained from the state transition rate matrix, which destroys special structures such as sparseness and banded matrices. This precludes the use of the technique for large models. In our work we propose efficient solutions that can take advantage of special structures. Finally, we present examples which show that the proposed technique is computationally very efficient for stiff models when compared with uniformization.
Type de document :
[Research Report] RR-3055, INRIA. 1996
Liste complète des métadonnées

Contributeur : Rapport de Recherche Inria <>
Soumis le : mercredi 24 mai 2006 - 13:23:35
Dernière modification le : mercredi 16 mai 2018 - 11:23:03
Document(s) archivé(s) le : dimanche 4 avril 2010 - 23:52:53



  • HAL Id : inria-00073637, version 1


Rosa Carmo, Edmundo De Souza E Silva, Raymond Marie. Efficient Solutions for an Approximation Technique for the Transient Analysis of Markovian Models. [Research Report] RR-3055, INRIA. 1996. 〈inria-00073637〉



Consultations de la notice


Téléchargements de fichiers