Stochastic Automata Networks and Near Complete Decomposability
From MaRDI portal
Publication:2784367
DOI10.1137/S089547980036975XzbMath0992.60078MaRDI QIDQ2784367
Jean-Michel Fourneau, Tuǧrul Dayar, Oleg Gusak
Publication date: 23 April 2002
Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)
Computational methods for sparse matrices (65F50) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Iterative numerical methods for linear systems (65F10) Continuous-time Markov processes on discrete state spaces (60J27)
Related Items (5)
Convergence of multi-level iterative aggregation-disaggregation methods ⋮ Product Form Steady-State Distribution for Stochastic Automata Networks with Domino Synchronizations ⋮ Aggregation of stochastic automata networks with replicas ⋮ Discrete time queueing networks with product form steady state. Availability and performance analysis in an integrated model ⋮ Lumpable continuous-time stochastic automata networks.
Uses Software
This page was built for publication: Stochastic Automata Networks and Near Complete Decomposability