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

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	TheoretiCS Jg. 2
Hauptverfasser:	Banerjee, Tamajit, Majumdar, Rupak, Mallik, Kaushik, Schmuck, Anne-Kathrin, Soudjani, Sadegh
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	TheoretiCS Foundation e.V 24.02.2023
Schlagworte:	computer science - formal languages and automata theory computer science - symbolic computation electrical engineering and systems science - systems and control
ISSN:	2751-4838, 2751-4838
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!