Memory Efficient Iterative Methods for Stochastic Automata Networks - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Rapport (Rapport De Recherche) Année : 2001

Memory Efficient Iterative Methods for Stochastic Automata Networks

Résumé

We present new algorithms for computing the solution of large Markov chain models whose generators can be represented in the form of a generalized tensor algebra, such as networks of stochastic automata. The tensorial structure implies to work on a product space. Inside this product space, the reachable state space can be much smaller. For these cases, we propose two improvements of the standard numerical algorithm (based on tensor products), called «shuffle algorithm», that take as input-output only data structures of the size of the reachable state space. One of the improveme- nts allows a gain on the computation time, and the other one on the memory requirements. With those contributions, the numerical algorithms based on tensor products can deal with larger models.
Fichier principal
Vignette du fichier
RR-4259.pdf (561.31 Ko) Télécharger le fichier

Dates et versions

inria-00072328 , version 1 (23-05-2006)

Identifiants

  • HAL Id : inria-00072328 , version 1

Citer

Anne Benoit, Brigitte Plateau, William J. Stewart. Memory Efficient Iterative Methods for Stochastic Automata Networks. [Research Report] RR-4259, INRIA. 2001. ⟨inria-00072328⟩
118 Consultations
128 Téléchargements

Partager

Gmail Facebook X LinkedIn More