Lumpable continuous-time stochastic automata networks.
From MaRDI portal
Publication:1810536
DOI10.1016/S0377-2217(02)00431-9zbMath1035.90012OpenAlexW2003706246MaRDI QIDQ1810536
Oleg Gusak, Jean-Michel Fourneau, Tuǧrul Dayar
Publication date: 9 June 2003
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0377-2217(02)00431-9
Markov processesStochastic automata networksAggregation with iterative disaggregationOrdinary lumpability
Related Items
Block SOR for Kronecker structured representations ⋮ Aggregation of stochastic automata networks with replicas ⋮ Lumpable continuous-time stochastic automata networks. ⋮ Limitations of learning in automata-based systems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Exact performance equivalence: An equivalence relation for stochastic automata
- Iterative methods based on splittings for stochastic automata networks
- The numerical solution of stochastic automata networks
- Circulant preconditioners for stochastic automata networks
- Lumpable continuous-time stochastic automata networks.
- Multilevel Solutions for Structured Markov Chains
- Stochastic Automata Networks and Near Complete Decomposability
- Efficient descriptor-vector multiplications in stochastic automata networks
- Kronecker products and shuffle algebra
- Superposed stochastic automata: a class of stochastic Petri nets with parallel solution and distributed state space
- Exact and ordinary lumpability in finite Markov chains
- Complexity of Memory-Efficient Kronecker Operations with Applications to the Solution of Markov Models
- Comparison of Partitioning Techniques for Two-Level Iterative Solvers on Large, Sparse Markov Chains
- On the Effects of Using the Grassmann–Taksar–Heyman Method in Iterative Aggregation–Disaggregation
- An Aggregation/Disaggregation Algorithm for Stochastic Automata Networks
