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

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

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Games on graphs (graph-theoretic aspects) (05C57) 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

(41)

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

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)