Stochastic Automata Networks and Near Complete Decomposability

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)

zbMATH Keywords

Markov chains; near complete decomposability; stochastic automata networks; state classification

Mathematics Subject Classification ID

65F50: Computational methods for sparse matrices

60J10: Markov chains (discrete-time Markov processes on discrete state spaces)

65F10: Iterative numerical methods for linear systems

60J27: Continuous-time Markov processes on discrete state spaces

Related Items

Aggregation of stochastic automata networks with replicas, Lumpable continuous-time stochastic automata networks.

Uses Software

• PEPS