@inproceedings{1661, abstract = {The computation of the winning set for one-pair Streett objectives and for k-pair Streett objectives in (standard) graphs as well as in game graphs are central problems in computer-aided verification, with application to the verification of closed systems with strong fairness conditions, the verification of open systems, checking interface compatibility, well-formed ness of specifications, and the synthesis of reactive systems. We give faster algorithms for the computation of the winning set for (1) one-pair Streett objectives (aka parity-3 problem) in game graphs and (2) for k-pair Streett objectives in graphs. For both problems this represents the first improvement in asymptotic running time in 15 years.}, author = {Chatterjee, Krishnendu and Henzinger, Monika H and Loitzenbauer, Veronika}, booktitle = {Proceedings - Symposium on Logic in Computer Science}, location = {Kyoto, Japan}, publisher = {IEEE}, title = {{Improved algorithms for one-pair and k-pair Streett objectives}}, doi = {10.1109/LICS.2015.34}, volume = {2015-July}, year = {2015}, }