Lumping matrix diagram representations of markov models

Proceedings of the International Conference on Dependable Systems and Networks

Volumn , Issue , 2005, Pages 742-751

  Derisavi, Salem ^a   Kemper, Peter ^b   Sanders, William H ^a  

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

^b TU DORTMUND UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

CONTINUOUS-TIME MARKOV CHAINS (CTMC); LUMPING MATRIX DIAGRAMS; MARKOV MODELS; TANDEM MULTI-PROCESSOR SYSTEMS;

ALGORITHMS; FAILURE ANALYSIS; MARKOV PROCESSES; MATHEMATICAL MODELS; MATRIX ALGEBRA; MULTIPROCESSING SYSTEMS;

SYSTEMS ANALYSIS;

EID: 27544467971     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/DSN.2005.59     Document Type: Conference Paper

References (19)

1. A. Benoit, L. Brenner, P. Fernandes, and B. Plateau. Aggregation of stochastic automata networks with replicas. In Linear Algebra and Its Applications, 386:111-136, 2004.
2. P. Buchholz. Exact and ordinary lumpability in finite Markov chains. J. of App. Prob., 31:59-74, 1994.
3. P. Buchholz. Equivalence relations for stochastic automata networks. In W. J. Stewart, editor. Computation with Markov Chains, Kluwer, 1995.
4. G. Chiola, C. Dutheillet, G. Franceschinis, and S. Haddad. Stochastic well-formed colored nets and symmetric modeling applications. IEEE Trans. on Computers, 42(11):1343-1360, November 1993.
5. G. Ciardo, R. Marmorstein, and R. Siminiceanu. Saturation unbound. In Proc. of TACAS, LNCS 2619, pages 379-393, Springer, 2003.
6. G. Ciardo and A. Miner. A data structure for the efficient Kronecker solution of GSPNs. In Proc. of PNPM, pages 22-31, IEEE CS, 1999.
7. D. D. Deavours, G. Clark, T. Courtney, D. Daly, S. Derisavi, J. M. Doyle, W. H. Sanders, and P. G. Webster. The Möbius framework and its implementation. IEEE Trans. on Soft. Eng., 28(10):956-969, October 2002.
8. C. Delamare, Y. Gardan, and P. Moreaux. Performance evaluation with asynchronously decomposable SWN: implementation and case study. In Proc. of PNPM, pages 20-29, IEEE CS, 2003.
9. S. Derisavi, H. Hermanns, and W. H. Sanders. Optimal state-space lumping in Markov chains. Inf. Proc. Letters, 87(6):309-315, September 2003.
10. 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 2004.
11. O. Gusak, T. Dayar, and J.-M. Fourneau. Lumpable continuous-time stochastic automata networks. European J. of Operational Research, 148:436-451, 2003.
12. H. Hermanns. Interactive Markov Chains and the Quest for Quantified Quality, LNCS 2428, Springer 2002.
13. J. G. Kemeney and J. L. Snell. Finite Markov Chains. D. Van Nostrand Company, Inc., 1960.
14. M. Ajmone Marsan, G. Balbo, G. Conte, S. Donatelli, and G. Franceschinis. Modelling With Generalized Stochastic Petri Nets. John Wiley & Sons, 1995.
15. A. Miner. Efficient solution of GSPNs using canonical matrix diagams. In Proc. of PNPM, pages 101-110, IEEE CS, 2001.
16. A. Miner and D. Parker. Symbolic representations and analysis of large probabilistic systems. In Validation of Stochastic Systems: A Guide to Current Research, LNCS 2925, Springer, 2004.
17. B. Plateau and K. Atif. Stochastic automata network for modeling parallel systems. IEEE Trans. in Soft. Eng., 17(10):1093-1108, October 1991.
18. W. H. Sanders and J. F. Meyer. Reduced base model construction methods for stochastic activity networks. IEEE J. on Selected Areas in Communications, 9(1):25-36, January 1991.
19. W. H. Sanders and J. F. Meyer. Stochastic activity networks: Formal definitions and concepts. In Lectures on Formal Methods and Performance Analysis, LNCS 2090, Springer 2000.