Finding Steady States of Communicating Markov Processes Combining Aggregation/Disaggregation with Tensor Techniques

Stochastic models for interacting processes feature a dimensionality that grows exponentially with the number of processes. This state space explosion severely impairs the use of standard methods for the numerical analysis of such Markov chains. In this work, we develop algorithms for the approximation of steady states of structured Markov chains that consider tensor train decompositions, combined with wellestablished techniques for this problem - aggregation/disaggregation techniques. Numerical experiments demonstrate that the newly proposed algorithms are efficient on the determination of the steady state of a representative set of models.


Editor(s):
Fiems, D
Paolieri, M
Platis, An
Published in:
Computer Performance Engineering, 9951, 48-62
Presented at:
13th European Performance Engineering Workshop (EPEW), Chios, GREECE, OCT 05-07, 2016
Year:
2016
Publisher:
Cham, Springer Int Publishing Ag
ISSN:
0302-9743
ISBN:
978-3-319-46433-6; 978-3-319-46432-9
Laboratories:




 Record created 2017-01-24, last modified 2018-03-17


Rate this document:

Rate this document:
1
2
3
 
(Not yet reviewed)