Advertisement

Exploring the boundary of half-positionality

  • Alessandro Bianco
  • Marco FaellaEmail author
  • Fabio Mogavero
  • Aniello Murano
Article

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.

Keywords

Games on graphs Memory Positionality 

Mathematics Subject Classification (2010)

05C57 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    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)Google Scholar
  2. 2.
    Colcombet, T., Niwinski, D.: On the positional determinacy of edge-labeled games. Theor. Comp. Sci. 352(1–3), 190–196 (2006)MathSciNetzbMATHCrossRefGoogle Scholar
  3. 3.
    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)Google Scholar
  4. 4.
    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)Google Scholar
  5. 5.
    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)Google Scholar
  6. 6.
    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)Google Scholar
  7. 7.
    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)Google Scholar
  8. 8.
    Kupferman, O., Vardi, M.Y., Wolper, P.: Module checking. Inf. Comput. 164, 322–344 (2001)MathSciNetzbMATHCrossRefGoogle Scholar
  9. 9.
    Manna, Z., Pnueli, A.: The Temporal Logic of Reactive and Concurrent Systems: Specification. Springer, New York (1991)zbMATHGoogle Scholar
  10. 10.
    McNaughton, R.: Infinite games played on finite graphs. Ann. Pure Appl. Logic 65, 149–184 (1993)MathSciNetzbMATHCrossRefGoogle Scholar
  11. 11.
    Mostowski, A.W.: Games with Forbidden Positions. Technical Report 78, Uniwersytet Gdański, Instytut Matematyki (1991)Google Scholar
  12. 12.
    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)Google Scholar
  13. 13.
    Zielonka, W.: Infinite games on finitely coloured graphs with applications to automata on infinite trees. Theor. Comp. Sci. 200(1–2), 135–183 (1998)MathSciNetzbMATHCrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media B.V. 2011

Authors and Affiliations

  • Alessandro Bianco
    • 1
  • Marco Faella
    • 1
    Email author
  • Fabio Mogavero
    • 1
  • Aniello Murano
    • 1
  1. 1.Università degli Studi di Napoli “Federico II”NapoliItaly

Personalised recommendations