Signature-based symbolic algorithm for optimal Markov chain lumping

Proceedings - 4th International Conference on the Quantitative Evaluation of Systems, QEST 2007

Volumn , Issue , 2007, Pages 141-150

  Derisavi, Salem ^a  

^a CARLETON UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

EXPLICIT ALGORITHMS; LUMPABILITY; MARKOV CHAINS; PROBABILISTIC BISIMULATION; RUNNING TIMES; SPACE EXPLOSIONS; SPACE REQUIREMENTS; STATE SPACES; SYMBOLIC ALGORITHMS; SYMBOLIC OPERATIONS; VARIOUS CONFIGURATIONS; WORST CASES;

MARKOV PROCESSES;

EID: 47949107818     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/QEST.2007.43     Document Type: Conference Paper

References (25)

1. S. Blom and S. Orzan. Distributed branching bisimulation reduction of state spaces. In Parallel and Distributed Model Checking, volume 89 of ENTCS, pages 99-113, 2003.
2. A. Bouali and R. de Simone. Symbolic bisimulation minimisation. In Proc. of CAV, volume 663 of LNCS, pages 96-108. Springer, 1992.
3. R. E. Bryant. Graph-based algorithms for Boolean function manipulation. IEEE Trans. Comp., 35(8):677-691, Aug. 1986.
4. P. Buchholz. Exact and ordinary lumpability in finite Markov chains. Journal of App. Prob., 31:59-74, 1994.
5. P. Buchholz. Equivalence relations for stochastic automata networks. InW. J. Stewart, editor, Computation with Markov Chains, pages 197-216. Kluwer Int. Publishers, 1995.
6. P. Buchholz. Efficient computation of equivalent and reduced representations for stochastic automata. Int. Journal of Comp. Sys. Sci. & Eng., 15(2):93-103, 2000.
7. G. Ciardo and A. S. Miner. A data structure for the efficient Kronecker solution of GSPNs. In Proc. of PNPM, pages 22-31, 1999.
8. E. Clarke, M. Fujita, P. McGeer, K. McMillan, J. Yang, and X. Zhao. Multiterminal binary decision diagrams: An efficient data structure for matrix representation. Formal Methods in System Design, 10(2/3): 149-169, 1997.
9. S. Derisavi. Solution of Large Markov Models Using Lumping Techniques and Symbolic Data Structures. PhD thesis, U. of Illinois at Urbana-Champaign, 2005.
10. S. Derisavi. A symbolic algorithm for optimal Markov chain lumping. In Proc. of 13th Int. Conf. on TACAS, volume 4424 of LNCS, pages 139-154, 2007.
11. S. Derisavi, H. Hermanns, and W. H. Sanders. Optimal state-space lumping in Markov chains. Information Processing Letters, 87(6):309-315, September 2003.
12. S. Derisavi, P. Kemper, and W. H. Sanders. Symbolic state-space exploration and numerical analysis of state-sharing composed models. Linear Algebra and Its Applications, 386:137-166, July 15, 2004.
13. S. Derisavi, P. Kemper, and W. H. Sanders. Lumping matrix diagram representations of Markovian models. In Proc. of DSN, pages 742-751, Yokohama, Japan, June 2005.
14. S. Gilmore, J. Hillston, and M. Ribaudo. An efficient algorithm for aggregating PEPA models. IEEE Trans. on Soft. Eng., 27(5):449-464, May 2001.
15. H. Hermanns. Interactive Markov Chains and the Quest for Quantified Quality, volume 2428 of LNCS. Springer, 2002.
16. H. Hermanns, J. Meyer-Kayser, and M. Siegle. Multi terminal binary decision diagrams to represent and analyse continuous time Markov chains. In Proc. of 3rd Meeting on NSMC, pages 188-207, 1999.
17. A. Hinton, M. Kwiatkowska, G. Norman, and D. Parker. PRISM: A tool for automatic verification of probabilistic systems. In Proc. of TACAS, volume 3920 of LNCS, pages 441-444, 2006.
18. R. A. Howard. Dynamic Probabilistic Systems, Volume II: Semi-Markov and Decision Processes. Wiley, New York, 1971.
19. O. Ibe and K. Trivedi. Stochastic petri net models of polling. systems. IEEE Journal on Selected Areas in Communications, 8(9): 1649-1657, 1990.
20. J. G. Kemeney and J. L. Snell. Finite Markov Chains. D. Van Nostrand Company, Inc., 1960.
21. M. Kwiatkowska, G. Norman, and D. Parker. Symmetry reduction for probabilistic model checking. In Proc. of CAV, volume 4114 of LNCS, pages 234-248, 2006.
22. W H. Sanders and L. M. Malhis. Dependability evaluation using composed SAN-based reward models. J. of Para. and Dist. Comp., 15(3):238-254, July 1992.
23. W H. Sanders and J. F. Meyer. Reduced base model construction methods for stochastic activity networks. IEEE J. on Selected Areas in Comm., 9(1):25-36, Jan. 1991.
24. F. Somenzi. CUDD: Colorado University decision diagram package, public software, Colorado Univeristy, Boulder, http://vlsi.colorado.edu/ fabio/.
25. R. Wimmer, M. Herbstritt, H. Hermanns, K. Strampp, and B. Becker. Sigref - a symbolic bisimulation tool box. In Proc. of ATVA, volume 4218 of LNCS, pages 477-492, Beijing, China, 2006.