Playing Safe, Ten Years Later

We consider two-player games over graphs and give tight bounds on the memory size of strategies ensuring safety objectives. More specifically, we show that the minimal number of memory states of a strategy ensuring a safety objective is given by the size of the maximal antichain of left quotients wi...

Full description

Bibliographic Details

Published in:	Logical methods in computer science Vol. 20, Issue 1
Main Authors:	Colcombet, Thomas, Fijalkow, Nathanaël, Horn, Florian
Format:	Journal Article
Language:	English
Published:	Logical Methods in Computer Science Association 01.01.2024 Logical Methods in Computer Science e.V
Subjects:	Computer Science computer science - computer science and game theory computer science - formal languages and automata theory Logic in Computer Science Games on graphs, Memory
ISSN:	1860-5974, 1860-5974
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!