{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,5]],"date-time":"2026-10-05T22:36:40Z","timestamp":1791239800951,"version":"4.1.0"},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642403125","type":"print"},{"value":"9783642403132","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-40313-2_24","type":"book-chapter","created":{"date-parts":[[2013,8,16]],"date-time":"2013-08-16T10:36:43Z","timestamp":1376649403000},"page":"254-265","source":"Crossref","is-referenced-by-count":5,"title":["Probabilistic Automata with Isolated Cut-Points"],"prefix":"10.1007","author":[{"given":"Rohit","family":"Chadha","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"A. Prasad","family":"Sistla","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mahesh","family":"Viswanathan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"24_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1007\/978-3-540-78499-9_21","volume-title":"Foundations of Software Science and Computational Structures","author":"C. Baier","year":"2008","unstructured":"Baier, C., Bertrand, N., Gr\u00f6\u00dfer, M.: On decision problems for probabilistic B\u00fcchi automata. In: Amadio, R.M. (ed.) FOSSACS 2008. LNCS, vol.\u00a04962, pp. 287\u2013301. Springer, Heidelberg (2008)"},{"key":"24_CR2","unstructured":"Baier, C., Gr\u00f6\u00dfer, M.: Recognizing \u03c9-regular languages with probabilistic automata. In: Proceedings of LICS, pp. 137\u2013146 (2005)"},{"issue":"1","key":"24_CR3","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. J. ACM\u00a059(1), 1 (2012)","journal-title":"J. ACM"},{"key":"24_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1007\/978-3-662-40087-6_6","volume-title":"GI - 4. Jahrestagung","author":"A. Bertoni","year":"1975","unstructured":"Bertoni, A.: The solution of problems relative to probabilistic automata in the frame of the formal languages theory. In: Siefkes, D. (ed.) GI 1974. LNCS, vol.\u00a026, pp. 107\u2013112. Springer, Heidelberg (1975)"},{"key":"24_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/3-540-08342-1_7","volume-title":"Automata, Languages and Programming","author":"A. Bertoni","year":"1977","unstructured":"Bertoni, A., Mauri, G., Torelli, M.: Some recursive unsolvable problems relating to isolated cutpoints in probabilistic automata. In: Salomaa, A., Steinby, M. (eds.) ICALP 1977. LNCS, vol.\u00a052, pp. 87\u201394. Springer, Heidelberg (1977)"},{"key":"24_CR6","unstructured":"Canetti, R., Cheung, L., Kaynar, D., Liskov, M., Lynch, N., Pereira, P., Segala, R.: Task-Structured Probabilistic I\/O Automata. In: Workshop on Discrete Event Systems (2006)"},{"key":"24_CR7","doi-asserted-by":"crossref","unstructured":"Chadha, R., Korthikranthi, V.A., Viswanathan, M., Agha, G., Kwon, Y.: Model checking mdps with a unique compact invariant set of distributions. In: Proceedings of QEST, pp. 121\u2013130 (2011)","DOI":"10.1109\/QEST.2011.22"},{"key":"24_CR8","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":"24_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/978-3-642-04081-8_16","volume-title":"CONCUR 2009 - Concurrency Theory","author":"R. Chadha","year":"2009","unstructured":"Chadha, R., Sistla, A.P., Viswanathan, M.: Power of randomization in automata on infinite strings. In: Bravetti, M., Zavattaro, G. (eds.) CONCUR 2009. LNCS, vol.\u00a05710, pp. 229\u2013243. Springer, Heidelberg (2009)"},{"key":"24_CR10","unstructured":"Chadha, R., Sistla, A.P., Viswanathan, M.: Model checking concurrent programs with nondeterminism and randomization. In: Proceedings of FSTTCS, pp. 364\u2013375 (2010)"},{"issue":"6","key":"24_CR11","doi-asserted-by":"publisher","first-page":"694","DOI":"10.1016\/j.ic.2009.06.006","volume":"208","author":"K. Chatzikokolakis","year":"2010","unstructured":"Chatzikokolakis, K., Palamidessi, C.: Making Random Choices Invisible to the Scheduler. Information and Computation\u00a0208(6), 694\u2013715 (2010)","journal-title":"Information and Computation"},{"key":"24_CR12","unstructured":"Cheung, L.: Reconciling Nondeterministic and Probabilistic Choices. PhD thesis, Radboud University of Nijmegen (2006)"},{"key":"24_CR13","doi-asserted-by":"crossref","unstructured":"Condon, A., Lipton, R.J.: On the complexity of space bounded interactive proofs (extended abstract). In: Proceedings of FOCS, pp. 462\u2013467 (1989)","DOI":"10.1109\/SFCS.1989.63519"},{"key":"24_CR14","unstructured":"de Alfaro, L.: The Verification of Probabilistic Systems under Memoryless Partial Information Policies is Hard. In: PROBMIV (1999)"},{"key":"24_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"527","DOI":"10.1007\/978-3-642-14162-1_44","volume-title":"Automata, Languages and Programming","author":"H. Gimbert","year":"2010","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. LNCS, vol.\u00a06199, pp. 527\u2013538. Springer, Heidelberg (2010)"},{"key":"24_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1007\/978-3-540-75454-1_14","volume-title":"Formal Modeling and Analysis of Timed Systems","author":"S. Giro","year":"2007","unstructured":"Giro, S., D\u2019Argenio, P.R.: Quantitative model checking revisited: Neither decidable nor approximable. In: Raskin, J.-F., Thiagarajan, P.S. (eds.) FORMATS 2007. LNCS, vol.\u00a04763, pp. 179\u2013194. Springer, Heidelberg (2007)"},{"issue":"02","key":"24_CR17","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1017\/S0305004100033399","volume":"54","author":"J. Hajnal","year":"1958","unstructured":"Hajnal, J., Bartlett, M.S.: Weak ergodicity in non-homogeneous markov chains. Mathematical Proceedings of the Cambridge Philosophical Society\u00a054(02), 233\u2013246 (1958)","journal-title":"Mathematical Proceedings of the Cambridge Philosophical Society"},{"key":"24_CR18","doi-asserted-by":"crossref","unstructured":"Korthikanti, V.A., Viswanathan, M., Agha, G., Kwon, Y.: Reasoning about mdps as transformers of probability distributions. In: Proceedings of QEST, pp. 199\u2013208 (2010)","DOI":"10.1109\/QEST.2010.35"},{"issue":"4","key":"24_CR19","doi-asserted-by":"publisher","first-page":"634","DOI":"10.1090\/S0002-9939-1965-0177996-8","volume":"16","author":"A. Paz","year":"1965","unstructured":"Paz, A.: Definite and quasidefinite sets of stochastic matrices. Proceedings of the American Mathematical Society\u00a016(4), 634\u2013641 (1965)","journal-title":"Proceedings of the American Mathematical Society"},{"key":"24_CR20","unstructured":"Paz, A.: Introduction to Probabilistic Automata. Academic Press (1971)"},{"issue":"3","key":"24_CR21","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.: Probabilitic automata. Information and Control\u00a06(3), 230\u2013245 (1963)","journal-title":"Information and Control"},{"issue":"5","key":"24_CR22","doi-asserted-by":"publisher","first-page":"733","DOI":"10.1090\/S0002-9939-1963-0154756-3","volume":"14","author":"J. Wolfowitz","year":"1963","unstructured":"Wolfowitz, J.: Products of indecomposable, aperiodic, stochastic matrices. Proceedings of the American Mathematical Society\u00a014(5), 733\u2013737 (1963)","journal-title":"Proceedings of the American Mathematical Society"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2013"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-40313-2_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,16]],"date-time":"2019-05-16T13:58:29Z","timestamp":1558015109000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-40313-2_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642403125","9783642403132"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-40313-2_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013]]}}}