Playing Safe, Ten Years Later

DOI10.46298/lmcs-20(1:10)2024arXiv2212.12024v4OpenAlexW4391681436MaRDI QIDQ6151559

Thomas Colcombet, Florian Horn, Nathanaël Fijalkow

Publication date: 11 March 2024

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

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)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Energy parity games
• Automata, logics, and infinite games. A guide to current research
• Playing Safe
• Infinite Runs in Weighted Timed Automata with Energy Constraints
• The Theory of Universal Graphs for Infinite Duration Games
• CONCUR 2005 – Concurrency Theory

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