article

Note on winning positions on pushdown games with ω-regular conditions

Author:

Olivier SerreAuthors Info & Claims

Information Processing Letters, Volume 85, Issue 6

Pages 285 - 291

https://doi.org/10.1016/S0020-0190(02)00445-3

Published: 31 March 2003 Publication History

Abstract

We consider infinite two-player games on pushdown graphs. For parity winning conditions, we show that the set of winning positions of each player is regular and we give an effective construction of an alternating automaton recognizing it. This provides a DEXPTIME procedure to decide whether a position is winning for a given player. Finally, using the same methods, we show, for any Ω-regular winning condition, that the set of winning positions for a given player is regular and effective.

References

[1]

{1} T. Cachat, Uniform solution of parity games on prefix-recognizable graphs, To appear in ENTCS http://www- i7.informatik.rwth-aachen.de/~cachat.

Google Scholar

[2]

{2} T. Cachat, Symbolic strategy synthesis for games on pushdown graphs, in: Proceedings of ICALP'02, in: Lecture Notes in Computer Science, Vol. 2380, Springer, Berlin, 2002, pp. 704- 715.

Crossref

Google Scholar

[3]

{3} K. Chandra, D. Kozen, J. Stockmeyer, Alternation, J. ACM 28 (1) (1981) 114-133.

Digital Library

Google Scholar

[4]

{4} E.A. Emerson, C.S. Jutla, Tree automata, mu-calculus and determinacy (extended abstract), in: IEEE Symposium on Foundations of Computer Science (FOCS), 1991, pp. 368-377.

Crossref

Google Scholar

[5]

{5} J. Esparza, D. Hansel, P. Rossmanith, S. Schwoon, Efficient algorithms for model checking pushdown systems, in: Proceedings of CAV'00, in: Lecture Notes in Computer Science, Vol. 1855, Springer, Berlin, 2000, pp. 232-247.

Crossref

Google Scholar

[6]

{6} O. Kupferman, M.Y. Vardi, An automata-theoretic approach to reasoning about infinite-state systems, in: Proceedings of CAV'00, in: Lecture Notes in Computer Science, Vol. 1855, Springer, Berlin, 2000, pp. 36-52.

Crossref

Google Scholar

[7]

{7} R. McNaughton, Infinite games played on finite graphs, Ann. Pure Appl. Logic 65 (1993) 149-184.

Crossref

Google Scholar

[8]

{8} A.W. Mostowski, Regular expressions for infinite trees and a standard form for automata, in: Computation Theory, in: Lecture Notes in Computer Science, Vol. 208, Springer, Berlin, 1984, pp. 157-168.

Google Scholar

[9]

{9} D. Muller, P. Schupp, The theory of ends, pushdown automata, and second-order logic, Theoret. Comput. Sci. 37 (1985) 51- 75.

Crossref

Google Scholar

[10]

{10} W. Thomas, On the synthesis of strategies in infinite games, in: Proceedings of STACS'95, in: Lecture Notes in Computer Science, Vol. 900, Springer, Berlin, 1995, pp. 1-13.

Google Scholar

[11]

{11} I. Walukiewicz, Pushdown processes: games and model checking, Inform. and Comput. 164 (2001) 234-263.

Digital Library

Google Scholar

[12]

{12} W. Zielonka, Infinite games on finitely coloured graphs with applications to automata on infinite trees, Theoret. Comput. Sci. 200 (1-2) (1998) 135-183.

Digital Library

Google Scholar

Cited By

View all

Broadbent CCarayol AHague MMurawski AOng CSerre O(2021)Collapsible Pushdown Parity GamesACM Transactions on Computational Logic10.1145/345721422:3(1-51)Online publication date: 28-Jun-2021
https://dl.acm.org/doi/10.1145/3457214
Coester CSchwentick TSchuster M(2019)Winning Strategies for Streaming Rewriting GamesFundamentals of Computation Theory10.1007/978-3-030-25027-0_4(49-63)Online publication date: 12-Aug-2019
https://dl.acm.org/doi/10.1007/978-3-030-25027-0_4
Chen TSong FWu Z(2016)Verifying pushdown multi-agent systems against strategy logicsProceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence10.5555/3060621.3060647(180-186)Online publication date: 9-Jul-2016
https://dl.acm.org/doi/10.5555/3060621.3060647
Show More Cited By

Index Terms

Note on winning positions on pushdown games with ω-regular conditions

Recommendations

