Iterative methods based on splittings for stochastic automata networks

DOI10.1016/S0377-2217(97)00215-4zbMath0934.93061OpenAlexW2076759647WikidataQ126439235 ScholiaQ126439235MaRDI QIDQ1303716

Ertuǧrul Uysal, Tuǧrul Dayar

Publication date: 11 November 1999

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0377-2217(97)00215-4

zbMATH Keywords

iterative methodssplittingsmodelstochastic automata networks

Mathematics Subject Classification ID

Stochastic systems in control theory (general) (93E03)

Related Items (7)

Formal techniques for performance analysis: blending SAN and PEPA ⋮ Block SOR for Kronecker structured representations ⋮ Algorithms for an irreducible and lumpable strong stochastic bound ⋮ Kronecker representation and decompositional analysis of closed queueing networks with phase-type service distributions and arbitrary buffer sizes ⋮ Multigrid Methods for Tensor Structured Markov Chains with Low Rank Approximation ⋮ Lumpable continuous-time stochastic automata networks. ⋮ Limitations of learning in automata-based systems

Uses Software

• PEPS

Cites Work

• Unnamed Item
• The numerical solution of stochastic automata networks
• An efficient two-stage iterative method for the steady-state analysis of Markov regenerative stochastic Petri net models
• Efficient descriptor-vector multiplications in stochastic automata networks
• Kronecker products and shuffle algebra
• THE ARITHMETIC MEAN METHOD FOR FINDING THE STATIONARY VECTOR OF MARKOV CHAINS

This page was built for publication: Iterative methods based on splittings for stochastic automata networks