{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T15:37:03Z","timestamp":1753889823132,"version":"3.41.2"},"reference-count":0,"publisher":"Centre pour la Communication Scientifique Directe (CCSD)","license":[{"start":{"date-parts":[[2017,9,26]],"date-time":"2017-09-26T00:00:00Z","timestamp":1506384000000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/arxiv.org\/licenses\/nonexclusive-distrib\/1.0"},{"start":{"date-parts":[[2017,9,26]],"date-time":"2017-09-26T00:00:00Z","timestamp":1506384000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/arxiv.org\/licenses\/nonexclusive-distrib\/1.0"},{"start":{"date-parts":[[2017,9,26]],"date-time":"2017-09-26T00:00:00Z","timestamp":1506384000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/arxiv.org\/licenses\/nonexclusive-distrib\/1.0"}],"funder":[{"DOI":"10.13039\/501100000780","name":"European Commission","doi-asserted-by":"crossref","award":["340506"],"award-info":[{"award-number":["340506"]}],"id":[{"id":"10.13039\/501100000780","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100000780","name":"European Commission","doi-asserted-by":"crossref","award":["P 23499"],"award-info":[{"award-number":["P 23499"]}],"id":[{"id":"10.13039\/501100000780","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100000780","name":"European Commission","doi-asserted-by":"crossref","award":["279307"],"award-info":[{"award-number":["279307"]}],"id":[{"id":"10.13039\/501100000780","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"accepted":{"date-parts":[[2025,3,31]]},"abstract":"<jats:p>The computation of the winning set for parity objectives and for Streett objectives in 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-formedness of specifications, and the synthesis of reactive systems. We show how to compute the winning set on $n$ vertices for (1) parity-3 (aka one-pair Streett) objectives in game graphs in time $O(n^{5\/2})$ and for (2) k-pair Streett objectives in graphs in time $O(n^2 + nk \\log n)$. For both problems this gives faster algorithms for dense graphs and represents the first improvement in asymptotic running time in 15 years.<\/jats:p>","DOI":"10.23638\/lmcs-13(3:26)2017","type":"journal-article","created":{"date-parts":[[2025,4,3]],"date-time":"2025-04-03T17:34:05Z","timestamp":1743701645000},"source":"Crossref","is-referenced-by-count":0,"title":["Improved Algorithms for Parity and Streett objectives"],"prefix":"10.23638","volume":"Volume 13, Issue 3","author":[{"given":"Krishnendu","family":"Chatterjee","sequence":"first","affiliation":[]},{"given":"Monika","family":"Henzinger","sequence":"additional","affiliation":[]},{"given":"Veronika","family":"Loitzenbauer","sequence":"additional","affiliation":[]}],"member":"25203","published-online":{"date-parts":[[2017,9,26]]},"container-title":["Logical Methods in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/arxiv.org\/pdf\/1410.0833v4","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/arxiv.org\/pdf\/1410.0833v4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,3]],"date-time":"2025-04-03T17:34:05Z","timestamp":1743701645000},"score":1,"resource":{"primary":{"URL":"http:\/\/lmcs.episciences.org\/3953"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,9,26]]},"references-count":0,"URL":"https:\/\/doi.org\/10.23638\/lmcs-13(3:26)2017","relation":{"is-same-as":[{"id-type":"arxiv","id":"1410.0833","asserted-by":"subject"},{"id-type":"doi","id":"10.48550\/arXiv.1410.0833","asserted-by":"subject"}]},"ISSN":["1860-5974"],"issn-type":[{"type":"electronic","value":"1860-5974"}],"subject":[],"published":{"date-parts":[[2017,9,26]]},"article-number":"3953"}}