Parity and Streett Games with Costs

DOI10.2168/LMCS-10(2:14)2014zbMath1335.68137arXiv1207.0663OpenAlexW1967039025MaRDI QIDQ5495107

Nathanaël Fijalkow, Martín G. Zimmermann

Publication date: 31 July 2014

Published in: Logical Methods in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1207.0663

zbMATH Keywords

parity gamescostsStreett gameshalf-positional determinacy

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) 2-person games (91A05) Games involving graphs (91A43) Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05) Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items (19)

The Theory of Universal Graphs for Infinite Duration Games ⋮ Extending finite-memory determinacy to multi-player games ⋮ Delay Games with WMSO$$+$$U Winning Conditions ⋮ Unnamed Item ⋮ Parameterized linear temporal logics meet costs: still not costlier than LTL ⋮ Delay Games with WMSO+U Winning Conditions ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Hierarchical cost-parity games ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Solving parity games via priority promotion ⋮ Unnamed Item ⋮ A delayed promotion policy for parity games ⋮ Quantitative reductions and vertex-ranked infinite games ⋮ Quantifying Bounds in Strategy Logic ⋮ Synthesizing optimally resilient controllers ⋮ Alternating-time temporal logic ATL with finitely bounded semantics

This page was built for publication: Parity and Streett Games with Costs