Fast Symbolic Algorithms for Omega-Regular Games under Strong Transition Fairness

We consider fixpoint algorithms for two-player games on graphs with $\omega$-regular winning conditions, where the environment is constrained by a strong transition fairness assumption. Strong transition fairness is a widely occurring special case of strong fairness, which requires that any executio...

Celý popis

Podrobná bibliografia

Vydané v:	TheoretiCS Ročník 2
Hlavní autori:	Banerjee, Tamajit, Majumdar, Rupak, Mallik, Kaushik, Schmuck, Anne-Kathrin, Soudjani, Sadegh
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	TheoretiCS Foundation e.V 24.02.2023
Predmet:	computer science - formal languages and automata theory computer science - symbolic computation electrical engineering and systems science - systems and control
ISSN:	2751-4838, 2751-4838
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!