{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,5]],"date-time":"2026-10-05T22:36:16Z","timestamp":1791239776682,"version":"4.1.0"},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642040801","type":"print"},{"value":"9783642040818","type":"electronic"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"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":[[2009]]},"DOI":"10.1007\/978-3-642-04081-8_16","type":"book-chapter","created":{"date-parts":[[2009,8,31]],"date-time":"2009-08-31T16:27:08Z","timestamp":1251736028000},"page":"229-243","source":"Crossref","is-referenced-by-count":17,"title":["Power of Randomization in Automata on Infinite Strings"],"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":"16_CR1","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1016\/0020-0190(85)90056-0","volume":"21","author":"B. Alpern","year":"1985","unstructured":"Alpern, B., Schneider, F.: Defining liveness. Information Processing Letters\u00a021, 181\u2013185 (1985)","journal-title":"Information Processing Letters"},{"key":"16_CR2","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":"16_CR3","doi-asserted-by":"crossref","unstructured":"Baier, C., Gr\u00f6\u00dfer, M.: Recognizing \u03c9-regular languages with probabilistic automata. In: Proceedings of the IEEE Symposium on Logic in Computer Science, pp. 137\u2013146 (2005)","DOI":"10.1109\/LICS.2005.41"},{"key":"16_CR4","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1109\/LICS.2008.42","volume-title":"LICS 2008- 23rd Annual IEEE Symposium on Logic in Computer Science","author":"R. Chadha","year":"2008","unstructured":"Chadha, R., Sistla, A.P., Viswanathan, M.: On the expressiveness and complexity of randomization in finite state monitors. In: LICS 2008- 23rd Annual IEEE Symposium on Logic in Computer Science, pp. 18\u201329. IEEE Computer Society, Los Alamitos (2008)"},{"key":"16_CR5","unstructured":"Chadha, R., Sistla, A.P., Viswanathan, M.: On the expressiveness and complexity of randomization in finite state monitors. Journal of the ACM (to appear), http:\/\/www.cs.uiuc.edu\/homes\/rch\/TechReports\/MonitoringTechReport.pdf"},{"key":"16_CR6","doi-asserted-by":"crossref","unstructured":"Condon, A., Lipton, R.J.: On the complexity of space bounded interactive proofs (extended abstract). In: 30th Annual Symposium on Foundations of Computer Science, pp. 462\u2013467 (1989)","DOI":"10.1109\/SFCS.1989.63519"},{"key":"16_CR7","unstructured":"Groesser, M.: Reduction Methods for Probabilistic Model Checking. PhD thesis, TU Dresden (2008)"},{"key":"16_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-61474-5_85","volume-title":"Computer Aided Verification","author":"G.J. Holzmann","year":"1996","unstructured":"Holzmann, G.J., Peled, D.: The state of spin. In: Alur, R., Henzinger, T.A. (eds.) CAV 1996. LNCS, vol.\u00a01102. Springer, Heidelberg (1996)"},{"key":"16_CR9","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4684-9455-6","volume-title":"Denumerable Markov Chains","author":"J. Kemeny","year":"1976","unstructured":"Kemeny, J., Snell, J.: Denumerable Markov Chains. Springer, Heidelberg (1976)"},{"key":"16_CR10","volume-title":"Computer Aided Verification of the Coordinated Processes: The Automata Theoretic Approach","author":"R.P. Kurshan","year":"1994","unstructured":"Kurshan, R.P.: Computer Aided Verification of the Coordinated Processes: The Automata Theoretic Approach. Princeton University Press, Princeton (1994)"},{"key":"16_CR11","volume-title":"Logical foundation, distributed systems- methods and tools for specification","author":"L. Lamport","year":"1985","unstructured":"Lamport, L.: Logical foundation, distributed systems- methods and tools for specification, vol.\u00a0190. Springer, Heidelberg (1985)"},{"key":"16_CR12","volume-title":"Introduction to Probabilistic Automata","author":"A. Paz","year":"1971","unstructured":"Paz, A.: Introduction to Probabilistic Automata. Academic Press, London (1971)"},{"key":"16_CR13","volume-title":"Infinite Words: Automata, Semigroups, Logic and Games","author":"D. Perrin","year":"2004","unstructured":"Perrin, D., Pin, J.-E.: Infinite Words: Automata, Semigroups, Logic and Games. Elsevier, Amsterdam (2004)"},{"issue":"3","key":"16_CR14","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"},{"key":"16_CR15","doi-asserted-by":"crossref","unstructured":"Rutten, J.M., Kwiatkowska, M., Norman, G., Parker, D.: Mathematical Techniques for Analyzing Concurrent and Probabilistic Systems. AMS (2004)","DOI":"10.1090\/crmm\/023"},{"key":"16_CR16","volume-title":"Formal Languages","author":"A. Salomaa","year":"1973","unstructured":"Salomaa, A.: Formal Languages. Academic Press, London (1973)"},{"key":"16_CR17","unstructured":"Sistla, A.P.: Theoretical Issues in the Design and Verification of Distributed Systems. PhD thesis, Harvard University (1983)"},{"key":"16_CR18","doi-asserted-by":"crossref","unstructured":"Thomas, W.: Automata on infinite objects. In: Handbook of Theoretical Computer Science, vol.\u00a0B, pp. 133\u2013192 (1990)","DOI":"10.1016\/B978-0-444-88074-1.50009-3"},{"key":"16_CR19","first-page":"327","volume-title":"26th annual Symposium on Foundations of Computer Science","author":"M. Vardi","year":"1985","unstructured":"Vardi, M.: Automatic verification of probabilistic concurrent systems. In: 26th annual Symposium on Foundations of Computer Science, pp. 327\u2013338. IEEE Computer Society Press, Los Alamitos (1985)"},{"key":"16_CR20","unstructured":"Vardi, M., Wolper, P.: An automata theoretic approach to automatic program verification. In: Proceedings of the first IEEE Symposium on Logic in Computer Science (1986)"},{"key":"16_CR21","doi-asserted-by":"crossref","unstructured":"Vardi, M., Wolper, P., Sistla, A.P.: Reasoning about infinite computation paths. In: Proceedings of the 24th IEEE Symposium on Foundations of Computer Science (1983)","DOI":"10.1109\/SFCS.1983.51"}],"container-title":["Lecture Notes in Computer Science","CONCUR 2009 - Concurrency Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-04081-8_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,11]],"date-time":"2025-02-11T22:48:51Z","timestamp":1739314131000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-04081-8_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642040801","9783642040818"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-04081-8_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009]]}}}