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...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Logical methods in computer science Jg. 20, Issue 1
Hauptverfasser:	Colcombet, Thomas, Fijalkow, Nathanaël, Horn, Florian
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Logical Methods in Computer Science Association 01.01.2024 Logical Methods in Computer Science e.V
Schlagworte:	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-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!