{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,17]],"date-time":"2026-08-17T12:01:15Z","timestamp":1786968075712,"version":"build-2736575974"},"publisher-location":"Cham","reference-count":41,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319415277","type":"print"},{"value":"9783319415284","type":"electronic"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-41528-4_2","type":"book-chapter","created":{"date-parts":[[2016,7,12]],"date-time":"2016-07-12T09:34:06Z","timestamp":1468316046000},"page":"23-42","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":16,"title":["Markov Chains and Unambiguous B\u00fcchi Automata"],"prefix":"10.1007","author":[{"given":"Christel","family":"Baier","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Stefan","family":"Kiefer","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Joachim","family":"Klein","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Sascha","family":"Kl\u00fcppelholz","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"David","family":"M\u00fcller","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"James","family":"Worrell","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2016,7,13]]},"reference":[{"key":"2_CR1","unstructured":"Website with additional material for this paper. \n                      http:\/\/wwwtcs.inf.tu-dresden.de\/ALGI\/PUB\/CAV16\/"},{"key":"2_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1007\/3-540-15641-0_20","volume-title":"Automata on Infinite Words, Ecole de Printemps d\u2019Informatique Th\u00e9orique, Le Mont Dore","author":"A Arnold","year":"1985","unstructured":"Arnold, A.: Deterministic and non ambiguous rational omega-languages. In: Nivat, M., Perrin, D. (eds.) Automata on Infinite Words, Ecole de Printemps d\u2019Informatique Th\u00e9orique, Le Mont Dore. LNCS, vol. 192, pp. 18\u201327. Springer, Heidelberg (1985)"},{"key":"2_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"479","DOI":"10.1007\/978-3-319-21690-4_31","volume-title":"Computer Aided Verification","author":"T Babiak","year":"2015","unstructured":"Babiak, T., Blahoudek, F., Duret-Lutz, A., Klein, J., K\u0159et\u00ednsk\u00fd, J., M\u00fcller, D., Parker, D., Strej\u010dek, J.: The Hanoi omega-automata format. In: Kroening, D., P\u0103s\u0103reanu, C.S. (eds.) CAV 2015. LNCS, vol. 9206, pp. 479\u2013486. Springer, Heidelberg (2015)"},{"key":"2_CR4","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1007\/978-3-319-41528-4_2","volume-title":"Computer Aided Verification","author":"Christel Baier","year":"2016","unstructured":"Baier, C., Kiefer, S., Klein, J., Kl\u00fcppelholz, S., M\u00fcller, D., Worrell, J.: Markov chains and unambiguous B\u00fcchi automata (extended version) (2016). \n                      http:\/\/arxiv.org\/abs\/1605.00950"},{"key":"2_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1007\/978-3-642-36742-7_3","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"M Benedikt","year":"2013","unstructured":"Benedikt, M., Lenhardt, R., Worrell, J.: LTL model checking of interval Markov chains. In: Piterman, N., Smolka, S.A. (eds.) TACAS 2013 (ETAPS 2013). LNCS, vol. 7795, pp. 32\u201346. Springer, Heidelberg (2013)"},{"key":"2_CR6","unstructured":"Benedikt, M., Lenhardt, R., Worrell, J.: Model checking Markov chains against unambiguous B\u00fcchi automata (2014). \n                      arXiv:1405.4560"},{"issue":"2","key":"2_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.2168\/LMCS-9(2:4)2013","volume":"9","author":"M Benedikt","year":"2013","unstructured":"Benedikt, M., Lenhardt, R., Worrell, J.: Two variable vs. linear temporal logic in model checking and games. Log. Methods Comput. Sci. 9(2), 1\u201337 (2013)","journal-title":"Log. Methods Comput. Sci."},{"key":"2_CR8","volume-title":"Nonnegative Matrices in the Mathematical Sciences","author":"A Berman","year":"1979","unstructured":"Berman, A., Plemmons, R.J.: Nonnegative Matrices in the Mathematical Sciences. Academic Press, Cambridge (1979)"},{"key":"2_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1007\/978-3-642-13089-2_10","volume-title":"Language and Automata Theory and Applications","author":"N Bousquet","year":"2010","unstructured":"Bousquet, N., L\u00f6ding, C.: Equivalence and inclusion problem for strongly unambiguous B\u00fcchi automata. In: Dediu, A.-H., Fernau, H., Mart\u00edn-Vide, C. (eds.) LATA 2010. LNCS, vol. 6031, pp. 118\u2013129. Springer, Heidelberg (2010)"},{"key":"2_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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.Y.: Verifying $$\\mathit{\\omega }$$-regular properties of Markov Chains. In: Alur, R., Peled, D.A. (eds.) CAV 2004. LNCS, vol. 3114, pp. 189\u2013201. Springer, Heidelberg (2004)"},{"key":"2_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1007\/978-3-662-44602-7_17","volume-title":"Theoretical Computer Science","author":"S Chakraborty","year":"2014","unstructured":"Chakraborty, S., Katoen, J.-P.: Parametric LTL on Markov chains. In: Diaz, J., Lanese, I., Sangiorgi, D. (eds.) TCS 2014. LNCS, vol. 8705, pp. 207\u2013221. Springer, Heidelberg (2014)"},{"key":"2_CR12","unstructured":"Colcombet, T.: Forms of determinism for automata (invited talk). In: 29th International Symposium on Theoretical Aspects of Computer Science, (STACS), LIPIcs, vol. 14, pp. 1\u201323. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2012)"},{"key":"2_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-319-19225-3_1","volume-title":"Descriptional Complexity of Formal Systems","author":"T Colcombet","year":"2015","unstructured":"Colcombet, T.: Unambiguity in automata theory. In: Shallit, J., Okhotin, A. (eds.) DCFS 2015. LNCS, vol. 9118, pp. 3\u201318. Springer, Heidelberg (2015)"},{"issue":"4","key":"2_CR14","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. J. ACM 42(4), 857\u2013907 (1995)","journal-title":"J. ACM"},{"key":"2_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1007\/3-540-48119-2_16","volume-title":"FM 1999 - Formal Methods","author":"J-M Couvreur","year":"1999","unstructured":"Couvreur, J.-M.: On-the-fly verification of linear temporal logic. In: Wing, J.M., Woodcock, J. (eds.) FM 1999. LNCS, vol. 1708, pp. 253\u2013271. Springer, Heidelberg (1999)"},{"key":"2_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1007\/978-3-540-39813-4_26","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"J-M Couvreur","year":"2003","unstructured":"Couvreur, J.-M., Saheb, N., Sutre, G.: An optimal automata approach to LTL model checking of probabilistic systems. In: Vardi, M.Y., Voronkov, A. (eds.) LPAR 2003. LNCS, vol. 2850, pp. 361\u2013375. Springer, Heidelberg (2003)"},{"key":"2_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"442","DOI":"10.1007\/978-3-319-02444-8_31","volume-title":"Automated Technology for Verification and Analysis","author":"A Duret-Lutz","year":"2013","unstructured":"Duret-Lutz, A.: Manipulating LTL formulas using spot 1.0. In: Van Hung, D., Ogawa, M. (eds.) ATVA 2013. LNCS, vol. 8172, pp. 442\u2013445. Springer, Heidelberg (2013)"},{"issue":"1\/2","key":"2_CR18","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1504\/IJCCBS.2014.059594","volume":"5","author":"A Duret-Lutz","year":"2014","unstructured":"Duret-Lutz, A.: LTL translation improvements in Spot 1.0. Int. J. Crit. Comput.-Based Syst. 5(1\/2), 31\u201354 (2014)","journal-title":"Int. J. Crit. Comput.-Based Syst."},{"key":"2_CR19","doi-asserted-by":"crossref","unstructured":"Dwyer, M.B., Avrunin, G.S., Corbett, J.C.: Patterns in property specifications for finite-state verification. In: 21th International Conference on Software Engineering (ICSE), pp. 411\u2013420. ACM (1999)","DOI":"10.1145\/302405.302672"},{"key":"2_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1007\/3-540-44618-4_13","volume-title":"CONCUR 2000 - Concurrency Theory","author":"K Etessami","year":"2000","unstructured":"Etessami, K., Holzmann, G.J.: Optimizing B\u00fcchi automata. In: Palamidessi, C. (ed.) CONCUR 2000. LNCS, vol. 1877, pp. 153\u2013168. Springer, Heidelberg (2000)"},{"key":"2_CR21","doi-asserted-by":"crossref","unstructured":"Gerth, R., Peled, D., Vardi, M.Y., Wolper, P.: Simple on-the-fly automatic verification of linear temporal logic. In: Fifteenth IFIP WG6.1 International Symposium on Protocol Specification (PSTV), IFIP Conference Proceedings, vol. 38, pp. 3\u201318. Chapman & Hall (1995)","DOI":"10.1007\/978-0-387-34892-6_1"},{"key":"2_CR22","series-title":"Lecture Notes in Computer Science","volume-title":"Automata, Logics, Infinite Games: A Guide to Current Research","year":"2002","unstructured":"Gr\u00e4del, E., Thomas, W., Wilke, T. (eds.): Automata, Logics, Infinite Games: A Guide to Current Research. LNCS, vol. 2500. Springer, Heidelberg (2002)"},{"key":"2_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"312","DOI":"10.1007\/978-3-319-06410-9_22","volume-title":"FM 2014: Formal Methods","author":"EM Hahn","year":"2014","unstructured":"Hahn, E.M., Li, Y., Schewe, S., Turrini, A., Zhang, L.: iscasMc: a web-based probabilistic model checker. In: Jones, C., Pihlajasaari, P., Sun, J. (eds.) FM 2014. LNCS, vol. 8442, pp. 312\u2013317. Springer, Heidelberg (2014)"},{"key":"2_CR24","volume-title":"Matrix Analysis","author":"RA Horn","year":"2013","unstructured":"Horn, R.A., Johnson, C.R.: Matrix Analysis, 2nd edn. Cambridge University Press, Cambridge (2013)","edition":"2"},{"key":"2_CR25","unstructured":"Hoschek, W.: The colt distribution: open source libraries for high performance scientific and technical computing in Java (2004)"},{"issue":"14\u201315","key":"2_CR26","doi-asserted-by":"publisher","first-page":"578","DOI":"10.1016\/j.ipl.2012.04.010","volume":"112","author":"D Isaak","year":"2012","unstructured":"Isaak, D., L\u00f6ding, C.: Efficient inclusion testing for simple classes of unambiguous $$\\omega $$-automata. Inf. Process. Lett. 112(14\u201315), 578\u2013582 (2012)","journal-title":"Inf. Process. Lett."},{"key":"2_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"724","DOI":"10.1007\/978-3-540-70575-8_59","volume-title":"Automata, Languages and Programming","author":"D K\u00e4hler","year":"2008","unstructured":"K\u00e4hler, D., Wilke, T.: Complementation, disambiguation, and determinization of B\u00fcchi automata unified. In: Aceto, L., Damg\u00e5rd, I., Goldberg, L.A., Halld\u00f3rsson, M.M., Ing\u00f3lfsd\u00f3ttir, A., Walukiewicz, I. (eds.) ICALP 2008, Part I. LNCS, vol. 5125, pp. 724\u2013735. Springer, Heidelberg (2008)"},{"issue":"2","key":"2_CR28","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1016\/j.tcs.2006.07.022","volume":"363","author":"J Klein","year":"2006","unstructured":"Klein, J., Baier, C.: Experiments with deterministic $$\\omega $$-automata for formulas of linear temporal logic. Theoret. Comput. Sci. 363(2), 182\u2013195 (2006)","journal-title":"Theoret. Comput. Sci."},{"key":"2_CR29","volume-title":"Modeling and Analysis of Stochastic Systems","author":"VG Kulkarni","year":"1995","unstructured":"Kulkarni, V.G.: Modeling and Analysis of Stochastic Systems. Chapman & Hall, London (1995)"},{"key":"2_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"585","DOI":"10.1007\/978-3-642-22110-1_47","volume-title":"Computer Aided Verification","author":"M Kwiatkowska","year":"2011","unstructured":"Kwiatkowska, M., Norman, G., Parker, D.: PRISM 4.0: verification of probabilistic real-time systems. In: Gopalakrishnan, G., Qadeer, S. (eds.) CAV 2011. LNCS, vol. 6806, pp. 585\u2013591. Springer, Heidelberg (2011)"},{"key":"2_CR31","doi-asserted-by":"crossref","unstructured":"Kwiatkowska, M.Z., Norman, G., Parker, D.: The PRISM benchmark suite. In: 9th International Conference on Quantitative Evaluation of SysTems (QEST), pp. 203\u2013204. IEEE Computer Society (2012)","DOI":"10.1109\/QEST.2012.14"},{"key":"2_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1007\/978-3-642-40196-1_11","volume-title":"Quantitative Evaluation of Systems","author":"R Lenhardt","year":"2013","unstructured":"Lenhardt, R.: Tulip: model checking probabilistic systems using expectation maximisation algorithm. In: Joshi, K., Siegle, M., Stoelinga, M., D\u2019Argenio, P.R. (eds.) QEST 2013. LNCS, vol. 8054, pp. 155\u2013159. Springer, Heidelberg (2013)"},{"key":"2_CR33","unstructured":"Lenhardt, R.: Two variable and linear temporal logic in model checking and games. Ph.D. thesis, University of Oxford (2013)"},{"key":"2_CR34","unstructured":"Morgenstern, A.: Symbolic controller synthesis for LTL specifications. Ph.D. thesis, Technische Universit\u00e4t Kaiserslautern (2010)"},{"key":"2_CR35","unstructured":"The PRISM model checker. \n                      http:\/\/www.prismmodelchecker.org\/"},{"key":"2_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"248","DOI":"10.1007\/10722167_21","volume-title":"Computer Aided Verification","author":"F Somenzi","year":"2000","unstructured":"Somenzi, F., Bloem, R.: Efficient B\u00fcchi automata from LTL formulae. In: Emerson, E.A., Sistla, A.P. (eds.) Computer Aided Verification. LNCS, vol. 1855, pp. 248\u2013263. Springer, Heidelberg (2000)"},{"issue":"3","key":"2_CR37","doi-asserted-by":"publisher","first-page":"598","DOI":"10.1137\/0214044","volume":"14","author":"RE Stearns","year":"1985","unstructured":"Stearns, R.E., Hunt, H.B.: On the equivalence and containment problem for unambiguous regular expressions, grammars, and automata. SIAM J. Comput. 14(3), 598\u2013611 (1985)","journal-title":"SIAM J. Comput."},{"key":"2_CR38","doi-asserted-by":"crossref","unstructured":"Vardi, M.Y.: Automatic verification of probabilistic concurrent finite-state programs. In: 26th IEEE Symposium on Foundations of Computer Science (FOCS), pp. 327\u2013338. IEEE Computer Society (1985)","DOI":"10.1109\/SFCS.1985.12"},{"key":"2_CR39","unstructured":"Vardi, M.Y., Wolper, P.: An automata-theoretic approach to automatic program verification (preliminary report). In: 1st Symposium on Logic in Computer Science (LICS), pp. 332\u2013344. IEEE Computer Society Press (1986)"},{"key":"2_CR40","doi-asserted-by":"crossref","unstructured":"Wolper, P., Vardi, M.Y., Sistla, P.A.: Reasoning about infinite computation paths (extended abstract). In: 24th Annual Symposium on Foundations of Computer Science (FOCS), pp. 185\u2013194. IEEE Computer Society (1983)","DOI":"10.1109\/SFCS.1983.51"},{"key":"2_CR41","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1016\/j.tcs.2012.07.039","volume":"493","author":"M Zimmermann","year":"2013","unstructured":"Zimmermann, M.: Optimal bounds in parametric LTL games. Theoret. Comput. Sci. 493, 30\u201345 (2013)","journal-title":"Theoret. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Computer Aided Verification"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-41528-4_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,7,14]],"date-time":"2020-07-14T00:02:57Z","timestamp":1594684977000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-41528-4_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319415277","9783319415284"],"references-count":41,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-41528-4_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"13 July 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CAV","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Computer Aided Verification","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Toronto","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Canada","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2016","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 July 2016","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 July 2016","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cav2016","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}