Document Open Access Logo

The Memory of ω-Regular and BC(Σ⁰₂) Objectives

Authors Antonio Casares , Pierre Ohlmann

PDF

File

Thumbnail PDF
PDF
LIPIcs.ICALP.2025.149.pdf
  • Filesize: 0.95 MB
  • 18 pages

Document Identifiers

Related Versions

Subject Classification

ACM Subject Classification
  • Theory of computation → Logic and verification
Keywords
  • Infinite duration games
  • Strategy complexity
  • Omega-regular

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
    0
    Metadata Views

Abstract

In the context of 2-player zero-sum infinite duration games played on (potentially infinite) graphs, the memory of an objective is the smallest integer k such that in any game won by Eve, she has a strategy with ≤ k states of memory. For ω-regular objectives, checking whether the memory equals a given number k was not known to be decidable. In this work, we focus on objectives in BC(Σ⁰₂), i.e. recognised by a potentially infinite deterministic parity automaton. We provide a class of automata that recognise objectives with memory ≤ k, leading to the following results:  
- for ω-regular objectives, the memory can be computed in NP; 
- given two objectives W₁ and W₂ in BC(Σ⁰₂) and assuming W₁ is prefix-independent, the memory of W₁ ∪ W₂ is at most the product of the memories of W₁ and W₂.  Our results also apply to chromatic memory, the variant where strategies can update their memory state only depending on which colour is seen.

Cite As Get BibTex

Antonio Casares and Pierre Ohlmann. The Memory of ω-Regular and BC(Σ⁰₂) Objectives. In 52nd International Colloquium on Automata, Languages, and Programming (ICALP 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 334, pp. 149:1-149:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025) https://doi.org/10.4230/LIPIcs.ICALP.2025.149

Author Details

Antonio Casares
  • University of Warsaw, Poland
Pierre Ohlmann
  • CNRS, Laboratoire d'Informatique et des Systèmes (LIS), Marseille, France

Funding

  • Casares, Antonio: Supported by the Polish National Science Centre (NCN) grant "Polynomial finite state computation" (2022/46/A/ST6/00072).

Acknowledgements

We thank Nathan Lhote for his participation in the scientific discussions which led to this paper. We also thank Pierre Vandenhove for pointing us to references concerning lifting results for memory.

