Stochastic Automata Networks and Lumpable Stochastic Bounds: Bounding Availability
暂无分享，去创建一个
[1] William J. Stewart,et al. Introduction to the numerical solution of Markov Chains , 1994 .
[2] W. Stewart,et al. The numerical solution of stochastic automata networks , 1995 .
[3] Marc Davio,et al. Kronecker products and shuffle algebra , 1981, IEEE Transactions on Computers.
[4] Ward Whitt,et al. Comparison methods for queues and other stochastic models , 1986 .
[5] Jean-Michel Fourneau,et al. Transforming stochastic matrices for stochastic comparison with the st-order , 2003, RAIRO Oper. Res..
[6] Pierre Semal,et al. Bounds for the Positive Eigenvectors of Nonnegative Matrices and for their Approximations by Decomposition , 1984, JACM.
[7] P. Buchholz,et al. Complexity of Kronecker Operations on Sparse Matrices with Applications to the Solution of Markov Models , 1997 .
[8] Susanna Donatelli,et al. Superposed Generalized Stochastic Petri Nets: Definition and Efficient Solution , 1994, Application and Theory of Petri Nets.
[9] John C. S. Lui,et al. Computing bounds on steady state availability of repairable computer systems , 1994, JACM.
[10] Juan A. Carrasco,et al. Bounding Steady-State Availability Models with Group Repair and Phase Type Repair Distributions , 1999, Perform. Evaluation.
[11] Gianfranco Ciardo,et al. A data structure for the efficient Kronecker solution of GSPNs , 1999, Proceedings 8th International Workshop on Petri Nets and Performance Models (Cat. No.PR00331).