Abstract
Half positionality is the property of a language of infinite words to admit positional winning strategies, when interpreted as the goal of a two-player game on a graph. Such problem applies to the automatic synthesis of controllers, where positional strategies represent efficient controllers. As our main result, we present a novel sufficient condition for half positionality, more general than what was previously known. Moreover, we compare our proposed condition with several others, proposed in the recent literature, outlining an intricate network of relationships, where only few combinations are sufficient for half positionality.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Explore related subjects
Discover the latest articles, news and stories from top researchers in related subjects.References
Cachat, T.: Symbolic strategy synthesis for games on pushdown graphs. In: Proc. 29th Int. Colloq. Automata, Languages and Programming (ICALP 02), Lect. Notes in Comp. Sci., vol. 2380, pp. 704–715. Springer, New York (2002)
Colcombet, T., Niwinski, D.: On the positional determinacy of edge-labeled games. Theor. Comp. Sci. 352(1–3), 190–196 (2006)
Emerson, E.A., Jutla, C.S.: Tree automata, mu-calculus and determinacy. In: Proc. 32nd IEEE Symp. Found. of Comp. Sci. (FOCS 91), pp. 368–377. IEEE Computer Society Press, Los Alamitos (1991)
Gimbert, H., Zielonka, W.: Games where you can play optimally without any memory. In: Proc. 16th Int. Conf. on Concurrency Theory (CONCUR 05), Lect. Notes in Comp. Sci., vol. 3653, pp. 428–442. Springer, New York (2005)
Gradel, E.: Positional determinancy of infinite games. In: Proc. 21th Symp. on Theor. Aspects of Comp. Sci. (STACS 04), Lect. Notes in Comp. Sci., vol. 2996, pp. 4–18. Springer, New York (2004)
Kopczyński, E.: Half-positional determinancy of infinite games. In: Proc. 33th Int. Colloq. Automata, Languages and Programming (ICALP 06), Lect. Notes in Comp. Sci., vol. 4052, pp. 336–347. Springer, New York (2006)
Kopczyński, E.: Omega-regular half-positional winning conditions. In: Proc. 16th EACSL Conf. on Comp. Sci. and Logic (CSL 07), Lect. Notes in Comp. Sci., vol. 4646, pp. 41–53. Springer, New York (2007)
Kupferman, O., Vardi, M.Y., Wolper, P.: Module checking. Inf. Comput. 164, 322–344 (2001)
Manna, Z., Pnueli, A.: The Temporal Logic of Reactive and Concurrent Systems: Specification. Springer, New York (1991)
McNaughton, R.: Infinite games played on finite graphs. Ann. Pure Appl. Logic 65, 149–184 (1993)
Mostowski, A.W.: Games with Forbidden Positions. Technical Report 78, Uniwersytet Gdański, Instytut Matematyki (1991)
Thomas, W.: On the synthesis of strategies in infinite games. In: Proc. 12th Symp. on Theor. Aspects of Comp. Sci. (STACS 95), Lect. Notes in Comp. Sci., vol. 900, p. 1–13. Springer, New York (1995)
Zielonka, W.: Infinite games on finitely coloured graphs with applications to automata on infinite trees. Theor. Comp. Sci. 200(1–2), 135–183 (1998)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Bianco, A., Faella, M., Mogavero, F. et al. Exploring the boundary of half-positionality. Ann Math Artif Intell 62, 55–77 (2011). https://doi.org/10.1007/s10472-011-9250-1
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10472-011-9250-1