Simple O(m log n) time Markov chain lumping

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6015 LNCS, Issue , 2010, Pages 38-52

  Valmari, Antti ^a   Franceschinis, Giuliana ^b  

^a TAMPERE UNIVERSITY OF TECHNOLOGY   (Finland)

^b UNIVERSITY OF EASTERN PIEDMONT   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ESSENTIAL PROBLEMS; MARKOV CHAIN; NUMBER OF STATE; RUNNING TIME; SIMPLE ALGORITHM; SORTING ALGORITHM; TIME ALGORITHMS;

COMPUTER SOFTWARE; MARKOV PROCESSES; TIME MEASUREMENT; CHAINS;

ALGORITHMS;

EID: 77951558443     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-12002-2_4     Document Type: Conference Paper

References (12)

1. Aho, A.V., Hopcroft, J.E., Ullman, J.D.: The Design and Analysis of Computer Algorithms. Addison-Wesley, Reading (1974)
2. Baarir, S., Beccuti, M., Cerotti, D., De Pierro, M., Donatelli, S., Franceschinis, G.: The GreatSPN tool: recent enhancements. SIGMETRICS Performance Evaluation Review, Special Issue on Tools for Performance Evaluation 36(4), 4-9 (2009)
3. Backhouse, R.C.: Program Construction and Verification. Prentice-Hall International Series in Computer Science, UK (1986)
4. Buchholz, P.: Exact and ordinary lumpability in finite Markov chains. Journal of Appl. Prob. 31, 309-315 (1994)
5. Derisavi, S.: Solution of Large Markov Models Using Lumping Techniques and Symbolic Data Structures. Dissertation, University of Illinois at Urbana-Champaign (2005)
6. Derisavi, S., Hermanns, H., Sanders, W.H.: Optimal state-space lumping in Markov chains. Information Processing Letters 87(6), 309-315 (2003)
7. GRaphical Editor and Analyzer for Timed and Stochastic Petri Nets, http://www.di.unito.it/%7egreatspn/ (last update September 25, 2008)
8. Kemeny, J.G., Snell, J.L.: Finite Markov Chains. Springer, Heidelberg (1960)
9. Knuutila, T.: Re-describing an algorithm by Hopcroft. Theoret. Comput. Sci. 250, 333-363 (2001)
10. Paige, R., Tarjan, R.: Three partition refinement algorithms. SIAM J. Comput. 16(6), 973-989 (1987)
11. Valmari, A.: Bisimilarity minimization in O(mlog n) time. In: Franceschinis, G., Wolf, K. (eds.) PETRI NETS 2009. LNCS, vol. 5606, pp. 123-142. Springer, Heidelberg (2009)
12. Valmari, A., Lehtinen, P.: Efficient minimization of DFAs with partial transition functions. In: Albers, S., Weil, P. (eds.) STACS 2008, Symposium on Theoretical Aspects of Computer Science, Bordeaux, France, pp. 645-656 (2008), http://drops.dagstuhl.de/volltexte/2008/1328/