Finitary winning in ω-regular games

DOI10.1145/1614431.1614432zbMath1351.68156OpenAlexW2015287249MaRDI QIDQ2946587

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

model checkinggames on graphs{\(\omega\)}-regular objectivesfinitary objectives

Mathematics Subject Classification ID

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

Related Items (28)

Stochastic Games with Finitary Objectives ⋮ Delay Games with WMSO$$+$$U Winning Conditions ⋮ Parameterized linear temporal logics meet costs: still not costlier than LTL ⋮ Optimal bounds in parametric LTL games ⋮ Delay Games with WMSO+U Winning Conditions ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Hierarchical cost-parity games ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Game-theoretic semantics for \(\mathrm{ATL}^+\) with applications to model checking ⋮ Down the Borel hierarchy: solving Muller games via safety games ⋮ Solving parity games via priority promotion ⋮ Unnamed Item ⋮ A delayed promotion policy for parity games ⋮ Cycle detection in computation tree logic ⋮ Quantitative reductions and vertex-ranked infinite games ⋮ Quantifying Bounds in Strategy Logic ⋮ Synthesizing optimally resilient controllers ⋮ Prompt Interval Temporal Logic ⋮ Unnamed Item ⋮ Alternating-time temporal logic ATL with finitely bounded semantics ⋮ Looking at mean-payoff and total-payoff through windows ⋮ Timed games with bounded window parity objectives

This page was built for publication: Finitary winning in ω-regular games