Dependability analysis with Markov Chains: How symmetries improve symbolic computations

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

Volumn , Issue , 2007, Pages 151-160

  McQuinn, Michael G ^a   Kemper, Peter ^b   Sanders, William H ^a  

^a University of Illinois at Urbana Champaign   (United States)

^b William and Mary   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMORPHISM GROUPS; COMPLEMENTARY METHODS; DEPENDABILITY ANALYSES; DEPENDABLE SYSTEMS; LARGE STATE SPACES; LUMPABILITY; MARKOV CHAINS; MARKOVIAN MODELS; MODEL COMPOSITIONS; PARTICULAR MATRIXES; STEADY STATES; SYMBOLIC COM-PUTATION;

DATA STRUCTURES; FILE ORGANIZATION; MARKOV PROCESSES;

TRANSIENT ANALYSIS;

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

References (17)

1. P. Buchholz. Exact and ordinaiy lumpability in finite Markov chains. J'rnl of Applied Probability, 1994.
2. G. Butler. Fundamental Algorithms for Permutation Groups. LNCS 559. Springer, 1991.
3. G. Ciardo and A. S. Miner. A data structure for the efficient Kronecker solution of GSPNs. In PNPM, 1999.
4. P. T. Darga, M. H. Liffiton, K. A. Sakallah, and I. L. Markov. Exploiting structure in symmetry generation for CNF. In Proc. of the 41st Design Automation Conference, 2004.
5. S. Derisavi, P. Kemper, and W. H. Sanders. Symbolic state-space exploration and numerical analysis of state-sharing composed models. LAA, 2004.
6. S. Derisavi, P. Kemper, and W. II. Sanders. Lumping matrix diagram representations of Markov models. In Dependable Systems and Networks, pages 742-751, 2005.
7. S. Derisavi, P. Kemper, W. H. Sanders, and T. Courtney. The Möbius state-level abstract, functional interface. Performance Evaluation, 54(2):105-128, 2003.
8. D. D. D. et al. The Möbius framework and its implementation. IEEE Trans. Softw. Eng., 2002.
9. E. A. et al. Evaluating the dependability of a LEO satellite network for scientific applications. In QEST '05, Washing-ton, DC, USA, 2005. IEEE Computer Society.
10. G. C. et al. Saturation: An efficient iteration strategy for symbolic state-space generation. LNCS, 2001.
11. P. B. et al. Kronecker based matrix representations for large Markov models. In Validation of Stochastic Systems, 2004.
12. R. Mehmood. Serial disk-based analysis of large stochastic models. In Validation of Stochastic Systems, pages 230-255, 2004.
13. A. S. Miner and D. Parker. Symbolic representations and analysis of large probabilistic systems. In Validation of Stochastic Systems, pages 296-338, 2004.
14. V.F.Nicola. Lumping in Markov reward processes. Technicalreport, IBM Res. Rep., 1989.
15. W. D. Obal II, M. G. McQuinn, and W. H. Sanders. Detecting and exploiting symmetry in discrete-state Markov models. Pacific Rim Dependable Computing, pages 26-38, 2006.
16. W. H. Sanders and J. F. Meyer. Reduced base model construction methods for stochastic activity networks. IEEE J'rnl on Selected Areas in Communications, 1991.
17. W. J. Stewart. Introduction to the Numerical Solution of Markov Chains. Princeton, 1994.