{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,14]],"date-time":"2026-06-14T09:43:57Z","timestamp":1781430237559,"version":"3.54.1"},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540784975","type":"print"},{"value":"9783540784999","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-78499-9_21","type":"book-chapter","created":{"date-parts":[[2008,4,1]],"date-time":"2008-04-01T19:02:25Z","timestamp":1207076545000},"page":"287-301","source":"Crossref","is-referenced-by-count":43,"title":["On Decision Problems for Probabilistic B\u00fcchi Automata"],"prefix":"10.1007","author":[{"given":"Christel","family":"Baier","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Nathalie","family":"Bertrand","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Marcus","family":"Gr\u00f6\u00dfer","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"21_CR1","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1109\/LICS.2005.41","volume-title":"Proc. 20th IEEE Symp. on Logic in Computer Science (LICS 2005)","author":"C. Baier","year":"2005","unstructured":"Baier, C., Gr\u00f6\u00dfer, M.: Recognizing \u03c9-regular languages with probabilistic automata. In: Proc. 20th IEEE Symp. on Logic in Computer Science (LICS 2005), pp. 137\u2013146. IEEE Computer Society Press, Los Alamitos (2005)"},{"key":"21_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1007\/978-3-540-27813-9_15","volume-title":"Computer Aided Verification","author":"D. Bustan","year":"2004","unstructured":"Bustan, D., Rubin, S., Vardi, M.: Verifying \u03c9-regular properties of Markov chains. In: Alur, R., Peled, D.A. (eds.) CAV 2004. LNCS, vol.\u00a03114, pp. 189\u2013201. Springer, Heidelberg (2004)"},{"key":"21_CR3","unstructured":"Cassandra, A.R.: A survey of POMD applications. Presented at the AAAI Fall Symposium (1998), \n                  \n                    http:\/\/pomdp.org\/pomdp\/papers\/applications.pdf"},{"issue":"4","key":"21_CR4","doi-asserted-by":"publisher","first-page":"857","DOI":"10.1145\/210332.210339","volume":"42","author":"C. Courcoubetis","year":"1995","unstructured":"Courcoubetis, C., Yannakakis, M.: The complexity of probabilistic verification. Journal of the ACM\u00a042(4), 857\u2013907 (1995)","journal-title":"Journal of the ACM"},{"key":"21_CR5","unstructured":"de Alfaro, L.: The verification of probabilistic systems under memoryless partial-information policies is hard. In: Proc. Workshop on Probabilistic Methods in Verification (ProbMiV 1999), Birmingham University, Research Report CSR-99-9, pp. 19\u201332 (1999)"},{"key":"21_CR6","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)"},{"key":"21_CR7","series-title":"Lecture Notes in Computer Science","volume-title":"Automata, logics, and infinite games: A guide to current research","year":"2002","unstructured":"Gr\u00e4del, E., Thomas, W., Wilke, T. (eds.): Automata, Logics, and Infinite Games. LNCS, vol.\u00a02500. Springer, Heidelberg (2002)"},{"issue":"3","key":"21_CR8","doi-asserted-by":"publisher","first-page":"356","DOI":"10.1145\/2166.357214","volume":"5","author":"S. Hart","year":"1983","unstructured":"Hart, S., Sharir, M., Pnueli, A.: Termination of probabilistic concurrent programs. ACM Transactions on Programming Languages and Systems\u00a05(3), 356\u2013380 (1983)","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"21_CR9","unstructured":"Kemeny, J.G., Snell, J.L., Knapp, A.W.: Denumerable Markov chains. D. Van Nostrand Co (1966)"},{"key":"21_CR10","volume-title":"Modeling and Analysis of Stochastic Systems","author":"V.G. Kulkarni","year":"1995","unstructured":"Kulkarni, V.G.: Modeling and Analysis of Stochastic Systems. Chapman & Hall, Boca Raton (1995)"},{"issue":"1\u20132","key":"21_CR11","doi-asserted-by":"crossref","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. Artificial Intelligence\u00a0147(1\u20132), 5\u201334 (2003)","journal-title":"Artificial Intelligence"},{"key":"21_CR12","volume-title":"Introduction to probabilistic automata","author":"A. Paz","year":"1971","unstructured":"Paz, A.: Introduction to probabilistic automata. Academic Press Inc., London (1971)"},{"key":"21_CR13","series-title":"Pure and Applied Mathematics","volume-title":"Infinite Words","author":"D. Perrin","year":"2004","unstructured":"Perrin, D., Pin, J.-\u00c9.: Infinite Words. Pure and Applied Mathematics, vol.\u00a0141. Elsevier, Amsterdam (2004)"},{"key":"21_CR14","doi-asserted-by":"crossref","DOI":"10.1002\/9780470316887","volume-title":"Markov Decision Processes: Discrete Stochastic Dynamic Programming","author":"M. Puterman","year":"1994","unstructured":"Puterman, M.: Markov Decision Processes: Discrete Stochastic Dynamic Programming. John Wiley and Sons, Chichester (1994)"},{"issue":"3","key":"21_CR15","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"},{"issue":"2","key":"21_CR16","doi-asserted-by":"publisher","first-page":"274","DOI":"10.1016\/0022-0000(84)90034-5","volume":"29","author":"J.H. Reif","year":"1984","unstructured":"Reif, J.H.: The complexity of two-player games of incomplete information. Journal of Computer System Sciences\u00a029(2), 274\u2013301 (1984)","journal-title":"Journal of Computer System Sciences"},{"key":"21_CR17","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1109\/SFCS.1988.21948","volume-title":"Proc. 29th Symposium on Foundations of Computer Science (FOCS 1988)","author":"S. Safra","year":"1988","unstructured":"Safra, S.: On the complexity of omega-automata. In: Proc. 29th Symposium on Foundations of Computer Science (FOCS 1988), pp. 319\u2013327. IEEE Computer Society Press, Los Alamitos (1988)"},{"key":"21_CR18","volume-title":"Introduction to the numerical solution of Markov Chains","author":"W.J. Stewart","year":"1994","unstructured":"Stewart, W.J.: Introduction to the numerical solution of Markov Chains. Princeton University Press, Princeton (1994)"},{"key":"21_CR19","first-page":"133","volume-title":"Handbook of Theoretical Computer Science","author":"W. Thomas","year":"1990","unstructured":"Thomas, W.: Automata on infinite objects. In: Handbook of Theoretical Computer Science, vol.\u00a0B, ch.\u00a04, pp. 133\u2013191. Elsevier, Amsterdam (1990)"},{"key":"21_CR20","first-page":"327","volume-title":"Proc. 26th Symposium on Foundations of Computer Science (FOCS 1985)","author":"M.Y. Vardi","year":"1985","unstructured":"Vardi, M.Y.: Automatic verification of probabilistic concurrent finite-state programs. In: Proc. 26th Symposium on Foundations of Computer Science (FOCS 1985), pp. 327\u2013338. IEEE Computer Society Press, Los Alamitos (1985)"}],"container-title":["Lecture Notes in Computer Science","Foundations of Software Science and Computational Structures"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-78499-9_21.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:11:31Z","timestamp":1619507491000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-78499-9_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540784975","9783540784999"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-78499-9_21","relation":{},"subject":[]}}