Playing Safe, Ten Years Later

DOI10.46298/LMCS-20(1:10)2024MaRDI QIDQ6151559zbMATH OpenOpenAlexFDO

Authors Thomas Colcombet, Nathanaël Fijalkow, Florian Horn

Publication date 11 March 2024

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

Copyright license Creative Commons Attribution 4.0 International

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

zbMATH Keywords

games on graphsmemory

Mathematics Subject Classification ID

Logic in computer science (03B70) Computer science (68-XX)

Recommendations

• Playing Safe
• Strategy improvement for concurrent reachability and turn-based stochastic safety games
• scientific article; zbMATH DE number 2040951
• Infinite games on finitely coloured graphs with applications to automata on infinite trees
• Small strategies for safety games

Cites work

• Automata, logics, and infinite games. A guide to current research
• Characterizing omega-regularity through finite-memory determinacy of games on infinite graphs
• CONCUR 2005 – Concurrency Theory
• Energy parity games
• Finite-memory strategies in two-player infinite games
• Games where you can play optimally with arena-independent finite memory
• scientific article; zbMATH DE number 7830368 (Why is no real title available?)
• Infinite Runs in Weighted Timed Automata with Energy Constraints
• Playing Safe
• The Theory of Universal Graphs for Infinite Duration Games

Cited in

(3)

• Games where you can play optimally with arena-independent finite memory
• Positional \(\omega\)-regular languages
• The power of counting steps in quantitative games

This page was built for publication: Playing Safe, Ten Years Later

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