{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T15:08:42Z","timestamp":1742396922079,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540712084"},{"type":"electronic","value":"9783540712091"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-71209-1_13","type":"book-chapter","created":{"date-parts":[[2007,7,4]],"date-time":"2007-07-04T22:56:34Z","timestamp":1183589794000},"page":"139-154","source":"Crossref","is-referenced-by-count":17,"title":["A Symbolic Algorithm for Optimal Markov Chain Lumping"],"prefix":"10.1007","author":[{"given":"Salem","family":"Derisavi","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"13_CR1","unstructured":"B\u00f6de, E., et al.: Compositional performability evaluation for STATEMATE. In: Proc. of QEST, USA (Sep. 2006)"},{"key":"13_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"96","DOI":"10.1007\/3-540-56496-9_9","volume-title":"Computer Aided Verification","author":"A. Bouali","year":"1993","unstructured":"Bouali, A., de Simone, R.: Symbolic bisimulation minimisation. In: Probst, D.K., von Bochmann, G. (eds.) CAV 1992. LNCS, vol.\u00a0663, pp. 96\u2013108. Springer, Heidelberg (1993)"},{"issue":"8","key":"13_CR3","doi-asserted-by":"publisher","first-page":"677","DOI":"10.1109\/TC.1986.1676819","volume":"35","author":"R.E. Bryant","year":"1986","unstructured":"Bryant, R.E.: Graph-based algorithms for Boolean function manipulation. IEEE Trans. Comp.\u00a035(8), 677\u2013691 (1986)","journal-title":"IEEE Trans. Comp."},{"key":"13_CR4","doi-asserted-by":"publisher","first-page":"59","DOI":"10.2307\/3215235","volume":"31","author":"P. Buchholz","year":"1994","unstructured":"Buchholz, P.: Exact and ordinary lumpability in finite Markov chains. Journal of Applied Probability\u00a031, 59\u201374 (1994)","journal-title":"Journal of Applied Probability"},{"issue":"2","key":"13_CR5","first-page":"93","volume":"15","author":"P. Buchholz","year":"2000","unstructured":"Buchholz, P.: Efficient computation of equivalent and reduced representations for stochastic automata. Int. Journal of Comp. Sys. Sci. & Eng.\u00a015(2), 93\u2013103 (2000)","journal-title":"Int. Journal of Comp. Sys. Sci. & Eng."},{"key":"13_CR6","doi-asserted-by":"crossref","unstructured":"Ciardo, G., Miner, A.S.: A data structure for the efficient Kronecker solution of GSPNs. In: Proc. of PNPM, pp. 22\u201331 (1999)","DOI":"10.1109\/PNPM.1999.796529"},{"issue":"2-3","key":"13_CR7","first-page":"149","volume":"10","author":"E. Clarke","year":"1997","unstructured":"Clarke, E., et al.: Multiterminal binary decision diagrams: An efficient data structure for matrix representation. Formal Methods in System Design\u00a010(2-3), 149\u2013169 (1997)","journal-title":"Formal Methods in System Design"},{"key":"13_CR8","unstructured":"Derisavi, S.: Solution of Large Markov Models Using Lumping Techniques and Symbolic Data Structures. PhD thesis, U. of Illinois at Urbana-Champaign (2005)"},{"issue":"6","key":"13_CR9","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1016\/S0020-0190(03)00343-0","volume":"87","author":"S. Derisavi","year":"2003","unstructured":"Derisavi, S., Hermanns, H., Sanders, W.H.: Optimal state-space lumping in Markov chains. Information Processing Letters\u00a087(6), 309\u2013315 (2003)","journal-title":"Information Processing Letters"},{"key":"13_CR10","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1016\/j.laa.2004.01.006","volume":"386","author":"S. Derisavi","year":"2004","unstructured":"Derisavi, S., Kemper, P., Sanders, W.H.: Symbolic state-space exploration and numerical analysis of state-sharing composed models. Linear Algebra and Its Applications\u00a0386, 137\u2013166 (2004)","journal-title":"Linear Algebra and Its Applications"},{"key":"13_CR11","doi-asserted-by":"crossref","unstructured":"Derisavi, S., Kemper, P., Sanders, W.H.: Lumping matrix diagram representations of markovian models. In: Proc. of DSN, Japan, pp. 742\u2013751 (2005)","DOI":"10.1109\/DSN.2005.59"},{"key":"13_CR12","series-title":"Lecture Notes in Computer Science","volume-title":"Interactive Markov Chains","author":"H. Hermanns","year":"2002","unstructured":"Hermanns, H.: Interactive Markov Chains. LNCS, vol.\u00a02428. Springer, Heidelberg (2002)"},{"key":"13_CR13","unstructured":"Hermanns, H., Meyer-Kayser, J., Siegle, M.: Multi terminal binary decision diagrams to represent and analyse continuous time Markov chains. In: Proc. of 3rd Meeting on Numerical Solution of Markov Chains (NSMC), pp. 188\u2013207 (1999)"},{"key":"13_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1007\/3-540-48778-6_15","volume-title":"Formal Methods for Real-Time and Probabilistic Systems","author":"H. Hermanns","year":"1999","unstructured":"Hermanns, H., Siegle, M.: Bisimulation Algorithms for Stochastic Process Algebras and Their BDD-Based Implementation. In: Katoen, J.-P. (ed.) AMAST-ARTS 1999, ARTS 1999, and AMAST-WS 1999. LNCS, vol.\u00a01601, pp. 244\u2013264. Springer, Heidelberg (1999)"},{"key":"13_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1007\/11691372_29","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"A. Hinton","year":"2006","unstructured":"Hinton, A., et al.: PRISM: A tool for automatic verification of probabilistic systems. In: Hermanns, H., Palsberg, J. (eds.) TACAS 2006 and ETAPS 2006. LNCS, vol.\u00a03920, pp. 441\u2013444. Springer, Heidelberg (2006)"},{"key":"13_CR16","volume-title":"Dynamic Probabilistic Systems, Volume II: Semi-Markov and Decision Processes","author":"R.A. Howard","year":"1971","unstructured":"Howard, R.A.: Dynamic Probabilistic Systems, Volume II: Semi-Markov and Decision Processes. Wiley, New York (1971)"},{"key":"13_CR17","volume-title":"Finite Markov Chains","author":"J.G. Kemeney","year":"1960","unstructured":"Kemeney, J.G., Snell, J.L.: Finite Markov Chains. D. Van Nostrand Company, New York (1960)"},{"key":"13_CR18","series-title":"Lecture Notes in Artificial Intelligence","first-page":"234","volume-title":"Computational Intelligence","author":"M. Kwiatkowska","year":"2006","unstructured":"Kwiatkowska, M., Norman, G., Parker, D.: Symmetry reduction for probabilistic model checking. In: Huang, D.-S., Li, K., Irwin, G.W. (eds.) ICIC 2006. LNCS (LNAI), vol.\u00a04114, pp. 234\u2013248. Springer, Heidelberg (2006)"},{"issue":"3","key":"13_CR19","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1016\/0743-7315(92)90006-9","volume":"15","author":"W.H. Sanders","year":"1992","unstructured":"Sanders, W.H., Malhis, L.M.: Dependability evaluation using composed SAN-based reward models. J. of Para. and Dist. Comp.\u00a015(3), 238\u2013254 (1992)","journal-title":"J. of Para. and Dist. Comp."},{"issue":"1","key":"13_CR20","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1109\/49.64901","volume":"9","author":"W.H. Sanders","year":"1991","unstructured":"Sanders, W.H., Meyer, J.F.: Reduced base model construction methods for stochastic activity networks. IEEE J. on Selected Areas in Comm.\u00a09(1), 25\u201336 (1991)","journal-title":"IEEE J. on Selected Areas in Comm."},{"key":"13_CR21","unstructured":"Somenzi, F.: CUDD: Colorado University decision diagram package. Public software, Colorado Univeristy, Boulder, http:\/\/vlsi.colorado.edu\/~fabio\/"},{"key":"13_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"477","DOI":"10.1007\/11691372","volume-title":"Automated Technology for Verification and Analysis","author":"H. Hermanns","year":"2006","unstructured":"Hermanns, H., et al.: Sigref \u2013 A Symbolic Bisimulation Tool Box. In: Graf, S., Zhang, W. (eds.) ATVA 2006. LNCS, vol.\u00a04218, pp. 477\u2013492. Springer, Heidelberg (2006)"}],"container-title":["Lecture Notes in Computer Science","Tools and Algorithms for the Construction and Analysis of Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-71209-1_13.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,18]],"date-time":"2025-01-18T05:21:16Z","timestamp":1737177676000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-71209-1_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540712084","9783540712091"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-71209-1_13","relation":{},"subject":[]}}