Prompt delay

DOI10.4230/LIPICS.FSTTCS.2016.43MaRDI QIDQ4636593zbMATH OpenFDO

Authors Felix Klein, Martín G. Zimmermann

Publication date 19 April 2018

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

zbMATH Keywords

infinite gamesLTLdelay gamesPrompt-LTL

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Automata and formal grammars in connection with logical questions (03D05) Specification and verification (program logics, model checking, etc.) (68Q60) Games involving graphs (91A43) Temporal logic (03B44)

Recommendations

• Delay games with WMSO+U winning conditions
• Delay games with WMSO+U winning conditions
• How Much Lookahead is Needed to Win Infinite Games?
• How much lookahead is needed to win infinite games?
• scientific article; zbMATH DE number 7297873

Cited in

(13)

• The complexity of transducer synthesis from multi-sequential specifications
• Delay games with WMSO+U winning conditions
• Delayed Acceptance ABC-SMC
• Games with delays -- a Frankenstein approach
• Some Delays do not matter
• Approximating the minimal lookahead needed to win infinite games
• Time delay
• Accurate response by postponement
• Delay games with WMSO+U winning conditions
• scientific article; zbMATH DE number 5257278 (Why is no real title available?)
• Finite-state strategies in delay games
• Finite-state strategies in delay games
• Promptness does not imply superlow cuppability

This page was built for publication: Prompt delay

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4636593)