Approximate steady-state analysis of large Markov models based on the structure of their decision diagram encoding

被引:12
|
作者
Wan, Min [1 ]
Ciardo, Gianfranco [1 ]
Miner, Andrew S. [2 ]
机构
[1] Univ Calif Riverside, Dept Comp Sci & Engn, Riverside, CA 92521 USA
[2] Iowa State Univ, Dept Comp Sci, Ames, IA USA
基金
美国国家科学基金会;
关键词
Markov chains; Decision diagrams; Steady-state analysis; Approximation; Aggregation; GENERATION; SATURATION;
D O I
10.1016/j.peva.2011.02.005
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
We propose a new approximate numerical algorithm for the steady-state solution of general structured ergodic Markov models. The approximation uses a state-space encoding based on multiway decision diagrams and a transition rate encoding based on a new class of edge-valued decision diagrams. The new method retains the favorable properties of a previously proposed Kronecker-based approximation, while eliminating the need for a Kronecker-consistent model decomposition. Removing this restriction allows for a greater utilization of event locality, which facilitates the generation of both the state-space and the transition rate matrix, thus extends the applicability of this algorithm to larger and more complex models. (C) 2011 Elsevier B.V. All rights reserved.
引用
收藏
页码:463 / 486
页数:24
相关论文
共 50 条