Playing Safe, Ten Years Later
We consider two-player games over graphs and give tight bounds on the memory size of strategies ensuring safety objectives. More specifically, we show that the minimal number of memory states of a strategy ensuring a safety objective is given by the size of the maximal antichain of left quotients wi...
Gespeichert in:
| Veröffentlicht in: | Logical methods in computer science Jg. 20, Issue 1 |
|---|---|
| Hauptverfasser: | , , |
| Format: | Journal Article |
| Sprache: | Englisch |
| Veröffentlicht: |
Logical Methods in Computer Science Association
01.01.2024
Logical Methods in Computer Science e.V |
| Schlagworte: | |
| ISSN: | 1860-5974, 1860-5974 |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Abstract | We consider two-player games over graphs and give tight bounds on the memory
size of strategies ensuring safety objectives. More specifically, we show that
the minimal number of memory states of a strategy ensuring a safety objective
is given by the size of the maximal antichain of left quotients with respect to
language inclusion. This result holds for all safety objectives without any
regularity assumptions. We give several applications of this general principle.
In particular, we characterize the exact memory requirements for the opponent
in generalized reachability games, and we prove the existence of positional
strategies in games with counters. |
|---|---|
| AbstractList | We consider two-player games over graphs and give tight bounds on the memory
size of strategies ensuring safety objectives. More specifically, we show that
the minimal number of memory states of a strategy ensuring a safety objective
is given by the size of the maximal antichain of left quotients with respect to
language inclusion. This result holds for all safety objectives without any
regularity assumptions. We give several applications of this general principle.
In particular, we characterize the exact memory requirements for the opponent
in generalized reachability games, and we prove the existence of positional
strategies in games with counters. We consider two-player games over graphs and give tight bounds on the memory size of strategies ensuring safety objectives. More specifically, we show that the minimal number of memory states of a strategy ensuring a safety objective is given by the size of the maximal antichain of left quotients with respect to language inclusion. This result holds for all safety objectives without any regularity assumptions. We give several applications of this general principle. In particular, we characterize the exact memory requirements for the opponent in generalized reachability games, and we prove the existence of positional strategies in games with counters. |
| Author | Fijalkow, Nathanaël Colcombet, Thomas Horn, Florian |
| Author_xml | – sequence: 1 givenname: Thomas surname: Colcombet fullname: Colcombet, Thomas – sequence: 2 givenname: Nathanaël surname: Fijalkow fullname: Fijalkow, Nathanaël – sequence: 3 givenname: Florian surname: Horn fullname: Horn, Florian |
| BackLink | https://hal.science/hal-04728508$$DView record in HAL |
| BookMark | eNpVkEFLw0AQhRepYK39A4KQowWjO7ObZNdbKWoLAQXrwdMyu9mtKWkjSRH6701aEZ3LDI83H493zgbbeusZuwR-K1PU6q7auDZGfg33wCfIUZ6wIaiUx4nO5ODPfcbGbbvm3QgBCtMhu3qpaF9uV9ErBX8TLf02evfUtFFOO99csNNAVevHP3vE3h4flrN5nD8_LWbTPHZC4i5OOGhuIUsCD0VipXcKVRCkHBTaktbKZpilnUPYxDvpyEIXPPgAmEnwYsQWR25R09p8NuWGmr2pqTQHoW5Whppd6SpvMqe5d5QWViipEAg1gk8dBwyOhO1YkyPrg6p_qPk0N73GZYYq4eoLOi8eva6p27bx4fcBuDl0a_puDXIDvdR3K74BfLNrzA |
| ContentType | Journal Article |
| Copyright | Distributed under a Creative Commons Attribution 4.0 International License |
| Copyright_xml | – notice: Distributed under a Creative Commons Attribution 4.0 International License |
| DBID | AAYXX CITATION 1XC VOOES DOA |
| DOI | 10.46298/lmcs-20(1:10)2024 |
| DatabaseName | CrossRef Hyper Article en Ligne (HAL) Hyper Article en Ligne (HAL) (Open Access) 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 | 1860-5974 |
| ExternalDocumentID | oai_doaj_org_article_7c90eca6db384821a2921e6c012fca3b oai:HAL:hal-04728508v1 10_46298_lmcs_20_1_10_2024 |
| GroupedDBID | .4S .DC 29L 2WC 5GY 5VS AAFWJ AAYXX ADBBV ADMLS ADQAK AENEX AFPKN ALMA_UNASSIGNED_HOLDINGS ARCSS BCNDV CITATION EBS EJD FRP GROUPED_DOAJ J9A KQ8 MK~ ML~ M~E OK1 OVT P2P TR2 TUS XSB 1XC VOOES |
| ID | FETCH-LOGICAL-c342t-50190b175f0fd5b4ec828f3a8c1d9ba998b7276b173b5ec4cab1629fef12741e3 |
| IEDL.DBID | DOA |
| ISICitedReferencesCount | 1 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=001156276800001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 1860-5974 |
| IngestDate | Fri Oct 03 12:41:07 EDT 2025 Tue Oct 14 20:14:19 EDT 2025 Sat Nov 29 06:21:52 EST 2025 |
| IsDoiOpenAccess | true |
| IsOpenAccess | true |
| IsPeerReviewed | true |
| IsScholarly | true |
| Keywords | Games on graphs, Memory |
| Language | English |
| License | Distributed under a Creative Commons Attribution 4.0 International License: http://creativecommons.org/licenses/by/4.0 |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c342t-50190b175f0fd5b4ec828f3a8c1d9ba998b7276b173b5ec4cab1629fef12741e3 |
| ORCID | 0000-0002-6576-4680 0000-0001-8872-4705 0000-0001-6529-6963 |
| OpenAccessLink | https://doaj.org/article/7c90eca6db384821a2921e6c012fca3b |
| ParticipantIDs | doaj_primary_oai_doaj_org_article_7c90eca6db384821a2921e6c012fca3b hal_primary_oai_HAL_hal_04728508v1 crossref_primary_10_46298_lmcs_20_1_10_2024 |
| PublicationCentury | 2000 |
| PublicationDate | 2024-01-01 |
| PublicationDateYYYYMMDD | 2024-01-01 |
| PublicationDate_xml | – month: 01 year: 2024 text: 2024-01-01 day: 01 |
| PublicationDecade | 2020 |
| PublicationTitle | Logical methods in computer science |
| PublicationYear | 2024 |
| Publisher | Logical Methods in Computer Science Association Logical Methods in Computer Science e.V |
| Publisher_xml | – name: Logical Methods in Computer Science Association – name: Logical Methods in Computer Science e.V |
| SSID | ssj0000331826 |
| Score | 2.3117292 |
| Snippet | We consider two-player games over graphs and give tight bounds on the memory
size of strategies ensuring safety objectives. More specifically, we show that
the... We consider two-player games over graphs and give tight bounds on the memory size of strategies ensuring safety objectives. More specifically, we show that the... |
| SourceID | doaj hal crossref |
| SourceType | Open Website Open Access Repository Index Database |
| SubjectTerms | Computer Science computer science - computer science and game theory computer science - formal languages and automata theory Logic in Computer Science |
| Title | Playing Safe, Ten Years Later |
| URI | https://hal.science/hal-04728508 https://doaj.org/article/7c90eca6db384821a2921e6c012fca3b |
| Volume | 20, Issue 1 |
| WOSCitedRecordID | wos001156276800001&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: 1860-5974 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0000331826 issn: 1860-5974 databaseCode: DOA dateStart: 20040101 isFulltext: true titleUrlDefault: https://www.doaj.org/ providerName: Directory of Open Access Journals – providerCode: PRVHPJ databaseName: ROAD: Directory of Open Access Scholarly Resources customDbUrl: eissn: 1860-5974 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0000331826 issn: 1860-5974 databaseCode: M~E dateStart: 20040101 isFulltext: true titleUrlDefault: https://road.issn.org providerName: ISSN International Centre |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV09T8MwELVQxcDCN6JAUYQYQBA1_kgasxVE1aFUlSioTJF9tgVSCagtHfntnJMUtRMLS4aTldjPzt09y35HyDmPNUYCxULqDAuFafFQWulCC1RQdMqaF1p6z71Wv5-ORnKwVOrLnwkr5YFL4JotkJEFlRjNU5Eyqphk1CaAjtWB4tp7X8x6lshU4YM594lzeUtGJEymzfE7THFNXNAbGl0i5RcrkagQ7Mf48rrYTy3iS2ebbFaJYdAuO7RD1my-S7YWRReC6h_cI43BWPmrScGjcvY6GNo8eMHVOg16mDVO9slT53541w2rGgchcMFmYezvcmuM4S5yJtbCAlIgx1UK1EitkAxpzDASbMF1bEGA0hSH46yjXnjG8gNSyz9ye0gCAwARJNzETArQRkujmIssAmWRWOk6uVqMN_sspSwypAAFOplHJ2NICLzJo1Mntx6S35Zehrow4ORk1eRkf01OnZwhoCvv6LZ7mbd5lcoUs8M5PfqPLx2TDd_rcnPkhNRmky_bIOswn71NJ6fF4sDnw_f9D_Q-vV4 |
| 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=Playing+Safe%2C+Ten+Years+Later&rft.jtitle=Logical+methods+in+computer+science&rft.au=Thomas+Colcombet&rft.au=Nathana%C3%ABl+Fijalkow&rft.au=Florian+Horn&rft.date=2024-01-01&rft.pub=Logical+Methods+in+Computer+Science+e.V&rft.eissn=1860-5974&rft.volume=20%2C+Issue+1&rft_id=info:doi/10.46298%2Flmcs-20%281%3A10%292024&rft.externalDBID=DOA&rft.externalDocID=oai_doaj_org_article_7c90eca6db384821a2921e6c012fca3b |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1860-5974&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1860-5974&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1860-5974&client=summon |