{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,9]],"date-time":"2025-03-09T08:40:26Z","timestamp":1741509626860,"version":"3.38.0"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642232169"},{"type":"electronic","value":"9783642232176"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-23217-6_1","type":"book-chapter","created":{"date-parts":[[2011,8,25]],"date-time":"2011-08-25T13:14:02Z","timestamp":1314278042000},"page":"1-16","source":"Crossref","is-referenced-by-count":0,"title":["Carrying Probabilities to the Infinite World"],"prefix":"10.1007","author":[{"given":"Parosh Aziz","family":"Abdulla","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"4","key":"1_CR1","doi-asserted-by":"publisher","first-page":"457","DOI":"10.2178\/bsl\/1294171129","volume":"16","author":"P.A. Abdulla","year":"2010","unstructured":"Abdulla, P.A.: Well (and better) quasi-ordered transition systems. Bulletin of Symbolic Logic\u00a016(4), 457\u2013515 (2010)","journal-title":"Bulletin of Symbolic Logic"},{"key":"1_CR2","doi-asserted-by":"crossref","unstructured":"Abdulla, P.A., \u010cer\u0101ns, K., Jonsson, B., Tsay, Y.-K.: General decidability theorems for infinite-state systems. In: Proc. LICS 1996, 11th IEEE Int. Symp. on Logic in Computer Science, pp. 313\u2013321 (1996)","DOI":"10.1109\/LICS.1996.561359"},{"key":"#cr-split#-1_CR3.1","doi-asserted-by":"crossref","unstructured":"Abdulla, P.A., Henda, N.B., Mayr, R.: Decisive markov chains. Logical Methods in Computer Science (2007);","DOI":"10.2168\/LMCS-3(4:7)2007"},{"key":"#cr-split#-1_CR3.2","unstructured":"A Preliminary Version appeared in Proc. LICS 2005"},{"key":"1_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1007\/11901914_5","volume-title":"Automated Technology for Verification and Analysis","author":"P.A. Abdulla","year":"2006","unstructured":"Abdulla, P.A., Ben Henda, N., Mayr, R., Sandberg, S.: Eager markov chains. In: Graf, S., Zhang, W. (eds.) ATVA 2006. LNCS, vol.\u00a04218, pp. 24\u201338. Springer, Heidelberg (2006)"},{"key":"1_CR5","doi-asserted-by":"crossref","unstructured":"Abdulla, P.A., Henda, N.B., Mayr, R., Sandberg, S.: Limiting behavior of Markov chains with eager attractors. In: D\u2019Argentio, P.R., Milner, A., Rubino, G. (eds.) 3rd International Conference on the Quantitative Evaluation of SysTems (QEST), pp. 253\u2013262 (2006)","DOI":"10.1109\/QEST.2006.24"},{"issue":"6","key":"1_CR6","doi-asserted-by":"publisher","first-page":"524","DOI":"10.1109\/TSE.2003.1205180","volume":"29","author":"C. Baier","year":"2003","unstructured":"Baier, C., Haverkort, B.R., Hermanns, H., Katoen, J.-P.: Model-checking algorithms for continuous-time markov chains. IEEE Trans. Software Eng.\u00a029(6), 524\u2013541 (2003)","journal-title":"IEEE Trans. Software Eng."},{"issue":"4","key":"1_CR7","doi-asserted-by":"publisher","first-page":"857","DOI":"10.1145\/210332.210339","volume":"42","author":"C. Courcoubetis","year":"1995","unstructured":"Courcoubetis, C., Yannakakis, M.: The complexity of probabilistic verification. Journal of the ACM\u00a042(4), 857\u2013907 (1995)","journal-title":"Journal of the ACM"},{"key":"1_CR8","doi-asserted-by":"publisher","first-page":"413","DOI":"10.2307\/2370405","volume":"35","author":"L.E. Dickson","year":"1913","unstructured":"Dickson, L.E.: Finiteness of the odd perfect and primitive abundant numbers with n distinct prime factors. Amer. J. Math.\u00a035, 413\u2013422 (1913)","journal-title":"Amer. J. Math."},{"key":"1_CR9","doi-asserted-by":"crossref","unstructured":"Esparza, J., Ku\u010dera, A., Mayr, R.: Model checking probabilistic pushdown automata. In: Proc. LICS 2004, 20th IEEE Int. Symp. on Logic in Computer Science, pp. 12\u201321 (2004)","DOI":"10.1109\/LICS.2004.1319596"},{"key":"1_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"340","DOI":"10.1007\/978-3-540-31856-9_28","volume-title":"STACS 2005","author":"K. Etessami","year":"2005","unstructured":"Etessami, K., Yannakakis, M.: Recursive markov chains, stochastic grammars, and monotone systems of nonlinear equations. In: Diekert, V., Durand, B. (eds.) STACS 2005. LNCS, vol.\u00a03404, pp. 340\u2013352. Springer, Heidelberg (2005)"},{"key":"1_CR11","doi-asserted-by":"crossref","unstructured":"Huth, M., Kwiatkowska, M.: Quantitative analysis and model checking. In: Proc. LICS 1997, 12th IEEE Int. Symp. on Logic in Computer Science, pp. 111\u2013122 (1997)","DOI":"10.1109\/LICS.1997.614940"},{"key":"1_CR12","doi-asserted-by":"crossref","unstructured":"Vardi, M.: Automatic verification of probabilistic concurrent finite-state programs. In: Proc. FOCS 1985, 26th Annual Symp. Foundations of Computer Science, pp. 327\u2013338 (1985)","DOI":"10.1109\/SFCS.1985.12"}],"container-title":["Lecture Notes in Computer Science","CONCUR 2011 \u2013 Concurrency Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-23217-6_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,9]],"date-time":"2025-03-09T08:20:45Z","timestamp":1741508445000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-23217-6_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642232169","9783642232176"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-23217-6_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}