{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,22]],"date-time":"2025-05-22T04:36:44Z","timestamp":1747888604733,"version":"3.41.0"},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662466773"},{"type":"electronic","value":"9783662466780"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-662-46678-0_13","type":"book-chapter","created":{"date-parts":[[2015,4,1]],"date-time":"2015-04-01T13:42:21Z","timestamp":1427895741000},"page":"200-214","source":"Crossref","is-referenced-by-count":4,"title":["Decidable and Expressive Classes of Probabilistic Automata"],"prefix":"10.1007","author":[{"given":"Rohit","family":"Chadha","sequence":"first","affiliation":[]},{"given":"A. Prasad","family":"Sistla","sequence":"additional","affiliation":[]},{"given":"Mahesh","family":"Viswanathan","sequence":"additional","affiliation":[]},{"given":"Yue","family":"Ben","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"13_CR1","doi-asserted-by":"crossref","unstructured":"Baier, C., Gr\u00f6\u00dfer, M.: Recognizing \u03c9-regular languages with probabilistic automata. In: 20th IEEE Symp. on Logic in Computer Science, pp. 137\u2013146 (2005)","DOI":"10.1109\/LICS.2005.41"},{"issue":"1","key":"13_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2108242.2108243","volume":"59","author":"C. Baier","year":"2012","unstructured":"Baier, C., Gr\u00f6\u00dfer, M., Bertrand, N.: Probabilistic \u03c9-automata. Journal of the ACM\u00a059(1), 1\u201352 (2012)","journal-title":"Journal of the ACM"},{"key":"13_CR3","doi-asserted-by":"crossref","unstructured":"Chadha, R., Sistla, A.P., Viswanathan, M.: On the expressiveness and complexity of randomization in finite state monitors. Journal of the ACM\u00a056(5) (2009)","DOI":"10.1145\/1552285.1552287"},{"key":"13_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1007\/978-3-642-18275-4_9","volume-title":"Verification, Model Checking, and Abstract Interpretation","author":"R. Chadha","year":"2011","unstructured":"Chadha, R., Sistla, A.P., Viswanathan, M.: Probabilistic B\u00fcchi automata with non-extremal acceptance thresholds. In: Jhala, R., Schmidt, D. (eds.) VMCAI 2011. LNCS, vol.\u00a06538, pp. 103\u2013117. Springer, Heidelberg (2011)"},{"issue":"3","key":"13_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.2168\/LMCS-7(3:22)2011","volume":"7","author":"R. Chadha","year":"2011","unstructured":"Chadha, R., Sistla, A.P., Viswanathan, M.: Power of randomization in automata on infinite strings. Logical Methods in Computer Science\u00a07(3), 1\u201322 (2011)","journal-title":"Logical Methods in Computer Science"},{"key":"13_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-15643-4_1","volume-title":"Automated Technology for Verification and Analysis","author":"K. Chatterjee","year":"2010","unstructured":"Chatterjee, K., Henzinger, T.A.: Probabilistic automata on infinite words: Decidability and undecidability results. In: Bouajjani, A., Chin, W.-N. (eds.) ATVA 2010. LNCS, vol.\u00a06252, pp. 1\u201316. Springer, Heidelberg (2010)"},{"key":"13_CR7","doi-asserted-by":"crossref","unstructured":"Condon, A., Lipton, R.J.: On the complexity of space bounded interactive proofs (extended abstract). In: Symp. on Foundations of Computer Science, pp. 462\u2013467 (1989)","DOI":"10.1109\/SFCS.1989.63519"},{"key":"13_CR8","doi-asserted-by":"crossref","unstructured":"Fijalkow, N., Gimbert, H., Oualhadj, Y.: Deciding the value 1 problem for probabilistic leaktight automata. In: IEEE Symp. on Logic in Computer Science, pp. 295\u2013304 (2012)","DOI":"10.1109\/LICS.2012.40"},{"key":"13_CR9","doi-asserted-by":"crossref","unstructured":"Gimbert, H., Oualhadj, Y.: Probabilistic automata on finite words: Decidable and undecidable problems. In: Abramsky, S., Gavoille, C., Kirchner, C., Meyer auf der Heide, F., Spirakis, P.G. (eds.) ICALP 2010, Part II. LNCS, vol.\u00a06199, pp. 527\u2013538. Springer, Heidelberg (2010)","DOI":"10.1007\/978-3-642-14162-1_44"},{"key":"13_CR10","unstructured":"Gr\u00f6\u00dfer, M.: Reduction Methods for Probabilistic Model Checking. PhD thesis, TU Dresden (2008)"},{"key":"13_CR11","doi-asserted-by":"crossref","unstructured":"Kemeny, J., Snell, J.: Denumerable Markov Chains. Springer (1976)","DOI":"10.1007\/978-1-4684-9455-6"},{"key":"13_CR12","unstructured":"Paz, A.: Introduction to Probabilistic Automata. Academic Press (1971)"},{"issue":"3","key":"13_CR13","doi-asserted-by":"publisher","first-page":"230","DOI":"10.1016\/S0019-9958(63)90290-0","volume":"6","author":"M.O. Rabin","year":"1963","unstructured":"Rabin, M.O.: Probabilistic automata. Inf. and Control\u00a06(3), 230\u2013245 (1963)","journal-title":"Inf. and Control"},{"key":"13_CR14","doi-asserted-by":"crossref","unstructured":"Vardi, M.: Automatic verification of probabilistic concurrent finite-state programs. In: Symp. on Foundations of Computer Science, pp. 327\u2013338 (1985)","DOI":"10.1109\/SFCS.1985.12"}],"container-title":["Lecture Notes in Computer Science","Foundations of Software Science and Computation Structures"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-46678-0_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,21]],"date-time":"2025-05-21T19:57:41Z","timestamp":1747857461000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-46678-0_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783662466773","9783662466780"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-46678-0_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]}}}