Abstract
Exact and ordinary lumpability in finite Markov chains is considered. Both concepts naturally define an aggregation of the Markov chain yielding an aggregated chain that allows the exact determination of several stationary and transient results for the original chain. We show which quantities can be determined without an error from the aggregated process and describe methods to calculate bounds on the remaining results. Furthermore, the concept of lumpability is extended to near lumpability yielding approximative aggregation.
Publisher
Cambridge University Press (CUP)
Subject
Statistics, Probability and Uncertainty,General Mathematics,Statistics and Probability
Cited by
33 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. A Formal Framework of Model and Logical Embeddings for Verification of Stochastic Systems;Proceedings of the 39th ACM/SIGAPP Symposium on Applied Computing;2024-04-08
2. Algorithmic Minimization of Uncertain Continuous-Time Markov Chains;IEEE Transactions on Automatic Control;2023-11
3. Minimization of Dynamical Systems over Monoids;2023 38th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS);2023-06-26
4. Mode Reduction for Markov Jump Systems;IEEE Open Journal of Control Systems;2022
5. Adaptive formal approximations of Markov chains;Performance Evaluation;2021-07