Lumpable continuous-time stochastic automata networks.
type: Item
instance of: scholarly article
title: Lumpable continuous-time stochastic automata networks.
zbMATH Open document ID: 1035.90012
DOI: 10.1016/S0377-2217(02)00431-9
author: Oleg Gusak
author: Jean-Michel Fourneau
author: Tuugrul Dayar
published in: European Journal of Operational Research
publication date: 2003-06-09T00:00:00Z
Mathematics Subject Classification ID: 90B15
zbMATH DE Number: 1924676
zbMATH Keywords: Markov processes
zbMATH Keywords: Stochastic automata networks
zbMATH Keywords: Ordinary lumpability
zbMATH Keywords: Aggregation with iterative disaggregation
describes a project that uses: MARCA
describes a project that uses: PEPS
MaRDI profile type: Publication
cites work: Exact and ordinary lumpability in finite Markov chains
cites work: Q5687214
cites work: An Aggregation/Disaggregation Algorithm for Stochastic Automata Networks
cites work: Exact performance equivalence: An equivalence relation for stochastic automata
cites work: Complexity of Memory-Efficient Kronecker Operations with Applications to the Solution of Markov Models
cites work: Multilevel solutions for structured Markov chains
cites work: Circulant preconditioners for stochastic automata networks
cites work: Q3619797
cites work: Kronecker products and shuffle algebra
cites work: On the Effects of Using the Grassmann–Taksar–Heyman Method in Iterative Aggregation–Disaggregation
cites work: Comparison of Partitioning Techniques for Two-Level Iterative Solvers on Large, Sparse Markov Chains
cites work: Superposed stochastic automata: a class of stochastic Petri nets with parallel solution and distributed state space
cites work: Efficient descriptor-vector multiplications in stochastic automata networks
cites work: Q5687215
cites work: Stochastic automata networks and near complete decomposability
cites work: Q3262596
cites work: Q4309415
cites work: Q4324960
cites work: The numerical solution of stochastic automata networks
cites work: Iterative methods based on splittings for stochastic automata networks
full work available at URL: s0377-2217(02)00431-9
OpenAlex ID: W2003706246
Recommended article: Q4945339
Recommended article: Q4781774
Recommended article: Stochastic automata networks and near complete decomposability
Recommended article: An iterative bounding method for stochastic automata networks
Recommended article: The numerical solution of stochastic automata networks
Recommended article: An Aggregation/Disaggregation Algorithm for Stochastic Automata Networks
description: scientific article; zbMATH DE number 1924676