most citedFast Symbolic Algorithms for Omega-Regular Games under Strong Transition Fairness

11 citations · 11 across the 1 of their papers we have counts for

collaborators

1 paper

cs.FL2022★ 11 cited

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

Tamajit Banerjee, Rupak Majumdar, Kaushik Mallik +2

We consider fixpoint algorithms for two-player games on graphs with -regular winning conditions, where the environment is constrained by a strong transition fairness assumption.…