Finitary winning in -regular games

DOI10.1145/1614431.1614432MaRDI QIDQ2946587zbMATH OpenOpenAlexFDO

Authors Krishnendu Chatterjee, Florian Horn, Thomas A. Henzinger

Publication date 17 September 2015

Published in ACM Transactions on Computational Logic (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/1614431.1614432

zbMATH Keywords

{\(\omega\)}-regular objectivesfinitary objectivesgames on graphsmodel checking

Mathematics Subject Classification ID

Games on graphs (graph-theoretic aspects) (05C57) Analysis of algorithms and problem complexity (68Q25) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• Tools and Algorithms for the Construction and Analysis of Systems
• Faster Algorithms for Finitary Games
• Stochastic Games with Finitary Objectives
• Cost-parity and cost-Streett games
• Infinite-state games with finitary conditions

Cited in

(43)

• Solving parity games via priority promotion
• A delayed promotion policy for parity games
• Cycle detection in computation tree logic
• Quantitative reductions and vertex-ranked infinite games
• Timed games with bounded window parity objectives
• Hierarchical cost-parity games
• Game-theoretic semantics for \(\mathrm{ATL}^+\) with applications to model checking
• Synthesizing optimally resilient controllers
• Alternating-time temporal logic ATL with finitely bounded semantics
• Looking at mean-payoff and total-payoff through windows
• Parameterized linear temporal logics meet costs: still not costlier than LTL
• Prompt interval temporal logic
• On promptness in parity games
• Delay games with WMSO+U winning conditions
• Finitary languages
• Graph games on ordinals
• Explicit Muller games are PTIME
• Stochastic Games with Finitary Objectives
• Delay games with WMSO+U winning conditions
• Quantitative reductions and vertex-ranked infinite games
• Obliging games
• Optimal bounds in parametric LTL games
• Improved algorithms for one-pair and k-pair Streett objectives
• Down the Borel hierarchy: solving Muller games via safety games
• Concurrent games and semi-random determinacy
• Parameterized linear temporal logics meet costs: still not costlier than LTL
• Window parity games: an alternative approach toward parity games with time bounds
• scientific article; zbMATH DE number 7439738 (Why is no real title available?)
• Optimal strategies in weighted limit games
• Games where you can play optimally with arena-independent finite memory
• Quantifying Bounds in Strategy Logic
• scientific article; zbMATH DE number 7533361 (Why is no real title available?)
• Extending Finite-Memory Determinacy by Boolean Combination of Winning Conditions
• Life is random, time is not: Markov decision processes with window objectives
• Deciding the Winner of an Arbitrary Finite Poset Game Is PSPACE-Complete
• On Reachability Games of Ordinal Length
• Faster Algorithms for Finitary Games
• Life is random, time is not: Markov decision processes with window objectives
• Tools and Algorithms for the Construction and Analysis of Systems
• Characterizing positionality in games of Infinite duration over infinite graphs
• Stochastic window mean-payoff games
• Stochastic window mean-payoff games
• Faster algorithms for bounded liveness in graphs and game graphs

This page was built for publication: Finitary winning in \({\omega}\)-regular games

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2946587)