{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,16]],"date-time":"2026-04-16T09:56:14Z","timestamp":1776333374291,"version":"3.51.2"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031770180","type":"print"},{"value":"9783031770197","type":"electronic"}],"license":[{"start":{"date-parts":[[2024,11,22]],"date-time":"2024-11-22T00:00:00Z","timestamp":1732233600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,11,22]],"date-time":"2024-11-22T00:00:00Z","timestamp":1732233600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025]]},"DOI":"10.1007\/978-3-031-77019-7_12","type":"book-chapter","created":{"date-parts":[[2024,11,21]],"date-time":"2024-11-21T20:47:59Z","timestamp":1732222079000},"page":"197-214","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Winning Strategy Templates for\u00a0Stochastic Parity Games Towards Permissive and\u00a0Resilient Control"],"prefix":"10.1007","author":[{"given":"Kittiphon","family":"Phalakarn","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sasinee","family":"Pruekprasert","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ichiro","family":"Hasuo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,11,22]]},"reference":[{"key":"12_CR1","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1007\/978-3-031-30820-8_15","volume-title":"TACS 2023","author":"A Anand","year":"2023","unstructured":"Anand, A., Mallik, K., Nayak, S.P., Schmuck, A.K.: Computing adequately permissive assumptions for synthesis. In: Sankaranarayanan, S., Sharygina, N. (eds.) TACS 2023, vol. 13994, pp. 211\u2013228. Springer, Heidelberg (2023). https:\/\/doi.org\/10.1007\/978-3-031-30820-8_15"},{"key":"12_CR2","doi-asserted-by":"publisher","first-page":"436","DOI":"10.1007\/978-3-031-37706-8_22","volume-title":"CAV 2023","author":"A Anand","year":"2023","unstructured":"Anand, A., Nayak, S.P., Schmuck, A.K.: Synthesizing permissive winning strategy templates for parity games. In: Enea, C., Lal, A. (eds.) CAV 2023, pp. 436\u2013458. Springer, Heidelberg (2023). https:\/\/doi.org\/10.1007\/978-3-031-37706-8_22"},{"key":"12_CR3","volume-title":"Principles of Model Checking","author":"C Baier","year":"2008","unstructured":"Baier, C., Katoen, J.: Principles of Model Checking. MIT Press, Cambridge (2008)"},{"key":"12_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1007\/978-3-030-99527-0_5","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"T Banerjee","year":"2022","unstructured":"Banerjee, T., Majumdar, R., Mallik, K., Schmuck, A.-K., Soudjani, S.: A direct symbolic algorithm for solving stochastic Rabin games. In: TACAS 2022. LNCS, vol. 13244, pp. 81\u201398. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-030-99527-0_5"},{"issue":"3","key":"12_CR5","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1051\/ita:2002013","volume":"36","author":"J Bernet","year":"2002","unstructured":"Bernet, J., Janin, D., Walukiewicz, I.: Permissive strategies: from parity games to safety games. RAIRO-Theor. Inf. Appl.-Informatique Th\u00e9orique et Applications 36(3), 261\u2013275 (2002)","journal-title":"RAIRO-Theor. Inf. Appl.-Informatique Th\u00e9orique et Applications"},{"key":"12_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"196","DOI":"10.1007\/978-3-642-04081-8_14","volume-title":"CONCUR 2009 - Concurrency Theory","author":"P Bouyer","year":"2009","unstructured":"Bouyer, P., Duflot, M., Markey, N., Renault, G.: Measuring permissivity in finite games. In: Bravetti, M., Zavattaro, G. (eds.) CONCUR 2009. LNCS, vol. 5710, pp. 196\u2013210. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-04081-8_14"},{"key":"12_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/978-3-642-24372-1_11","volume-title":"Automated Technology for Verification and Analysis","author":"P Bouyer","year":"2011","unstructured":"Bouyer, P., Markey, N., Olschewski, J., Ummels, M.: Measuring permissiveness in parity games: mean-payoff parity games revisited. In: Bultan, T., Hsiung, P.-A. (eds.) ATVA 2011. LNCS, vol. 6996, pp. 135\u2013149. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-24372-1_11"},{"key":"12_CR8","doi-asserted-by":"crossref","unstructured":"Calude, C.S., Jain, S., Khoussainov, B., Li, W., Stephan, F.: Deciding parity games in quasipolynomial time. In: Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, pp. 252\u2013263 (2017)","DOI":"10.1145\/3055399.3055409"},{"key":"12_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1007\/978-3-540-45220-1_11","volume-title":"Computer Science Logic","author":"K Chatterjee","year":"2003","unstructured":"Chatterjee, K., Jurdzi\u0144ski, M., Henzinger, T.A.: Simple stochastic parity games. In: Baaz, M., Makowsky, J.A. (eds.) CSL 2003. LNCS, vol. 2803, pp. 100\u2013113. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/978-3-540-45220-1_11"},{"issue":"5","key":"12_CR10","doi-asserted-by":"publisher","first-page":"1028","DOI":"10.1016\/j.automatica.2011.01.070","volume":"47","author":"Y Chen","year":"2011","unstructured":"Chen, Y., Li, Z.: Design of a maximally permissive liveness-enforcing supervisor with a compressed supervisory structure for flexible manufacturing systems. Automatica 47(5), 1028\u20131034 (2011)","journal-title":"Automatica"},{"issue":"4","key":"12_CR11","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1007\/s00236-015-0239-9","volume":"52","author":"J Klein","year":"2015","unstructured":"Klein, J., Baier, C., Kl\u00fcppelholz, S.: Compositional construction of most general controllers. Acta Informatica 52(4), 443\u2013482 (2015)","journal-title":"Acta Informatica"},{"key":"12_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1007\/978-3-642-04081-8_29","volume-title":"CONCUR 2009 - Concurrency Theory","author":"W Kuijper","year":"2009","unstructured":"Kuijper, W., van de Pol, J.: Compositional control synthesis for partially observable systems. In: Bravetti, M., Zavattaro, G. (eds.) CONCUR 2009. LNCS, vol. 5710, pp. 431\u2013447. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-04081-8_29"},{"key":"12_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1007\/978-3-642-00768-2_10","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"W Kuijper","year":"2009","unstructured":"Kuijper, W., van de Pol, J.: Computing weakest strategies for safety games of imperfect information. In: Kowalewski, S., Philippou, A. (eds.) TACAS 2009. LNCS, vol. 5505, pp. 92\u2013106. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-00768-2_10"},{"key":"12_CR14","doi-asserted-by":"publisher","DOI":"10.1016\/j.automatica.2024.111634","volume":"164","author":"P Lv","year":"2024","unstructured":"Lv, P., Xu, Z., Ji, Y., Li, S., Yin, X.: Optimal supervisory control of discrete event systems for cyclic tasks. Automatica 164, 111634 (2024)","journal-title":"Automatica"},{"key":"12_CR15","doi-asserted-by":"publisher","first-page":"2942","DOI":"10.1109\/LCSYS.2022.3168926","volume":"6","author":"Z Ma","year":"2022","unstructured":"Ma, Z., Cai, K.: On resilient supervisory control against indefinite actuator attacks in discrete-event systems. IEEE Control Syst. Lett. 6, 2942\u20132947 (2022)","journal-title":"IEEE Control Syst. Lett."},{"key":"12_CR16","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1016\/j.tcs.2014.01.017","volume":"560","author":"D Neider","year":"2014","unstructured":"Neider, D., Rabinovich, R., Zimmermann, M.: Down the Borel hierarchy: solving Muller games via safety games. Theor. Comput. Sci. 560, 219\u2013234 (2014)","journal-title":"Theor. Comput. Sci."},{"issue":"10","key":"12_CR17","doi-asserted-by":"publisher","first-page":"2987","DOI":"10.1109\/TAC.2015.2513901","volume":"61","author":"S Pruekprasert","year":"2015","unstructured":"Pruekprasert, S., Ushio, T., Kanazawa, T.: Quantitative supervisory control game for discrete event systems. IEEE Trans. Autom. Control 61(10), 2987\u20133000 (2015)","journal-title":"IEEE Trans. Autom. Control"},{"issue":"1","key":"12_CR18","doi-asserted-by":"publisher","first-page":"206","DOI":"10.1137\/0325013","volume":"25","author":"PJ Ramadge","year":"1987","unstructured":"Ramadge, P.J., Wonham, W.M.: Supervisory control of a class of discrete event processes. SIAM J. Control. Optim. 25(1), 206\u2013230 (1987)","journal-title":"SIAM J. Control. Optim."},{"issue":"5","key":"12_CR19","doi-asserted-by":"publisher","first-page":"619","DOI":"10.1504\/IJAAC.2019.101911","volume":"13","author":"S Rezig","year":"2019","unstructured":"Rezig, S., Ghorbel, C., Achour, Z., Rezg, N.: PLC-based implementation of supervisory control for flexible manufacturing systems using theory of regions. Int. J. Autom. Control 13(5), 619\u2013640 (2019)","journal-title":"Int. J. Autom. Control"},{"issue":"2","key":"12_CR20","doi-asserted-by":"publisher","first-page":"488","DOI":"10.1137\/S0363012994260957","volume":"36","author":"R Sengupta","year":"1998","unstructured":"Sengupta, R., Lafortune, S.: An optimal control theory for discrete event systems. SIAM J. Control. Optim. 36(2), 488\u2013541 (1998)","journal-title":"SIAM J. Control. Optim."},{"issue":"6","key":"12_CR21","first-page":"203","volume":"62","author":"Y Tatsumoto","year":"2018","unstructured":"Tatsumoto, Y., Shiraishi, M., Cai, K.: Application of supervisory control theory with warehouse automation case study. Syst. Control Lett. 62(6), 203\u2013208 (2018)","journal-title":"Syst. Control Lett."},{"key":"12_CR22","doi-asserted-by":"publisher","first-page":"9799","DOI":"10.1109\/ACCESS.2023.3239834","volume":"11","author":"W Tushar","year":"2023","unstructured":"Tushar, W., et al.: A survey of cyber-physical systems from a game-theoretic perspective. IEEE Access 11, 9799\u20139834 (2023)","journal-title":"IEEE Access"},{"issue":"1\u20132","key":"12_CR23","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1016\/S0304-3975(98)00009-7","volume":"200","author":"W Zielonka","year":"1998","unstructured":"Zielonka, W.: Infinite games on finitely coloured graphs with applications to automata on infinite trees. Theor. Comput. Sci. 200(1\u20132), 135\u2013183 (1998)","journal-title":"Theor. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Theoretical Aspects of Computing \u2013 ICTAC 2024"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-77019-7_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,21]],"date-time":"2024-11-21T21:29:52Z","timestamp":1732224592000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-77019-7_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,11,22]]},"ISBN":["9783031770180","9783031770197"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-77019-7_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,11,22]]},"assertion":[{"value":"22 November 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICTAC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Colloquium on Theoretical Aspects of Computing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Bangkok","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Thailand","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 November 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 November 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ictac2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ictac2024.cs.ait.ac.th\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}