Infinite-state games with finitary conditions
نویسندگان
چکیده
We study two-player zero-sum games over infinite-state graphs with boundedness conditions. Our first contribution is about the strategy complexity, i.e the memory required for winning strategies: we prove that over general infinite-state graphs, memoryless strategies are sufficient for finitary Büchi games, and finite-memory suffices for finitary parity games. We then study pushdown boundedness games, with two contributions. First we prove a collapse result for pushdown ωB games, implying the decidability of solving these games. Second we consider pushdown games with finitary parity along with stack boundedness conditions, and show that solving these games is EXPTIME-complete.
منابع مشابه
Finitary logics for coalgebras with branching
The purpose of this dissertation is to further previous work on coalgebras as infinite statebased transition systems and their logical characterisation with particular focus on infinite regular behaviour and branching. Finite trace semantics is well understood [DR95] for nondeterministic labelled transition systems, and has recently [Jac04, HJS06] been generalised to a coalgebraic level where m...
متن کاملFinitary Winning in ω-Regular Games
Games on graphs with ω-regular objectives provide a model for the control and synthesis of reactive systems. Every ω-regular objective can be decomposed into a safety part and a liveness part. The liveness part ensures that something good happens “eventually.” Two main strengths of the classical, infinite-limit formulation of liveness are robustness (independence from the granularity of transit...
متن کاملCost-Parity and Cost-Streett Games
We consider two-player games played on finite graphs equipped with costs on edges and introduce two winning conditions, cost-parity and cost-Streett, which require bounds on the cost between requests and their responses. Both conditions generalize the corresponding classical ω-regular conditions as well as the corresponding finitary conditions. For cost-parity games we show that the first playe...
متن کاملPerfect simulation and finitary coding for multicolor systems with interactions of infinite range
We consider a particle system on Z with finite state space and interactions of infinite range. Assuming that the rate of change is continuous and decays sufficiently fast, we introduce a perfect simulation algorithm for the stationary process. The basic tool we use is a representation of the infinite range change rates as a mixture of finite range change rates. The perfect simulation scheme pro...
متن کاملParity and Streett Games with Costs
We study two-player games played on finite graphs equipped with costs on edges and introduce two winning conditions, cost-parity and cost-Streett, which require bounds on the cost between requests and their responses. Both conditions generalize the corresponding classical omega-regular conditions and the corresponding finitary conditions. For parity games with costs we show that the first playe...
متن کامل