Omega-regular half-positional winning conditions
CSL'07/EACSL'07: Proceedings of the 21st international conference, and Proceedings of the 16th annuall conference on Computer Science Logic

We study infinite games where one of the players always has a positional (memory-less) winning strategy, while the other player may use a history-dependent strategy. We investigate winning conditions which guarantee such a property for all arenas, or ...
Quantitative solution of omega-regular games
STOC 2001

We consider two-player games played for an infinite number of rounds, with ω-regular winning conditions. The games may be concurrent, in that the players choose their moves simultaneously and independently, and probabilistic, in that the moves determine ...
Visibly pushdown games
FSTTCS'04: Proceedings of the 24th international conference on Foundations of Software Technology and Theoretical Computer Science

The class of visibly pushdown languages has been recently defined as a subclass of context-free languages with desirable closure properties and tractable decision problems. We study visibly pushdown games, which are games played on visibly pushdown ...

Comments

Information & Contributors

Information

Published In

Information Processing Letters Volume 85, Issue 6

31 March 2003

50 pages

ISSN:0020-0190

Issue’s Table of Contents

Publisher

Elsevier North-Holland, Inc.

United States

Publication History

Published: 31 March 2003

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

13
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 13 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Broadbent CCarayol AHague MMurawski AOng CSerre O(2021)Collapsible Pushdown Parity GamesACM Transactions on Computational Logic10.1145/345721422:3(1-51)Online publication date: 28-Jun-2021
https://dl.acm.org/doi/10.1145/3457214
Coester CSchwentick TSchuster M(2019)Winning Strategies for Streaming Rewriting GamesFundamentals of Computation Theory10.1007/978-3-030-25027-0_4(49-63)Online publication date: 12-Aug-2019
https://dl.acm.org/doi/10.1007/978-3-030-25027-0_4
Chen TSong FWu Z(2016)Verifying pushdown multi-agent systems against strategy logicsProceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence10.5555/3060621.3060647(180-186)Online publication date: 9-Jul-2016
https://dl.acm.org/doi/10.5555/3060621.3060647
Chen TSong FWu Z(2016)Global model checking on pushdown multi-agent systemsProceedings of the Thirtieth AAAI Conference on Artificial Intelligence10.5555/3016100.3016243(2459-2465)Online publication date: 12-Feb-2016
https://dl.acm.org/doi/10.5555/3016100.3016243
Song FTouili T(2011)Effcient CTL model-checking for pushdown systemsProceedings of the 22nd international conference on Concurrency theory10.5555/2040235.2040273(434-449)Online publication date: 6-Sep-2011
https://dl.acm.org/doi/10.5555/2040235.2040273
Hague MOng C(2011)A saturation method for the modal μ-calculus over pushdown systemsInformation and Computation10.1016/j.ic.2010.12.004209:5(799-821)Online publication date: 1-May-2011
https://dl.acm.org/doi/10.1016/j.ic.2010.12.004
Broadbent COng L(2009)On Global Model Checking Trees Generated by Higher-Order Recursion SchemesProceedings of the 12th International Conference on Foundations of Software Science and Computational Structures - Volume 550410.5555/3266641.3266657(107-121)Online publication date: 22-Mar-2009
https://dl.acm.org/doi/10.5555/3266641.3266657
Carayol ASlaats M(2008)Positional Strategies for Higher-Order Pushdown Parity GamesProceedings of the 33rd international symposium on Mathematical Foundations of Computer Science10.1007/978-3-540-85238-4_17(217-228)Online publication date: 25-Aug-2008
https://dl.acm.org/doi/10.1007/978-3-540-85238-4_17
Hague MOng C(2007)Symbolic backwards-reachability analysis for higher-order pushdown systemsProceedings of the 10th international conference on Foundations of software science and computational structures10.5555/1760037.1760055(213-227)Online publication date: 24-Mar-2007
https://dl.acm.org/doi/10.5555/1760037.1760055
Serre O(2006)Games with winning conditions of high Borel complexityTheoretical Computer Science10.1016/j.tcs.2005.10.024350:2(345-372)Online publication date: 7-Feb-2006
https://dl.acm.org/doi/10.1016/j.tcs.2005.10.024
Show More Cited By

Abstract

References

Cited By

Index Terms

Recommendations

Omega-regular half-positional winning conditions

Quantitative solution of omega-regular games

Visibly pushdown games

Comments

Information

Published In

Publisher

Publication History

Author Tags

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations