HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation

Numerical Issues for Stochastic Automata Networks

Paulo Fernandes 1 Brigitte Plateau 1 William J. Stewart 1
1 APACHE - Parallel algorithms and load sharing
ID-IMAG - Informatique et Distribution, Inria Grenoble - Rhône-Alpes, UJF - Université Joseph Fourier - Grenoble 1
Abstract : In this paper we consider some numerical issues in computing solutions to networks of stochastic automata (SAN). In particular our concern is with keeping the amount of computation per iteration to a minimum, since iterative methods appear to be the most effective in determining numerical solutions. In a previous paper we presented complexity results concerning the vector-descriptor multiplication phase of the analysis. In this paper our concern is with implementation details. We experiment with the size and sparsity of individual automata; with the ordering of the automata; with the percentage and location of functional elements; with the occurrence of different types of synchronizing events and with the occurrence of cyclic dependencies within terms of the descriptor. We also consider the possible benefits of grouping many small automata in a SAN with many small automata to create an equivalent SAN having a smaller number of larger automata.
Document type :
Complete list of metadata

Contributor : Rapport de Recherche Inria Connect in order to contact the contributor
Submitted on : Wednesday, May 24, 2006 - 1:42:18 PM
Last modification on : Friday, February 4, 2022 - 3:08:53 AM
Long-term archiving on: : Sunday, April 4, 2010 - 11:57:25 PM


  • HAL Id : inria-00073761, version 1



Paulo Fernandes, Brigitte Plateau, William J. Stewart. Numerical Issues for Stochastic Automata Networks. [Research Report] RR-2938, INRIA. 1996. ⟨inria-00073761⟩



Record views


Files downloads