Abstract
Stochastic games play an important role for many purposes such as the control of cyber-physical systems (CPS), where the controller and the environment are modeled as players. Conventional algorithms typically solve the game for a single winning strategy in order to develop a controller. However, in applications such as CPS control, permissive controllers are crucial as they allow the controlled system to adapt if additional constraints need to be imposed and also remain resilient to system changes at runtime. In this work, we generalize the concept of permissive winning strategy templates, introduced by Anand et al. at TACAS and CAV 2023 for deterministic games, to encompass stochastic games. These templates represent an infinite number of winning strategies and can adapt strategies to system changes efficiently. We focus on five key winning objectives—safety, reachability, Büchi, co-Büchi, and parity—and present algorithms to construct templates for each objective. In addition, we propose a novel method to extract a winning strategy from a template and provide discussions on template comparison.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
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–228. Springer, Heidelberg (2023). https://doi.org/10.1007/978-3-031-30820-8_15
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–458. Springer, Heidelberg (2023). https://doi.org/10.1007/978-3-031-37706-8_22
Baier, C., Katoen, J.: Principles of Model Checking. MIT Press, Cambridge (2008)
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–98. Springer, Cham (2022). https://doi.org/10.1007/978-3-030-99527-0_5
Bernet, J., Janin, D., Walukiewicz, I.: Permissive strategies: from parity games to safety games. RAIRO-Theor. Inf. Appl.-Informatique Théorique et Applications 36(3), 261–275 (2002)
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–210. Springer, Heidelberg (2009). https://doi.org/10.1007/978-3-642-04081-8_14
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–149. Springer, Heidelberg (2011). https://doi.org/10.1007/978-3-642-24372-1_11
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–263 (2017)
Chatterjee, K., Jurdziński, M., Henzinger, T.A.: Simple stochastic parity games. In: Baaz, M., Makowsky, J.A. (eds.) CSL 2003. LNCS, vol. 2803, pp. 100–113. Springer, Heidelberg (2003). https://doi.org/10.1007/978-3-540-45220-1_11
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–1034 (2011)
Klein, J., Baier, C., Klüppelholz, S.: Compositional construction of most general controllers. Acta Informatica 52(4), 443–482 (2015)
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–447. Springer, Heidelberg (2009). https://doi.org/10.1007/978-3-642-04081-8_29
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–106. Springer, Heidelberg (2009). https://doi.org/10.1007/978-3-642-00768-2_10
Lv, P., Xu, Z., Ji, Y., Li, S., Yin, X.: Optimal supervisory control of discrete event systems for cyclic tasks. Automatica 164, 111634 (2024)
Ma, Z., Cai, K.: On resilient supervisory control against indefinite actuator attacks in discrete-event systems. IEEE Control Syst. Lett. 6, 2942–2947 (2022)
Neider, D., Rabinovich, R., Zimmermann, M.: Down the Borel hierarchy: solving Muller games via safety games. Theor. Comput. Sci. 560, 219–234 (2014)
Pruekprasert, S., Ushio, T., Kanazawa, T.: Quantitative supervisory control game for discrete event systems. IEEE Trans. Autom. Control 61(10), 2987–3000 (2015)
Ramadge, P.J., Wonham, W.M.: Supervisory control of a class of discrete event processes. SIAM J. Control. Optim. 25(1), 206–230 (1987)
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–640 (2019)
Sengupta, R., Lafortune, S.: An optimal control theory for discrete event systems. SIAM J. Control. Optim. 36(2), 488–541 (1998)
Tatsumoto, Y., Shiraishi, M., Cai, K.: Application of supervisory control theory with warehouse automation case study. Syst. Control Lett. 62(6), 203–208 (2018)
Tushar, W., et al.: A survey of cyber-physical systems from a game-theoretic perspective. IEEE Access 11, 9799–9834 (2023)
Zielonka, W.: Infinite games on finitely coloured graphs with applications to automata on infinite trees. Theor. Comput. Sci. 200(1–2), 135–183 (1998)
Acknowledgments
The authors would like to thank the reviewers for their comments on improving the manuscript. K. Phalakarn and I. Hasuo are supported by ERATO HASUO Metamathematics for Systems Design Project (No. JPMJER1603) and the ASPIRE grant No. JPMJAP2301, JST. S. Pruekprasert is supported by JSPS KAKENHI Grant Number JP22KK0155.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2025 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this paper
Cite this paper
Phalakarn, K., Pruekprasert, S., Hasuo, I. (2025). Winning Strategy Templates for Stochastic Parity Games Towards Permissive and Resilient Control. In: Anutariya, C., Bonsangue, M.M. (eds) Theoretical Aspects of Computing – ICTAC 2024. ICTAC 2024. Lecture Notes in Computer Science, vol 15373. Springer, Cham. https://doi.org/10.1007/978-3-031-77019-7_12
Download citation
DOI: https://doi.org/10.1007/978-3-031-77019-7_12
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-031-77018-0
Online ISBN: 978-3-031-77019-7
eBook Packages: Computer ScienceComputer Science (R0)