Smaller progress measures and separating automata for parity games
Calude et al. have recently shown that parity games can be solved in quasi-polynomial time, a landmark result that has led to several approaches with quasi-polynomial complexity. Jurdzinski and Lazic have further improved the precise complexity of parity games, especially when the number of prioriti...
Saved in:
| Published in: | Frontiers in computer science (Lausanne) Vol. 4 |
|---|---|
| Main Authors: | , |
| Format: | Journal Article |
| Language: | English |
| Published: |
Frontiers Media S.A
20.09.2022
|
| Subjects: | |
| ISSN: | 2624-9898, 2624-9898 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Abstract | Calude et al. have recently shown that parity games can be solved in quasi-polynomial time, a landmark result that has led to several approaches with quasi-polynomial complexity. Jurdzinski and Lazic have further improved the precise complexity of parity games, especially when the number of priorities is low (logarithmic in the number of positions). Both of these algorithms belong to a class of game solving techniques now often called separating automata: deterministic automata that can be used as witness automata to decide the winner in parity games up to a given number of states and colors. We suggest several adjustments to the approach of Calude et al. that lead to smaller statespaces. These include and improve over those earlier introduced by Fearnley et al. We identify two of them that, together, lead to a statespace of exactly the same size Jurdzinski and Lazic's concise progress measures, which currently hold the crown as the smallest statespace. The remaining improvements, hence, lead to a further reduction in the size of the statespace, making our approach the most succinct progress measure available for parity games. |
|---|---|
| AbstractList | Calude et al. have recently shown that parity games can be solved in quasi-polynomial time, a landmark result that has led to several approaches with quasi-polynomial complexity. Jurdzinski and Lazic have further improved the precise complexity of parity games, especially when the number of priorities is low (logarithmic in the number of positions). Both of these algorithms belong to a class of game solving techniques now often called separating automata: deterministic automata that can be used as witness automata to decide the winner in parity games up to a given number of states and colors. We suggest several adjustments to the approach of Calude et al. that lead to smaller statespaces. These include and improve over those earlier introduced by Fearnley et al. We identify two of them that, together, lead to a statespace of exactly the same size Jurdzinski and Lazic's concise progress measures, which currently hold the crown as the smallest statespace. The remaining improvements, hence, lead to a further reduction in the size of the statespace, making our approach the most succinct progress measure available for parity games. |
| Author | Dell'Erba, Daniele Schewe, Sven |
| Author_xml | – sequence: 1 givenname: Daniele surname: Dell'Erba fullname: Dell'Erba, Daniele – sequence: 2 givenname: Sven surname: Schewe fullname: Schewe, Sven |
| BookMark | eNpNkMtOwzAQRS0EEqX0A9jlB1I8duzaS6h4VKrEAlhbEz-iVEkc2emif08fCLG6V1czZ3HuyPUQB0_IA9Al50o_Bhv7cckoY0vNpab8isyYZFWplVbX__otWeS8o5QyASDUakaeP3vsOp-KMcUm-ZyL3mPeH1uBgyuyHzHh1A5Ngfsp9jhhEeLxGlM7HYoGe5_vyU3ALvvFb87J9-vL1_q93H68bdZP29JyKqcSq7p2Xgm0FoTUteMU3IppZ2vUGGprZeCCBWFrkChBiZUCUA6UrTyyis_J5sJ1EXdmTG2P6WAituY8xNQYTFNrO2-UV6E6fmvtsFIsKG4BpGACHSAof2TBhWVTzDn58McDak5OzdmpOTk1F6f8Bzchbak |
| Cites_doi | 10.1016/j.ic.2009.07.004 10.1007/3-540-36387-4 10.36045/bbms/1102714178 10.1007/s10009-019-00509-3 10.1007/s00224-004-1147-5 10.1145/585265.585270 10.1016/j.dam.2013.02.007 10.1016/S0304-3975(00)00034-7 10.1016/j.ic.2018.09.005 10.2307/1971035 10.1016/S0304-3975(98)00009-7 10.1016/S0020-0190(98)00150-1 10.1007/s10703-018-0315-1 |
| ContentType | Journal Article |
| DBID | AAYXX CITATION DOA |
| DOI | 10.3389/fcomp.2022.936903 |
| DatabaseName | CrossRef DOAJ Directory of Open Access Journals |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | CrossRef |
| Database_xml | – sequence: 1 dbid: DOA name: DOAJ Directory of Open Access Journals url: https://www.doaj.org/ sourceTypes: Open Website |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Computer Science |
| EISSN | 2624-9898 |
| ExternalDocumentID | oai_doaj_org_article_8e8f481199da482f83c116525ad1a18e 10_3389_fcomp_2022_936903 |
| GroupedDBID | 9T4 AAFWJ AAYXX AFPKN ALMA_UNASSIGNED_HOLDINGS CITATION GROUPED_DOAJ M~E OK1 |
| ID | FETCH-LOGICAL-c306t-a4bbde85acc1569bd301d729dcba9afbcc6f352f5cb16a618578118d18c4ea243 |
| IEDL.DBID | DOA |
| ISICitedReferencesCount | 3 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000863940200001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 2624-9898 |
| IngestDate | Fri Oct 03 12:50:39 EDT 2025 Sat Nov 29 02:11:56 EST 2025 |
| IsDoiOpenAccess | true |
| IsOpenAccess | true |
| IsPeerReviewed | true |
| IsScholarly | true |
| Language | English |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c306t-a4bbde85acc1569bd301d729dcba9afbcc6f352f5cb16a618578118d18c4ea243 |
| OpenAccessLink | https://doaj.org/article/8e8f481199da482f83c116525ad1a18e |
| ParticipantIDs | doaj_primary_oai_doaj_org_article_8e8f481199da482f83c116525ad1a18e crossref_primary_10_3389_fcomp_2022_936903 |
| PublicationCentury | 2000 |
| PublicationDate | 2022-09-20 |
| PublicationDateYYYYMMDD | 2022-09-20 |
| PublicationDate_xml | – month: 09 year: 2022 text: 2022-09-20 day: 20 |
| PublicationDecade | 2020 |
| PublicationTitle | Frontiers in computer science (Lausanne) |
| PublicationYear | 2022 |
| Publisher | Frontiers Media S.A |
| Publisher_xml | – name: Frontiers Media S.A |
| References | Fearnley (B15) 2019; 21 Zielonka (B36) 1998; 200 Benerecetti (B3); 262 Kupferman (B22) 1998 Czerwinski (B10) 2018 Emerson (B11) 1991 Schewe (B31) 2008 Berwanger (B6) 2004; 37 Alur (B1) 2002; 49 Fearnley (B14) 2010 Bojańczyk (B7) 2018 Emerson (B13) 1986 Martin (B25) 1975; 102 Mostowski (B28) 1991 Wilke (B35) 2001; 8 Mogavero (B26) 2012 Benerecetti (B5) 2013 Friedmann (B17) 2013; 161 Chatterjee (B9) 2010; 208 Jurdziński (B21) 2017 Benerecetti (B4); 52 Jurdziński (B20) 2000 Lapauw (B23) 2020 Emerson (B12) 2001; 258 Schewe (B32) 2006 Fearnley (B16) 2017 Lehtinen (B24) 2018 Schewe (B30) 2007 Mogavero (B27) 2010 Benerecetti (B2) 2016 Grädel (B18) 2002 Parys (B29) 2019 van Dijk (B33) 2018 Vöge (B34) 2000 Calude (B8) 2017 Jurdziński (B19) 1998; 68 |
| References_xml | – volume: 208 start-page: 677 year: 2010 ident: B9 article-title: Strategy logic publication-title: Inf. Comput doi: 10.1016/j.ic.2009.07.004 – start-page: 267 volume-title: Symposium on Theoretical Aspects of Computer Science'86, LNCS 210 year: 1986 ident: B13 article-title: Temporal reasoning under generalized fairness constraints, – start-page: 133 volume-title: FSTTCS'10, LIPIcs 8 year: 2010 ident: B27 article-title: Reasoning about strategies, – start-page: 368 volume-title: Logic in Computer Science'13 year: 2013 ident: B5 article-title: Substructure temporal logic, – start-page: 224 volume-title: Symposium on Theory of Computing'98 year: 1998 ident: B22 article-title: Weak alternating automata and tree automata emptiness, – start-page: 449 volume-title: VMCAI'20, LNCS 11990 year: 2020 ident: B23 article-title: Improving parity game solvers with justifications, – start-page: 449 volume-title: FSTTCS'07, LNCS 4855 year: 2007 ident: B30 article-title: Solving parity games in big steps, – volume-title: LNCS 2500 year: 2002 ident: B18 article-title: Automata, logics, and infinite games: a guide to current research, doi: 10.1007/3-540-36387-4 – start-page: 2333 volume-title: SODA'18 year: 2018 ident: B10 article-title: Universal trees grow inside separating automata: quasi-polynomial lower bounds for parity games, – start-page: 591 volume-title: CSL'06, LNCS 6247 year: 2006 ident: B32 article-title: Satisfiability and finite model property for the alternating-time mucalculus, – year: 1991 ident: B28 publication-title: Games with Forbidden Positions – start-page: 252 volume-title: Symposium on Theory of Computing'17 year: 2017 ident: B8 article-title: Deciding parity games in quasipolynomial time, – volume: 8 start-page: 359 year: 2001 ident: B35 article-title: Alternating tree automata, parity games, and modal muCalculus publication-title: Bull. Belg. Math. Soc doi: 10.36045/bbms/1102714178 – year: 2018 ident: B7 – start-page: 112 volume-title: SPIN'17 year: 2017 ident: B16 article-title: An ordered approach to solving parity games in quasi polynomial time and quasi linear space, – volume: 21 start-page: 325 year: 2019 ident: B15 article-title: An ordered approach to solving parity games in quasi polynomial time and quasi linear space publication-title: Software Tools Technol. Transfer doi: 10.1007/s10009-019-00509-3 – volume: 37 start-page: 675 year: 2004 ident: B6 article-title: Fixed-point logics and solitaire games publication-title: Theor. Comput. Sci doi: 10.1007/s00224-004-1147-5 – start-page: 202 volume-title: CAV'00, LNCS 1855 year: 2000 ident: B34 article-title: A discrete strategy improvement algorithm for solving parity games, – volume: 49 start-page: 672 year: 2002 ident: B1 article-title: Alternating-time temporal logic publication-title: J. ACM doi: 10.1145/585265.585270 – start-page: 290 volume-title: Symposium on Theoretical Aspects of Computer Science'00, LNCS 1770 year: 2000 ident: B20 article-title: Small progress measures for solving parity games, – start-page: 368 volume-title: FOCS'91 year: 1991 ident: B11 article-title: Tree automata, mucalculus, and determinacy, – volume: 161 start-page: 1317 year: 2013 ident: B17 article-title: A superpolynomial lower bound for strategy iteration based on snare memorization publication-title: Discrete Appl. Math doi: 10.1016/j.dam.2013.02.007 – volume: 258 start-page: 491 year: 2001 ident: B12 article-title: On model checking for the mucalculus and its fragments publication-title: Theor. Comput. Sci doi: 10.1016/S0304-3975(00)00034-7 – volume: 262 start-page: 221 ident: B3 article-title: A delayed promotion policy for parity games publication-title: Inf. Comput doi: 10.1016/j.ic.2018.09.005 – start-page: 212 volume-title: LPAR'10, LNCS 6355 year: 2010 ident: B14 article-title: Non-oblivious strategy improvement, – start-page: 639 volume-title: Logic in Computer Science'18 year: 2018 ident: B24 article-title: A modal mu perspective on solving parity games in quasi-polynomial time, – volume: 102 start-page: 363 year: 1975 ident: B25 article-title: Borel determinacy publication-title: Ann. Math doi: 10.2307/1971035 – start-page: 1 volume-title: Proceedings of MFCS, LIPIcs 138 year: 2019 ident: B29 article-title: Parity games: Zielonka's algorithm in quasi-polynomial time, – start-page: 193 volume-title: Concurrency Theory'12, LNCS 7454 year: 2012 ident: B26 article-title: What makes ATL* decidable? a decidable fragment of strategy logic, – volume: 200 start-page: 135 year: 1998 ident: B36 article-title: Infinite games on finitely coloured graphs with applications to automata on infinite trees publication-title: Theor. Comput. Sci doi: 10.1016/S0304-3975(98)00009-7 – volume: 68 start-page: 119 year: 1998 ident: B19 article-title: Deciding the winner in parity games is in UP ∩ co-UP publication-title: Inf. Process. Lett doi: 10.1016/S0020-0190(98)00150-1 – start-page: 1 volume-title: Logic in Computer Science'17 year: 2017 ident: B21 article-title: Succinct progress measures for solving parity games, – start-page: 1 volume-title: HVC'16, LNCS 10028 year: 2016 ident: B2 article-title: Improving priority promotion for parity games, – volume: 52 start-page: 193 ident: B4 article-title: Solving parity games via priority promotion publication-title: Form. Methods Syst. Des doi: 10.1007/s10703-018-0315-1 – start-page: 198 volume-title: CAV'18, LNCS 10982 year: 2018 ident: B33 article-title: Attracting tangles to solve parity games, – start-page: 373 volume-title: International Colloquium on Automata, Languages, and Programming'08, LNCS 5126 year: 2008 ident: B31 article-title: ATL* satisfiability is 2ExpTime-complete, |
| SSID | ssj0002511587 |
| Score | 2.2169526 |
| Snippet | Calude et al. have recently shown that parity games can be solved in quasi-polynomial time, a landmark result that has led to several approaches with... |
| SourceID | doaj crossref |
| SourceType | Open Website Index Database |
| SubjectTerms | parity games progress measures quasi-polynomial algorithms separating automata value iteration |
| Title | Smaller progress measures and separating automata for parity games |
| URI | https://doaj.org/article/8e8f481199da482f83c116525ad1a18e |
| Volume | 4 |
| WOSCitedRecordID | wos000863940200001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVAON databaseName: DOAJ Directory of Open Access Journals customDbUrl: eissn: 2624-9898 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0002511587 issn: 2624-9898 databaseCode: DOA dateStart: 20190101 isFulltext: true titleUrlDefault: https://www.doaj.org/ providerName: Directory of Open Access Journals – providerCode: PRVHPJ databaseName: ROAD: Directory of Open Access Scholarly Resources (ISSN International Center) customDbUrl: eissn: 2624-9898 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0002511587 issn: 2624-9898 databaseCode: M~E dateStart: 20190101 isFulltext: true titleUrlDefault: https://road.issn.org providerName: ISSN International Centre |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV09T8MwELUQYmDhG1G-5IEJKTR27OQ8UtSKhQoJkLpF_qwYmqI2RWLht-NLUtSNhSVDFEXWO_v8zj69R8gNNw5cnsXsJ_HoxnGWaGPTxCgpPNgA1pnGbKIYj2EyUc8bVl_YE9bKA7fA9cFDEMCYUk4L4AEyi4oxXGrHNAOP2Tct1EYxhTkYibOEor3GjFWY6gds0Y71IOd36GG3NsnqNqINvf5mYxkdkL2OEdL7diSHZMtXR2R_7bZAu8V3TAYvM_Q9WdCmpSomKDprz_eWVFeOLn2r4l1NqV7V80hENY2ElKLLYP1Fp9gNe0LeRsPXh8ekc0BIbKTydaKFMc6D1NbGOksZF5eji3TYWaOVDsbaPEQGFaQ1LNc56jpFqMAxsMJrLrJTsl3NK39GqDLM4iWmMMBFkWqTuUyYHJRUadCZ7JHbNRzlRyt0UcYCAbErG-xKxK5sseuRAQL2-yFqVDcvYuTKLnLlX5E7_4-fXJBdHBd2cPD0kmzXi5W_Ijv2s35fLq6bSRGfT9_DH7mYvZk |
| linkProvider | Directory of Open Access Journals |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Smaller+progress+measures+and+separating+automata+for+parity+games&rft.jtitle=Frontiers+in+computer+science+%28Lausanne%29&rft.au=Daniele+Dell%27Erba&rft.au=Sven+Schewe&rft.date=2022-09-20&rft.pub=Frontiers+Media+S.A&rft.eissn=2624-9898&rft.volume=4&rft_id=info:doi/10.3389%2Ffcomp.2022.936903&rft.externalDBID=DOA&rft.externalDocID=oai_doaj_org_article_8e8f481199da482f83c116525ad1a18e |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=2624-9898&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=2624-9898&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=2624-9898&client=summon |