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

Celý popis

Podrobná bibliografia

Vydané v:	Logical methods in computer science Ročník 20, Issue 1
Hlavní autori:	Colcombet, Thomas, Fijalkow, Nathanaël, Horn, Florian
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Logical Methods in Computer Science Association 01.01.2024 Logical Methods in Computer Science e.V
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!