{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,4]],"date-time":"2025-05-04T10:10:10Z","timestamp":1746353410641,"version":"3.40.4"},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662445839"},{"type":"electronic","value":"9783662445846"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-662-44584-6_17","type":"book-chapter","created":{"date-parts":[[2014,8,23]],"date-time":"2014-08-23T01:21:03Z","timestamp":1408756863000},"page":"234-248","source":"Crossref","is-referenced-by-count":3,"title":["Robust Synchronization in Markov Decision Processes"],"prefix":"10.1007","author":[{"given":"Laurent","family":"Doyen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thierry","family":"Massart","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mahsa","family":"Shirmohammadi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"17_CR1","unstructured":"ArXiv CoRR (2014), http:\/\/arxiv.org\/abs\/1402.2840 (Full version)"},{"key":"17_CR2","doi-asserted-by":"crossref","unstructured":"Agrawal, M., Akshay, S., Genest, B., Thiagarajan, P.S.: Approximate verification of the symbolic dynamics of Markov chains. In: LICS, pp. 55\u201364. IEEE (2012)","DOI":"10.1109\/LICS.2012.17"},{"key":"17_CR3","doi-asserted-by":"crossref","unstructured":"de Alfaro, L., Henzinger, T.A.: Concurrent omega-regular games. In: Proc. of LICS, pp. 141\u2013154 (2000)","DOI":"10.1109\/LICS.2000.855763"},{"issue":"3","key":"17_CR4","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1016\/j.tcs.2007.07.008","volume":"386","author":"L. Alfaro de","year":"2007","unstructured":"de Alfaro, L., Henzinger, T.A., Kupferman, O.: Concurrent reachability games. Theor. Comput. Sci.\u00a0386(3), 188\u2013217 (2007)","journal-title":"Theor. Comput. Sci."},{"key":"17_CR5","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":"17_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"428","DOI":"10.1007\/978-3-540-92221-6_27","volume-title":"Principles of Distributed Systems","author":"R. Baldoni","year":"2008","unstructured":"Baldoni, R., Bonnet, F., Milani, A., Raynal, M.: On the solvability of anonymous partial grids exploration by mobile robots. In: Baker, T.P., Bui, A., Tixeuil, S. (eds.) OPODIS 2008. LNCS, vol.\u00a05401, pp. 428\u2013445. Springer, Heidelberg (2008)"},{"issue":"6","key":"17_CR7","first-page":"301","volume":"12","author":"H.D. Burkhard","year":"1976","unstructured":"Burkhard, H.D.: Zum l\u00e4ngenproblem homogener experimente an determinierten und nicht-deterministischen automaten. Elektronische Informationsverarbeitung und Kybernetik\u00a012(6), 301\u2013306 (1976)","journal-title":"Elektronische Informationsverarbeitung und Kybernetik"},{"issue":"3","key":"17_CR8","first-page":"208","volume":"14","author":"J. Cern\u00fd","year":"1964","unstructured":"Cern\u00fd, J.: Pozn\u00e1mka k. homog\u00e9nnym experimentom s konecnymi automatmi. Matematicko-fyzik\u00e1lny \u010casopis\u00a014(3), 208\u2013216 (1964)","journal-title":"Matematicko-fyzik\u00e1lny \u010casopis"},{"key":"17_CR9","doi-asserted-by":"crossref","unstructured":"Chadha, R., Korthikanti, V.A., Viswanathan, M., Agha, G., Kwon, Y.: Model checking MDPs with a unique compact invariant set of distributions. In: QEST, pp. 121\u2013130. IEEE (2011)","DOI":"10.1109\/QEST.2011.22"},{"issue":"4","key":"17_CR10","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\u00a042(4), 857\u2013907 (1995)","journal-title":"J. ACM"},{"key":"17_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"278","DOI":"10.1007\/978-3-642-22993-0_27","volume-title":"Mathematical Foundations of Computer Science 2011","author":"L. Doyen","year":"2011","unstructured":"Doyen, L., Massart, T., Shirmohammadi, M.: Infinite synchronizing words for probabilistic automata. In: Murlak, F., Sankowski, P. (eds.) MFCS 2011. LNCS, vol.\u00a06907, pp. 278\u2013289. Springer, Heidelberg (2011)"},{"key":"17_CR12","doi-asserted-by":"crossref","unstructured":"Doyen, L., Massart, T., Shirmohammadi, M.: Synchronizing objectives for Markov decision processes. In: Proc. of iWIGP. EPTCS, vol.\u00a050, pp. 61\u201375 (2011)","DOI":"10.4204\/EPTCS.50.5"},{"key":"17_CR13","unstructured":"Doyen, L., Massart, T., Shirmohammadi, M.: Infinite synchronizing words for probabilistic automata (Erratum). CoRR abs\/1206.0995 (2012)"},{"key":"17_CR14","doi-asserted-by":"crossref","unstructured":"Doyen, L., Massart, T., Shirmohammadi, M.: Limit synchronization in Markov decision processes. In: Muscholl, A. (ed.) FOSSACS 2014. LNCS, vol.\u00a08412, pp. 58\u201372. Springer, Heidelberg (2014)","DOI":"10.1007\/978-3-642-54830-7_4"},{"key":"17_CR15","doi-asserted-by":"crossref","unstructured":"Filar, J., Vrieze, K.: Competitive Markov Decision Processes. Springer (1997)","DOI":"10.1007\/978-1-4612-4054-9"},{"key":"17_CR16","doi-asserted-by":"crossref","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)","DOI":"10.1007\/978-3-642-14162-1_44"},{"key":"17_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/978-3-642-02658-4_27","volume-title":"Computer Aided Verification","author":"T.A. Henzinger","year":"2009","unstructured":"Henzinger, T.A., Mateescu, M., Wolf, V.: Sliding window abstraction for infinite Markov chains. In: Bouajjani, A., Maler, O. (eds.) CAV 2009. LNCS, vol.\u00a05643, pp. 337\u2013352. Springer, Heidelberg (2009)"},{"issue":"1","key":"17_CR18","first-page":"105","volume":"14","author":"B. Imreh","year":"1999","unstructured":"Imreh, B., Steinby, M.: Directable nondeterministic automata. Acta Cybern.\u00a014(1), 105\u2013115 (1999)","journal-title":"Acta Cybern."},{"key":"17_CR19","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1002\/sapm1970491101","volume":"29","author":"D. Kfoury","year":"1970","unstructured":"Kfoury, D.: Synchronizing sequences for probabilistic automata. Studies in Applied Mathematics\u00a029, 101\u2013103 (1970)","journal-title":"Studies in Applied Mathematics"},{"key":"17_CR20","doi-asserted-by":"crossref","unstructured":"Korthikanti, V.A., Viswanathan, M., Agha, G., Kwon, Y.: Reasoning about MDPs as transformers of probability distributions. In: QEST, pp. 199\u2013208. IEEE (2010)","DOI":"10.1109\/QEST.2010.35"},{"issue":"2","key":"17_CR21","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1007\/s00224-013-9516-6","volume":"54","author":"P. Martyugin","year":"2014","unstructured":"Martyugin, P.: Computational complexity of certain problems related to carefully synchronizing words for partial automata and directing words for nondeterministic automata. Theory Comput. Syst.\u00a054(2), 293\u2013304 (2014)","journal-title":"Theory Comput. Syst."},{"key":"17_CR22","doi-asserted-by":"crossref","unstructured":"Vardi, M.Y.: Automatic verification of probabilistic concurrent finite-state programs. In: Proc. of FOCS, pp. 327\u2013338. IEEE Computer Society (1985)","DOI":"10.1109\/SFCS.1985.12"},{"key":"17_CR23","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 Cerny 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","CONCUR 2014 \u2013 Concurrency Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-44584-6_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,4]],"date-time":"2025-05-04T09:41:02Z","timestamp":1746351662000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-44584-6_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783662445839","9783662445846"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-44584-6_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}