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á bibliografie

Vydáno v:	Logical methods in computer science Ročník 20, Issue 1
Hlavní autoři:	Colcombet, Thomas, Fijalkow, Nathanaël, Horn, Florian
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Logical Methods in Computer Science Association 01.01.2024 Logical Methods in Computer Science e.V
Témata:	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 přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!