Degrees of Lookahead in Regular Infinite Games
From MaRDI portal
Publication:3557856
DOI10.1007/978-3-642-12032-9_18zbMath1284.68401arXiv1209.0800OpenAlexW1555694000MaRDI QIDQ3557856
Łukasz Kaiser, Michael Holtmann, Wolfgang Thomas
Publication date: 27 April 2010
Published in: Foundations of Software Science and Computational Structures (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1209.0800
Applications of game theory (91A80) Specification and verification (program logics, model checking, etc.) (68Q60)
Related Items
Delay Games with WMSO+U Winning Conditions, Unnamed Item, Synthesizing Computable Functions from Rational Specifications Over Infinite Words, Unnamed Item, The per-character cost of repairing word languages, Synthesis of deterministic top-down tree transducers from automatic tree relations, How Much Lookahead is Needed to Win Infinite Games?, Infinite-Duration Bidding Games, Synthesizing structured reactive programs via deterministic tree automata
