scientific article; zbMATH DE number 1424146
A stochastic automata network (SAN) consists of a number of individual stochastic automata that operate in a (more or less) independent manner. Each individual automaton is represented by a number of states and rules and the state of the SAN at a certain time is given by the state of its constituent automata at that time. The use of SANs becomes increasingly important in performance modelling problems related to parallel and distributed computer systems. SAN formalism provides an appropriate alternative to stochastic Petri nets and Markov chain theories. The present paper is devoted to the introduction and analysis of SANs and of the related concept of stochastic process algebras, on one hand, and to numerical issues of computation time and memory requirements in computing stationary distributions by means of iterative methods, on the other hand. Sections 2-4 contain an informal presentation of SANs and tensor algebra. In section 5, a number of sufficient conditions that ensure the existence of product forms of SANs are given. Sections 6-10 investigate suitable numerical iterative methods to compute the SAN stationary distributions. Vector-descriptor multiplications (section 6) and generalized tensor products (section 7) are presented. Section 8 discusses the applicability of the multiplication theorems, section 9 examines the trade-off between memory and CPU-time SAN approach to gain performance, and section 10 deals with numerical solution methods. For the entire collection see [Zbl 0929.00017].
- Dynamics of positive automata networks
- Iterative methods based on splittings for stochastic automata networks
- The numerical solution of stochastic automata networks
- Aggregation of stochastic automata networks with replicas
- Lumpable continuous-time stochastic automata networks.
- Multigrid methods combined with low-rank approximation for tensor-structured Markov chains
- Low-rank tensor methods for Markov chains with applications to tumor progression models
- Phase-type distributions in stochastic automata networks
- Stochastic automata networks and near complete decomposability
- Multigrid methods for tensor structured Markov chains with low rank approximation
- AutoCAT: automated product-form solution of stochastic models
- Modelling of biochemical reactions by stochastic automata networks
- Efficient descriptor-vector multiplications in stochastic automata networks
- Computational Probability for Systems Biology
- Product Form Steady-State Distribution for Stochastic Automata Networks with Domino Synchronizations
- An order parameter for networks of automata
- Superposed stochastic automata: a class of stochastic Petri nets with parallel solution and distributed state space
- Effects of reordering and lumping in the analysis of discrete-time SANs
- Stochastic activity networks: Formal definitions and concepts
- scientific article; zbMATH DE number 1827972 (Why is no real title available?)
- An iterative bounding method for stochastic automata networks
- Kronecker-Based Infinite Level-Dependent QBD Processes
- scientific article; zbMATH DE number 7204953 (Why is no real title available?)
- Euro-Par 2004 Parallel Processing
- An Aggregation/Disaggregation Algorithm for Stochastic Automata Networks
- scientific article; zbMATH DE number 956807 (Why is no real title available?)
- scientific article; zbMATH DE number 956808 (Why is no real title available?)
- The Kronecker product and stochastic automata networks
- Quasi-orthogonalization for alternating non-negative tensor factorization
- Performance paradox of dynamic matching models under greedy policies
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4945339)
