Decision diagrams for the exact solution of Markov models
Andrew S. Miner · PAMM · 2007
Abstract High‐level models of asynchronous systems can easily produce large Markov chains, whose solution is desired to determine performance measures about the system. Although these Markov chains are typically quite sparse, they can still require an excessive amount of storage space if a traditional, sparse matrix representation is used. This article surveys compact data structures that can be used to generate and store extremely large Markov chains corresponding to a high‐level description. (© 2008 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)