{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T07:28:08Z","timestamp":1758266888583},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642229923"},{"type":"electronic","value":"9783642229930"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-22993-0_27","type":"book-chapter","created":{"date-parts":[[2011,8,9]],"date-time":"2011-08-09T12:44:46Z","timestamp":1312893886000},"page":"278-289","source":"Crossref","is-referenced-by-count":6,"title":["Infinite Synchronizing Words for Probabilistic Automata"],"prefix":"10.1007","author":[{"given":"Laurent","family":"Doyen","sequence":"first","affiliation":[]},{"given":"Thierry","family":"Massart","sequence":"additional","affiliation":[]},{"given":"Mahsa","family":"Shirmohammadi","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"27_CR1","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":"27_CR2","first-page":"137","volume-title":"Proc. of LICS: Logic in Comp. Science","author":"C. Baier","year":"2005","unstructured":"Baier, C., Gr\u00f6\u00dfer, M.: Recognizing omega-regular languages with probabilistic automata. In: Proc. of LICS: Logic in Comp. Science, pp. 137\u2013146. IEEE, Los Alamitos (2005)"},{"key":"27_CR3","doi-asserted-by":"publisher","first-page":"2191","DOI":"10.1073\/pnas.0535624100","volume":"100","author":"Y. Benenson","year":"2003","unstructured":"Benenson, Y., Adar, R., Paz-Elizur, T., Livneh, Z., Shapiro, E.: DNA molecule provides a computing machine with both data and fuel. Proc. National Acad. Sci.\u00a0100, 2191\u20132196 (2003)","journal-title":"Proc. National Acad. Sci."},{"key":"27_CR4","first-page":"18","volume-title":"Proc. of LICS: 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: Proc. of LICS: Logic in Computer Science, pp. 18\u201329. IEEE Comp. Soc., Los Alamitos (2008)"},{"key":"27_CR5","doi-asserted-by":"crossref","unstructured":"Doyen, L., Massart, T., Shirmohammadi, M.: Synchronizing objectives for Markov decision processes. In: Proc. of iWIGP, pp. 61\u201375 (2011)","DOI":"10.4204\/EPTCS.50.5"},{"key":"27_CR6","doi-asserted-by":"crossref","unstructured":"Doyen, L., Massart, T., Shirmohammadi, M.: Infinite synchronizing words for probabilistic automata. Tech. Rep, 138, Universit\u00e9 Libre de Bruxelles (ULB), Belgium (June 2011)","DOI":"10.1007\/978-3-642-22993-0_27"},{"key":"27_CR7","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1002\/sapm1970491101","volume":"29","author":"D.J. Kfoury","year":"1970","unstructured":"Kfoury, D.J.: Synchronizing sequences for probabilistic automata. Studies in Applied Mathematics\u00a029, 101\u2013103 (1970)","journal-title":"Studies in Applied Mathematics"},{"key":"27_CR8","first-page":"199","volume-title":"Proc. of QEST: Quantitative Evaluation of Systems","author":"V.A. Korthikanti","year":"2009","unstructured":"Korthikanti, V.A., Viswanathan, M., Kwon, Y., Agha, G.: Reasoning about mdps as transformers of probability distributions. In: Proc. of QEST: Quantitative Evaluation of Systems, pp. 199\u2013208. IEEE Computer Society, Los Alamitos (2009)"},{"key":"27_CR9","doi-asserted-by":"crossref","unstructured":"Kwon, Y., Agha, G.: Linear inequality ltl (iltl): A model checker for discrete time Markov chains. In: ICFEM, pp. 194\u2013208 (2004)","DOI":"10.1007\/978-3-540-30482-1_21"},{"key":"27_CR10","volume-title":"Introduction to Probabilistic Automata","author":"A. Paz","year":"1971","unstructured":"Paz, A.: Introduction to Probabilistic Automata. Academic Press, New York (1971)"},{"issue":"3","key":"27_CR11","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":"27_CR12","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1016\/0304-3975(87)90008-9","volume":"49","author":"A.P. Sistla","year":"1987","unstructured":"Sistla, A.P., Vardi, M.Y., Wolper, P.: The complementation problem for B\u00fcchi automata with applications to temporal logic. Theor. Comput. Sci.\u00a049, 217\u2013237 (1987)","journal-title":"Theor. Comput. Sci."},{"key":"27_CR13","first-page":"1","volume-title":"Proceedings of the 5th Annual Symposium on Theory of Computing","author":"L.J. Stockmeyer","year":"1973","unstructured":"Stockmeyer, L.J., Meyer, A.R.: Word problems requiring exponential time. In: Proceedings of the 5th Annual Symposium on Theory of Computing, pp. 1\u20139. ACM Press, New York (1973)"},{"key":"27_CR14","unstructured":"Tracol, M., Baier, C., Gr\u00f6\u00dfer, M.: Recurrence and transience for probabilistic automata. In: Proc. of FSTTCS: Foundations of Software Technology and Theoretical Computer Science. LIPIcs, vol.\u00a04, pp. 395\u2013406. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2009)"},{"key":"27_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1007\/978-3-540-88282-4_4","volume-title":"Language and Automata Theory and Applications","author":"M.V. Volkov","year":"2008","unstructured":"Volkov, M.V.: Synchronizing automata and the \u010cern\u00fd conjecture. In: Mart\u00edn-Vide, C., Otto, F., Fernau, H. (eds.) LATA 2008. LNCS, vol.\u00a05196, pp. 11\u201327. Springer, Heidelberg (2008)"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2011"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-22993-0_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T00:12:46Z","timestamp":1558311166000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-22993-0_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642229923","9783642229930"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-22993-0_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}