{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,2]],"date-time":"2025-05-02T04:15:17Z","timestamp":1746159317096,"version":"3.40.4"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319049205"},{"type":"electronic","value":"9783319049212"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-04921-2_48","type":"book-chapter","created":{"date-parts":[[2014,2,5]],"date-time":"2014-02-05T13:52:25Z","timestamp":1391608345000},"page":"588-600","source":"Crossref","is-referenced-by-count":0,"title":["Probabilistic \u03c9-Regular Expressions"],"prefix":"10.1007","author":[{"given":"Thomas","family":"Weidner","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"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)","key":"48_CR1","DOI":"10.1109\/LICS.2005.41"},{"key":"48_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":"48_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"400","DOI":"10.1007\/978-3-642-33386-6_31","volume-title":"Automated Technology for Verification and Analysis","author":"B. Bollig","year":"2012","unstructured":"Bollig, B., Gastin, P., Monmege, B., Zeitoun, M.: A probabilistic kleene theorem. In: Chakraborty, S., Mukund, M. (eds.) ATVA 2012. LNCS, vol.\u00a07561, pp. 400\u2013415. Springer, Heidelberg (2012)"},{"unstructured":"B\u00fcchi, J.R.: On a decision method in restricted second order arithmetic. In: Int. Congress for Logic, Methodology and Philosophy of Science, pp. 1\u201311 (1962)","key":"48_CR4"},{"key":"48_CR5","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":"48_CR6","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":"48_CR7","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":"48_CR8","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)"},{"doi-asserted-by":"crossref","unstructured":"Chatterjee, K., Tracol, M.: Decidable problems for probabilistic automata on infinite words. In: LICS, pp. 185\u2013194. IEEE Computer Society (2012)","key":"48_CR9","DOI":"10.1109\/LICS.2012.29"},{"issue":"1-2","key":"48_CR10","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"},{"doi-asserted-by":"crossref","unstructured":"\u00c9sik, Z., Kuich, W.: Finite automata. In: Droste, M., Kuich, W., Vogler, H. (eds.) Handbook of Weighted Automata. EATCS Monographs, pp. 69\u2013104. Springer (2009)","key":"48_CR11","DOI":"10.1007\/978-3-642-01492-5_3"},{"doi-asserted-by":"crossref","unstructured":"Fijalkow, N., Gimbert, H., Oualhadj, Y.: Deciding the value 1 problem for probabilistic leaktight automata. In: LICS, pp. 295\u2013304. IEEE Computer Society (2012)","key":"48_CR12","DOI":"10.1109\/LICS.2012.40"},{"issue":"1-22","key":"48_CR13","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1016\/S0304-3975(97)00166-7","volume":"215","author":"D. Giammarresi","year":"1999","unstructured":"Giammarresi, D., Montalbano, R.: Deterministic generalized automata. TCS\u00a0215(1-22), 191\u2013208 (1999)","journal-title":"TCS"},{"doi-asserted-by":"crossref","unstructured":"Kleene, S.C.: Representation of events in nerve nets and finite automata. In: Shannon, Mccarthy (eds.) Automata Studies, pp. 3\u201341. Princeton Univ. Press (1956)","key":"48_CR14","DOI":"10.1515\/9781400882618-002"},{"unstructured":"Klenke, A.: Probability Theory: A Comprehensive Course. Springer (December 2007)","key":"48_CR15"},{"issue":"11","key":"48_CR16","doi-asserted-by":"publisher","first-page":"1532","DOI":"10.1016\/j.fss.2006.02.004","volume":"157","author":"W. Kuich","year":"2006","unstructured":"Kuich, W., Rahonis, G.: Fuzzy regular languages over finite and infinite words. Fuzzy Sets and Systems\u00a0157(11), 1532\u20131549 (2006)","journal-title":"Fuzzy Sets and Systems"},{"issue":"1-2","key":"48_CR17","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1016\/S0004-3702(02)00378-8","volume":"147","author":"O. Madani","year":"2003","unstructured":"Madani, O., Hanks, S., Condon, A.: On the undecidability of probabilistic planning and related stochastic optimization problems. Artif. Intell.\u00a0147(1-2), 5\u201334 (2003)","journal-title":"Artif. Intell."},{"unstructured":"Mora-Lpez, 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":"48_CR18"},{"issue":"3","key":"48_CR19","doi-asserted-by":"publisher","first-page":"230","DOI":"10.1016\/S0019-9958(63)90290-0","volume":"6","author":"M. Rabin","year":"1963","unstructured":"Rabin, M.: Probabilistic automata. Information and Control\u00a06(3), 230\u2013245 (1963)","journal-title":"Information and Control"},{"key":"48_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"},{"issue":"2-3","key":"48_CR21","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1016\/S0019-9958(61)80020-X","volume":"4","author":"M.P. Sch\u00fctzenberger","year":"1961","unstructured":"Sch\u00fctzenberger, M.P.: On the definition of a family of automata. Information and Control\u00a04(2-3), 245\u2013270 (1961)","journal-title":"Information and Control"},{"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":"48_CR22"},{"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)","key":"48_CR23","DOI":"10.1109\/SFCS.1985.12"},{"key":"48_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"813","DOI":"10.1007\/978-3-642-32589-2_70","volume-title":"Mathematical Foundations of Computer Science 2012","author":"T. Weidner","year":"2012","unstructured":"Weidner, T.: Probabilistic automata and probabilistic logic. In: Rovan, B., Sassone, V., Widmayer, P. (eds.) MFCS 2012. LNCS, vol.\u00a07464, pp. 813\u2013824. Springer, Heidelberg (2012)"}],"container-title":["Lecture Notes in Computer Science","Language and Automata Theory and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-04921-2_48","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,1]],"date-time":"2025-05-01T19:39:40Z","timestamp":1746128380000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-04921-2_48"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319049205","9783319049212"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-04921-2_48","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}