{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,17]],"date-time":"2025-01-17T13:40:21Z","timestamp":1737121221285,"version":"3.33.0"},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2025,1,17]],"date-time":"2025-01-17T00:00:00Z","timestamp":1737072000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0"},{"start":{"date-parts":[[2025,1,17]],"date-time":"2025-01-17T00:00:00Z","timestamp":1737072000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Sci Rep"],"DOI":"10.1038\/s41598-025-85589-9","type":"journal-article","created":{"date-parts":[[2025,1,17]],"date-time":"2025-01-17T13:03:55Z","timestamp":1737119035000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A synthesis method for zero-sum mean-payoff asynchronous probabilistic games"],"prefix":"10.1038","volume":"15","author":[{"given":"Wei","family":"Zhao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wanwei","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhiming","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tiexin","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,1,17]]},"reference":[{"key":"85589_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-33666-9_1","volume-title":"Model Driven Engineering Languages and Systems\u201415th International Conference, MODELS 2012, Innsbruck, Austria, September 30\u2013October 5, 2012. Proceedings. Lecture Notes in Computer Science","author":"TA Henzinger","year":"2012","unstructured":"Henzinger, T. A. Quantitative reactive models. In Model Driven Engineering Languages and Systems\u201415th International Conference, MODELS 2012, Innsbruck, Austria, September 30\u2013October 5, 2012. Proceedings. Lecture Notes in Computer Science Vol. 7590 (eds France, R. B. et al.) 1\u20132 (Springer, 2012). https:\/\/doi.org\/10.1007\/978-3-642-33666-9_1."},{"key":"85589_CR2","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1016\/j.tcs.2017.03.038","volume":"735","author":"P Hunter","year":"2018","unstructured":"Hunter, P., Pauly, A., P\u00e9rez, G. A. & Raskin, J. Mean-payoff games with partial observation. Theor. Comput. Sci. 735, 82\u2013110. https:\/\/doi.org\/10.1016\/j.tcs.2017.03.038 (2018).","journal-title":"Theor. Comput. Sci."},{"key":"85589_CR3","doi-asserted-by":"publisher","unstructured":"Chatterjee, K., Doyen, L., Gimbert, H. & Oualhadj, Y. Perfect-information stochastic mean-payoff parity games. In Foundations of Software Science and Computation Structures\u201417th International Conference, FOSSACS 2014, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2014, Grenoble, France, April 5\u201313, 2014, Proceedings. Lecture Notes in Computer Science Vol. 8412 (ed. Muscholl, A.) 210\u2013225 (Springer, 2014). https:\/\/doi.org\/10.1007\/978-3-642-54830-7_14.","DOI":"10.1007\/978-3-642-54830-7_14"},{"key":"85589_CR4","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1016\/j.ic.2015.03.001","volume":"241","author":"Y Velner","year":"2015","unstructured":"Velner, Y. et al. The complexity of multi-mean-payoff and multi-energy games. Inf. Comput. 241, 177\u2013196. https:\/\/doi.org\/10.1016\/j.ic.2015.03.001 (2015).","journal-title":"Inf. Comput."},{"key":"85589_CR5","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/s10703-010-0105-x","volume":"38","author":"L Brim","year":"2011","unstructured":"Brim, L., Chaloupka, J., Doyen, L., Gentilini, R. & Raskin, J. Faster algorithms for mean-payoff games. Formal Methods Syst. Des. 38, 97\u2013118. https:\/\/doi.org\/10.1007\/s10703-010-0105-x (2011).","journal-title":"Formal Methods Syst. Des."},{"key":"85589_CR6","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1016\/S0304-3975(03)00427-4","volume":"310","author":"H Bj\u00f6rklund","year":"2004","unstructured":"Bj\u00f6rklund, H., Sandberg, S. & Vorobyov, S. G. Memoryless determinacy of parity and mean payoff games: a simple proof. Theor. Comput. Sci. 310, 365\u2013378. https:\/\/doi.org\/10.1016\/S0304-3975(03)00427-4 (2004).","journal-title":"Theor. Comput. Sci."},{"key":"85589_CR7","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1016\/0304-3975(95)00188-3","volume":"158","author":"U Zwick","year":"1996","unstructured":"Zwick, U. & Paterson, M. The complexity of mean payoff games on graphs. Theor. Comput. Sci. 158, 343\u2013359. https:\/\/doi.org\/10.1016\/0304-3975(95)00188-3 (1996).","journal-title":"Theor. Comput. Sci."},{"key":"85589_CR8","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1016\/j.ic.2016.10.011","volume":"254","author":"V Bruy\u00e8re","year":"2017","unstructured":"Bruy\u00e8re, V., Filiot, E., Randour, M. & Raskin, J. Meet your expectations with guarantees: Beyond worst-case synthesis in quantitative games. Inf. Comput. 254, 259\u2013295. https:\/\/doi.org\/10.1016\/j.ic.2016.10.011 (2017).","journal-title":"Inf. Comput."},{"key":"85589_CR9","first-page":"210","volume":"29","author":"A Church","year":"1964","unstructured":"Church, A. Logic, arithmetic, and automata. J. Symb. Logic 29, 210 (1964).","journal-title":"J. Symb. Logic"},{"key":"85589_CR10","doi-asserted-by":"publisher","first-page":"652","DOI":"10.1007\/BFb0035790","volume-title":"Automata, Languages and Programming, 16th International Colloquium, ICALP89, Stresa, Italy, July 11\u201315, 1989, Proceedings. Lecture Notes in Computer Science","author":"A Pnueli","year":"1989","unstructured":"Pnueli, A. & Rosner, R. On the synthesis of an asynchronous reactive module. In Automata, Languages and Programming, 16th International Colloquium, ICALP89, Stresa, Italy, July 11\u201315, 1989, Proceedings. Lecture Notes in Computer Science Vol. 372 (eds Ausiello, G. et al.) 652\u2013671 (Springer, 1989). https:\/\/doi.org\/10.1007\/BFb0035790."},{"key":"85589_CR11","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1007\/3-540-45089-0_3","volume-title":"Implementation and Application of Automata, 8th International Conference, CIAA 2003, Santa Barbara, California, USA, July 16\u201318, 2003, Proceedings. Lecture Notes in Computer Science","author":"N Wallmeier","year":"2003","unstructured":"Wallmeier, N., H\u00fctten, P. & Thomas, W. Symbolic synthesis of finite-state controllers for request-response specifications. In Implementation and Application of Automata, 8th International Conference, CIAA 2003, Santa Barbara, California, USA, July 16\u201318, 2003, Proceedings. Lecture Notes in Computer Science Vol. 2759 (eds Ibarra, O. H. & Dang, Z.) 11\u201322 (Springer, 2003). https:\/\/doi.org\/10.1007\/3-540-45089-0_3."},{"key":"85589_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/963927.963928","volume":"5","author":"R Alur","year":"2004","unstructured":"Alur, R. & Torre, S. L. Deterministic generators and games for ltl fragments. ACM Trans. Comput. Log. 5, 1\u201325. https:\/\/doi.org\/10.1145\/963927.963928 (2004).","journal-title":"ACM Trans. Comput. Log."},{"key":"85589_CR13","doi-asserted-by":"publisher","unstructured":"Harding, A., Ryan, M. & Schobbens, P. A new algorithm for strategy synthesis in LTL games. In Tools and Algorithms for the Construction and Analysis of Systems, 11th International Conference, TACAS 2005, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2005, Edinburgh, UK, April 4\u20138, 2005, Proceedings. Lecture Notes in Computer Science Vol. 3440 (eds Halbwachs, N. & Zuck, L. D.) 477\u2013492 (Springer, 2005). https:\/\/doi.org\/10.1007\/978-3-540-31980-1_31.","DOI":"10.1007\/978-3-540-31980-1_31"},{"key":"85589_CR14","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1007\/11513988_23","volume-title":"Computer Aided Verification, 17th International Conference, CAV 2005, Edinburgh, Scotland, UK, July 6\u201310, 2005, Proceedings. Lecture Notes in Computer Science","author":"B Jobstmann","year":"2005","unstructured":"Jobstmann, B., Griesmayer, A. & Bloem, R. Program repair as a game. In Computer Aided Verification, 17th International Conference, CAV 2005, Edinburgh, Scotland, UK, July 6\u201310, 2005, Proceedings. Lecture Notes in Computer Science Vol. 3576 (eds Etessami, K. & Rajamani, S. K.) 226\u2013238 (Springer, 2005). https:\/\/doi.org\/10.1007\/11513988_23."},{"key":"85589_CR15","doi-asserted-by":"publisher","first-page":"911","DOI":"10.1016\/j.jcss.2011.08.007","volume":"78","author":"R Bloem","year":"2012","unstructured":"Bloem, R., Jobstmann, B., Piterman, N., Pnueli, A. & Sa\u2019ar, Y. Synthesis of reactive(1) designs. J. Comput. Syst. Sci. 78, 911\u2013938. https:\/\/doi.org\/10.1016\/j.jcss.2011.08.007 (2012).","journal-title":"J. Comput. Syst. Sci."},{"key":"85589_CR16","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/BF01768705","volume":"8","author":"A Ehrenfeucht","year":"1979","unstructured":"Ehrenfeucht, A. & Mycielski, J. Positional strategies for mean payoff games. Int. J. Game Theory 8, 109\u2013113 (1979).","journal-title":"Int. J. Game Theory"},{"key":"85589_CR17","doi-asserted-by":"publisher","first-page":"482","DOI":"10.1007\/978-3-642-23217-6_32","volume-title":"CONCUR 2011\u2014Concurrency Theory\u201422nd International Conference, CONCUR 2011, Aachen, Germany, September 6\u20139, 2011. Proceedings. Lecture Notes in Computer Science","author":"M Ummels","year":"2011","unstructured":"Ummels, M. & Wojtczak, D. The complexity of Nash equilibria in limit-average games. In CONCUR 2011\u2014Concurrency Theory\u201422nd International Conference, CONCUR 2011, Aachen, Germany, September 6\u20139, 2011. Proceedings. Lecture Notes in Computer Science Vol. 6901 (eds Katoen, J. & K\u00f6nig, B.) 482\u2013496 (Springer, 2011). https:\/\/doi.org\/10.1007\/978-3-642-23217-6_32."},{"key":"85589_CR18","doi-asserted-by":"publisher","first-page":"192","DOI":"10.1007\/978-3-642-15375-4_14","volume-title":"CONCUR 2010\u2014Concurrency Theory, 21st International Conference, CONCUR 2010, Paris, France, August 31\u2013September 3, 2010. Proceedings. Lecture Notes in Computer Science","author":"P Bouyer","year":"2010","unstructured":"Bouyer, P., Brenguier, R. & Markey, N. Nash equilibria for reachability objectives in multi-player timed games. In CONCUR 2010\u2014Concurrency Theory, 21st International Conference, CONCUR 2010, Paris, France, August 31\u2013September 3, 2010. Proceedings. Lecture Notes in Computer Science Vol. 6269 (eds Gastin, P. & Laroussinie, F.) 192\u2013206 (Springer, 2010). https:\/\/doi.org\/10.1007\/978-3-642-15375-4_14."},{"key":"85589_CR19","doi-asserted-by":"publisher","unstructured":"Chatterjee, K., Henzinger, T.\u00a0A. & Jurdzinski, M. Mean-payoff parity games. In 20th IEEE Symposium on Logic in Computer Science (LICS 2005), 26-29 June 2005, Chicago, IL, USA, Proceedings 178\u2013187 (IEEE Computer Society, 2005). https:\/\/doi.org\/10.1109\/LICS.2005.26","DOI":"10.1109\/LICS.2005.26"},{"key":"85589_CR20","doi-asserted-by":"publisher","unstructured":"Chatterjee, K., Kom\u00e1rkov\u00e1, Z. & Kret\u00ednsk\u00fd, J. Unifying two views on multiple mean-payoff objectives in Markov decision processes. In 30th Annual ACM\/IEEE Symposium on Logic in Computer Science, LICS 2015, Kyoto, Japan, July 6\u201310, 2015 244\u2013256 (IEEE Computer Society, 2015). https:\/\/doi.org\/10.1109\/LICS.2015.32","DOI":"10.1109\/LICS.2015.32"},{"key":"85589_CR21","doi-asserted-by":"publisher","first-page":"9:1","DOI":"10.4230\/LIPIcs.CONCUR.2016.9","volume-title":"27th International Conference on Concurrency Theory, CONCUR 2016, August 23\u201326, 2016, Qu\u00e9bec City, Canada. LIPIcs","author":"S Almagor","year":"2016","unstructured":"Almagor, S., Kupferman, O. & Velner, Y. Minimizing expected cost under hard Boolean constraints, with applications to quantitative synthesis. In 27th International Conference on Concurrency Theory, CONCUR 2016, August 23\u201326, 2016, Qu\u00e9bec City, Canada. LIPIcs Vol. 59 (eds Desharnais, J. & Jagadeesan, R.) 9:1-9:15 (Schloss Dagstuhl-Leibniz-Zentrum f\u00fcr Informatik, 2016). https:\/\/doi.org\/10.4230\/LIPIcs.CONCUR.2016.9."},{"key":"85589_CR22","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-22993-0_21","author":"M Jim\u00e9nez-Liz\u00e1rraga","year":"2024","unstructured":"Jim\u00e9nez-Liz\u00e1rraga, M., Escobedo-Trujillo, B. A. & L\u00f3pez-Barrientos, J. D. Mixed deterministic and stochastic disturbances in a discrete-time Nash game. Int. J. Syst. Sci.[SPACE]https:\/\/doi.org\/10.1007\/978-3-642-22993-0_21 (2024).","journal-title":"Int. J. Syst. Sci."},{"key":"85589_CR23","doi-asserted-by":"publisher","first-page":"19","DOI":"10.3390\/g13010019","volume":"13","author":"J Gutierrez","year":"2022","unstructured":"Gutierrez, J., Steeples, T. & Wooldridge, M. Mean-payoff games with $$\\omega$$-regular specifications. Games 13, 19 (2022).","journal-title":"Games"},{"key":"85589_CR24","doi-asserted-by":"publisher","unstructured":"Clemente, L. & Raskin, J. Multidimensional beyond worst-case and almost-sure problems for mean-payoff objectives. In 30th Annual ACM\/IEEE Symposium on Logic in Computer Science, LICS 2015, Kyoto, Japan, July 6\u201310, 2015 257\u2013268 (IEEE Computer Society, 2015). https:\/\/doi.org\/10.1109\/LICS.2015.33","DOI":"10.1109\/LICS.2015.33"},{"key":"85589_CR25","volume-title":"Markov Decision Processes: Discrete Stochastic Dynamic Programming","author":"ML Puterman","year":"2014","unstructured":"Puterman, M. L. Markov Decision Processes: Discrete Stochastic Dynamic Programming (Wiley, 2014)."},{"key":"85589_CR26","doi-asserted-by":"publisher","first-page":"206","DOI":"10.1007\/978-3-642-22993-0_21","volume-title":"Mathematical Foundations of Computer Science 2011\u201436th International Symposium, MFCS 2011, Warsaw, Poland, August 22\u201326, 2011. Proceedings. Lecture Notes in Computer Science","author":"K Chatterjee","year":"2011","unstructured":"Chatterjee, K. & Doyen, L. Energy and mean-payoff parity Markov decision processes. In Mathematical Foundations of Computer Science 2011\u201436th International Symposium, MFCS 2011, Warsaw, Poland, August 22\u201326, 2011. Proceedings. Lecture Notes in Computer Science Vol. 3907 (eds Murlak, F. & Sankowski, P.) 206\u2013218 (Springer, 2011). https:\/\/doi.org\/10.1007\/978-3-642-22993-0_21."},{"key":"85589_CR27","doi-asserted-by":"publisher","DOI":"10.1080\/01969722.2023.2175492","author":"JD L\u00f3pez-Barrientos","year":"2023","unstructured":"L\u00f3pez-Barrientos, J. D., Jim\u00e9nez-Liz\u00e1rraga, M. & Escobedo-Trujillo, B. A. On the discrete-time minimum principle in multiple-mode systems. Cybern. Syst.[SPACE]https:\/\/doi.org\/10.1080\/01969722.2023.2175492 (2023).","journal-title":"Cybern. Syst."},{"key":"85589_CR28","doi-asserted-by":"publisher","DOI":"10.1007\/s11704-020-0076-z","volume":"16","author":"W Zhao","year":"2022","unstructured":"Zhao, W., Li, R., Liu, W., Dong, W. & Liu, Z. Probabilistic synthesis against GR(1) winning condition. Front. Comput. Sci. 16, 162203. https:\/\/doi.org\/10.1007\/s11704-020-0076-z (2022).","journal-title":"Front. Comput. Sci."}],"container-title":["Scientific Reports"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.nature.com\/articles\/s41598-025-85589-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.nature.com\/articles\/s41598-025-85589-9","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.nature.com\/articles\/s41598-025-85589-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,17]],"date-time":"2025-01-17T13:03:58Z","timestamp":1737119038000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.nature.com\/articles\/s41598-025-85589-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,1,17]]},"references-count":28,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2025,12]]}},"alternative-id":["85589"],"URL":"https:\/\/doi.org\/10.1038\/s41598-025-85589-9","relation":{},"ISSN":["2045-2322"],"issn-type":[{"value":"2045-2322","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,1,17]]},"assertion":[{"value":"31 August 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 January 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 January 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"2291"}}