{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:17:38Z","timestamp":1759637858188,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642325885"},{"type":"electronic","value":"9783642325892"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-32589-2_70","type":"book-chapter","created":{"date-parts":[[2012,8,1]],"date-time":"2012-08-01T08:44:32Z","timestamp":1343810672000},"page":"813-824","source":"Crossref","is-referenced-by-count":3,"title":["Probabilistic Automata and Probabilistic Logic"],"prefix":"10.1007","author":[{"given":"Thomas","family":"Weidner","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"70_CR1","doi-asserted-by":"crossref","unstructured":"Baier, C., Gr\u00f6sser, M.: Recognizing \u03c9-regular languages with probabilistic automata. In: Proc. LICS, pp. 137\u2013146. IEEE (2005)","DOI":"10.1109\/LICS.2005.41"},{"key":"70_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":"70_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1007\/978-3-642-02737-6_2","volume-title":"Developments in Language Theory","author":"B. Bollig","year":"2009","unstructured":"Bollig, B., Gastin, P.: Weighted versus Probabilistic Logics. In: Diekert, V., Nowotka, D. (eds.) DLT 2009. LNCS, vol.\u00a05583, pp. 18\u201338. Springer, Heidelberg (2009)"},{"key":"70_CR4","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1002\/malq.19600060105","volume":"6","author":"J.R. B\u00fcchi","year":"1960","unstructured":"B\u00fcchi, J.R.: Weak second-order arithmetic and finite automata. Zeitschrift f\u00fcr Mathematische Logik und Grundlagen der Mathematik\u00a06, 66\u201392 (1960)","journal-title":"Zeitschrift f\u00fcr Mathematische Logik und Grundlagen der Mathematik"},{"key":"70_CR5","doi-asserted-by":"crossref","unstructured":"Bukharaev, R.G.: Theorie der stochastischen Automaten. Teubner (1995)","DOI":"10.1007\/978-3-663-11636-3"},{"key":"70_CR6","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":"70_CR7","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)"},{"key":"70_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1007\/978-3-642-04081-8_17","volume-title":"CONCUR 2009 - Concurrency Theory","author":"K. Chatterjee","year":"2009","unstructured":"Chatterjee, K., Doyen, L., Henzinger, T.A.: Probabilistic Weighted Automata. In: Bravetti, M., Zavattaro, G. (eds.) CONCUR 2009. LNCS, vol.\u00a05710, pp. 244\u2013258. Springer, Heidelberg (2009)"},{"key":"70_CR9","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.: 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":"70_CR10","doi-asserted-by":"crossref","unstructured":"Chatterjee, K., Tracol, M.: Decidable problems for probabilistic automata on infinite words. CoRR abs\/1107.2091 (2011)","DOI":"10.1109\/LICS.2012.29"},{"issue":"1-2","key":"70_CR11","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1016\/j.tcs.2006.07.033","volume":"365","author":"L. Cheung","year":"2006","unstructured":"Cheung, L., Lynch, N., Segala, R., Vaandrager, F.: Switched PIOA: Parallel composition via distributed scheduling. TCS\u00a0365(1-2), 83\u2013108 (2006)","journal-title":"TCS"},{"issue":"1-2","key":"70_CR12","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1016\/j.tcs.2007.02.055","volume":"380","author":"M. Droste","year":"2007","unstructured":"Droste, M., Gastin, P.: Weighted automata and weighted logics. Theoretical Computer Science\u00a0380(1-2), 69\u201386 (2007)","journal-title":"Theoretical Computer Science"},{"key":"70_CR13","doi-asserted-by":"crossref","unstructured":"Droste, M., Kuich, W., Vogler, H., (eds.): Handbook of Weighted Automata. EATCS Monographs in Theoretical Computer Science. Springer (2009)","DOI":"10.1007\/978-3-642-01492-5"},{"key":"70_CR14","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1090\/S0002-9947-1961-0139530-9","volume":"98","author":"C.C. Elgot","year":"1961","unstructured":"Elgot, C.C.: Decision problems of finite automata design and related arithmetics. Trans. Amer. Math. Soc.\u00a098, 21\u201351 (1961)","journal-title":"Trans. Amer. Math. Soc."},{"key":"70_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, Part II. LNCS, vol.\u00a06199, pp. 527\u2013538. Springer, Heidelberg (2010)"},{"key":"70_CR16","unstructured":"Klenke, A.: Probability Theory: A Comprehensive Course, 1st edn. Universitext. Springer (December 2007)"},{"key":"70_CR17","unstructured":"Mora-L\u00f3pez, L., Morales, R., Sidrach de Cardona, M., Triguero, F.: Probabilistic finite automata and randomness in nature: a new approach in the modelling and prediction of climatic parameters. In: Proc. International Environmental Modelling and Software Congress, pp. 78\u201383 (2002)"},{"key":"70_CR18","unstructured":"Paz, A.: Introduction to Probabilistic Automata. Computer Science and Applied Mathematics. Academic Press, Inc. (1971)"},{"issue":"3","key":"70_CR19","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. Information and Control\u00a06(3), 230\u2013245 (1963)","journal-title":"Information and Control"},{"key":"70_CR20","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1023\/A:1026490906255","volume":"25","author":"D. Ron","year":"1996","unstructured":"Ron, D., Singer, Y., Tishby, N.: The power of amnesia: Learning probabilistic automata with variable memory length. Machine Learning\u00a025, 117\u2013149 (1996)","journal-title":"Machine Learning"},{"key":"70_CR21","doi-asserted-by":"crossref","unstructured":"Sakarovitch, J.: Rational and recognisable power series. In: Droste, et al. (eds.) [13] Handbook, pp. 105\u2013174","DOI":"10.1007\/978-3-642-01492-5_4"},{"key":"70_CR22","unstructured":"Tracol, M., Baier, C., Gr\u00f6\u00dfer, M.: Recurrence and transience for probabilistic automata. In: FSTTCS, vol.\u00a04, pp. 395\u2013406. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2009)"},{"key":"70_CR23","doi-asserted-by":"crossref","unstructured":"Vardi, M.Y.: Automatic verification of probabilistic concurrent finite state programs. In: Foundations of Computer Science, pp. 327\u2013338 (1985)","DOI":"10.1109\/SFCS.1985.12"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2012"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-32589-2_70.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,6]],"date-time":"2025-04-06T11:21:45Z","timestamp":1743938505000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-32589-2_70"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642325885","9783642325892"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-32589-2_70","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}