References

  1. Udi Boker and Karoliina Lehtinen. When a little nondeterminism goes a long way: An introduction to history-determinism. ACM SIGLOG News, 10(1):24-51, 2023. URL: https://doi.org/10.1145/3584676.3584682.
  2. Patricia Bouyer, Antonio Casares, Mickael Randour, and Pierre Vandenhove. Half-positional objectives recognized by deterministic Büchi automata. Log. Methods Comput. Sci., 20(3), 2024. URL: https://doi.org/10.46298/LMCS-20(3:19)2024.
  3. Patricia Bouyer, Nathanaël Fijalkow, Mickael Randour, and Pierre Vandenhove. How to play optimally for regular objectives? In ICALP, volume 261 of LIPIcs, pages 118:1-118:18, 2023. URL: https://doi.org/10.4230/LIPIcs.ICALP.2023.118.
  4. Patricia Bouyer, Mickael Randour, and Pierre Vandenhove. The true colors of memory: A tour of chromatic-memory strategies in zero-sum games on graphs (invited talk). In FSTTCS, volume 250 of LIPIcs, pages 3:1-3:18, 2022. URL: https://doi.org/10.4230/LIPICS.FSTTCS.2022.3.
  5. Patricia Bouyer, Mickael Randour, and Pierre Vandenhove. Characterizing omega-regularity through finite-memory determinacy of games on infinite graphs. TheoretiCS, 2, 2023. URL: https://doi.org/10.46298/THEORETICS.23.1.
  6. Patricia Bouyer, Stéphane Le Roux, Youssouf Oualhadj, Mickael Randour, and Pierre Vandenhove. Games where you can play optimally with arena-independent finite memory. Log. Methods Comput. Sci., 18(1), 2022. URL: https://doi.org/10.46298/LMCS-18(1:11)2022.
  7. J. Richard Büchi and Lawrence H. Landweber. Solving sequential conditions by finite-state strategies. Transactions of the American Mathematical Society, 138:295-311, 1969. URL: http://www.jstor.org/stable/1994916.
  8. Antonio Casares. On the minimisation of transition-based Rabin automata and the chromatic memory requirements of Muller conditions. In CSL, volume 216, pages 12:1-12:17, 2022. URL: https://doi.org/10.4230/LIPIcs.CSL.2022.12.
  9. Antonio Casares, Thomas Colcombet, and Karoliina Lehtinen. On the size of good-for-games Rabin automata and its link with the memory in Muller games. In ICALP, volume 229, pages 117:1-117:20, 2022. URL: https://doi.org/10.4230/LIPIcs.ICALP.2022.117.
  10. Antonio Casares and Pierre Ohlmann. Positional ω-regular languages. In LICS, pages 21:1-21:14. ACM, 2024. URL: https://doi.org/10.1145/3661814.3662087.
  11. Antonio Casares and Pierre Ohlmann. Positional ω-regular languages. CoRR, abs/2401.15384, 2024. URL: https://doi.org/10.48550/arXiv.2401.15384.
  12. Antonio Casares and Pierre Ohlmann. Characterising memory in infinite games. Logical Methods in Computer Science, Volume 21, Issue 1, March 2025. URL: https://doi.org/10.46298/lmcs-21(1:28)2025.
  13. Antonio Casares and Pierre Ohlmann. The memory of ω-regular and BC(Σ₂⁰) objectives. CoRR, abs/2502.05840, 2025. URL: https://doi.org/10.48550/arXiv.2502.05840.
  14. Edmund M. Clarke, I. A. Draghicescu, and Robert P. Kurshan. A unified approch for showing language inclusion and equivalence between various types of omega-automata. Inf. Process. Lett., 46(6):301-308, 1993. URL: https://doi.org/10.1016/0020-0190(93)90069-L.
  15. Edmund M. Clarke, Thomas A. Henzinger, Helmut Veith, and Roderick Bloem, editors. Handbook of Model Checking. Springer, Cham, 2018. URL: https://doi.org/10.1007/978-3-319-10575-8_2.
  16. Thomas Colcombet, Nathanaël Fijalkow, and Florian Horn. Playing safe. In FSTTCS, volume 29 of LIPIcs, pages 379-390, 2014. URL: https://doi.org/10.4230/LIPIcs.FSTTCS.2014.379.
  17. Thomas Colcombet, Nathanaël Fijalkow, and Florian Horn. Playing safe, ten years later. CoRR, abs/2212.12024, 2022. URL: https://doi.org/10.48550/arXiv.2212.12024.
  18. Thomas Colcombet and Damian Niwiński. On the positional determinacy of edge-labeled games. Theor. Comput. Sci., 352(1-3):190-196, 2006. URL: https://doi.org/10.1016/j.tcs.2005.10.046.
  19. Stefan Dziembowski, Marcin Jurdziński, and Igor Walukiewicz. How much memory is needed to win infinite games? In LICS, pages 99-110, 1997. URL: https://doi.org/10.1109/LICS.1997.614939.
  20. Olivier Finkel, Michał Skrzypczak, Ryszard Janicki, Slawomir Lasota, and Natalia Sidorova. On the expressive power of non-deterministic and unambiguous petri nets over infinite words. Fundamenta Informaticae, 183(3-4):243-291, 2022. URL: https://doi.org/10.3233/FI-2021-2088.
  21. Hugo Gimbert and Edon Kelmendi. Submixing and shift-invariant stochastic games, 2022. Version 2. URL: https://arxiv.org/abs/1401.6575v2.
  22. Hugo Gimbert and Wieslaw Zielonka. Games where you can play optimally without any memory. In CONCUR, volume 3653, pages 428-442, 2005. URL: https://doi.org/10.1007/11539452_33.
  23. Yuri Gurevich and Leo Harrington. Trees, automata, and games. In STOC, pages 60-65, 1982. URL: https://doi.org/10.1145/800070.802177.
  24. Eryk Kopczyński. Half-positional Determinacy of Infinite Games. PhD thesis, University of Warsaw, 2008. URL: https://www.mimuw.edu.pl/~erykk/papers/hpwc.pdf.
  25. Alexander Kozachinskiy. Energy games over totally ordered groups. In CSL, volume 288 of LIPIcs, pages 34:1-34:12, 2024. URL: https://doi.org/10.4230/LIPICS.CSL.2024.34.
  26. Pierre Ohlmann. Monotonic graphs for parity and mean-payoff games. (Graphes monotones pour jeux de parité et à paiement moyen). PhD thesis, Université Paris Cité, France, 2021. URL: https://tel.archives-ouvertes.fr/tel-03771185.
  27. Pierre Ohlmann. Characterizing positionality in games of infinite duration over infinite graphs. TheoretiCS, Volume 2, January 2023. URL: https://doi.org/10.46298/theoretics.23.3.
  28. Pierre Ohlmann and Michal Skrzypczak. Positionality in Σ₂⁰ and a completeness result. In STACS, volume 289, pages 54:1-54:18, 2024. URL: https://doi.org/10.4230/LIPICS.STACS.2024.54.
  29. Michal Skrzypczak. Topological extension of parity automata. Inf. Comput., 228:16-27, 2013. URL: https://doi.org/10.1016/J.IC.2013.06.004.
  30. Robert S. Streett and E. Allen Emerson. An automata theoretic decision procedure for the propositional mu-calculus. Inf. Comput., 81(3):249-264, 1989. URL: https://doi.org/10.1016/0890-5401(89)90031-X.
  31. Wolfgang Thomas. Automata on infinite objects. In Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics, 1991. URL: https://api.semanticscholar.org/CorpusID:33060294.
  32. Pierre Vandenhove. Strategy complexity of zero-sum games on graphs. (Complexité des stratégies des jeux sur graphes à somme nulle). PhD thesis, University of Mons, Belgium, 2023. URL: https://tel.archives-ouvertes.fr/tel-04095220.
  33. Igor Walukiewicz. Pushdown processes: Games and model checking. In CAV, volume 1102 of Lecture Notes in Computer Science, pages 62-74, 1996. URL: https://doi.org/10.1007/3-540-61474-5_58.
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2025 Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact