A synthesis method for zero-sum mean-payoff asynchronous probabilistic games
The traditional synthesis problem aims to automatically construct a reactive system (if it exists) satisfying a given Linear Temporal Logic (LTL) specifications, and is often referred to as a qualitative problem. There is also a class of synthesis problems aiming at quantitative properties, such as...
Uložené v:
| Vydané v: | Scientific reports Ročník 15; číslo 1; s. 2291 - 13 |
|---|---|
| Hlavní autori: | , , , |
| Médium: | Journal Article |
| Jazyk: | English |
| Vydavateľské údaje: |
London
Nature Publishing Group UK
17.01.2025
Nature Publishing Group Nature Portfolio |
| Predmet: | |
| ISSN: | 2045-2322, 2045-2322 |
| On-line prístup: | Získať plný text |
| Tagy: |
Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
|
| Abstract | The traditional synthesis problem aims to automatically construct a reactive system (if it exists) satisfying a given Linear Temporal Logic (LTL) specifications, and is often referred to as a qualitative problem. There is also a class of synthesis problems aiming at quantitative properties, such as mean-payoff values, and this type of problem is called a quantitative problem. For the two types of synthesis problems, the research on the former has been relatively mature, and the latter also has received huge amounts of attention. System designers prefer to synthesize systems that satisfy resource constraints. To this end, this paper focuses on the reactive synthesis problem of combining quantitative and qualitative objectives. First, zero-sum mean-payoff asynchronous probabilistic games are proposed, where the system aims at the expected mean payoff in a probabilistic environment while satisfying an LTL winning condition against an adversarial environment. Then, the case of taking the wider class of Generalized Reactivity(1) (GR(1)) formula as an LTL winning condition is studied, that is, the synthesis problem of the expected mean payoffs is studied for the system with the probability of winning. Next, two symbolic algorithms running in polynomial time are proposed to calculate the expected mean payoffs, and both algorithms adopt uniform random strategies. Combining the probability of system winning, the expected mean payoffs of the system when it has the probability of winning is calculated. Finally, our two algorithms are implemented, and their convergence and volatility are demonstrated through experiments. |
|---|---|
| AbstractList | The traditional synthesis problem aims to automatically construct a reactive system (if it exists) satisfying a given Linear Temporal Logic (LTL) specifications, and is often referred to as a qualitative problem. There is also a class of synthesis problems aiming at quantitative properties, such as mean-payoff values, and this type of problem is called a quantitative problem. For the two types of synthesis problems, the research on the former has been relatively mature, and the latter also has received huge amounts of attention. System designers prefer to synthesize systems that satisfy resource constraints. To this end, this paper focuses on the reactive synthesis problem of combining quantitative and qualitative objectives. First, zero-sum mean-payoff asynchronous probabilistic games are proposed, where the system aims at the expected mean payoff in a probabilistic environment while satisfying an LTL winning condition against an adversarial environment. Then, the case of taking the wider class of Generalized Reactivity(1) (GR(1)) formula as an LTL winning condition is studied, that is, the synthesis problem of the expected mean payoffs is studied for the system with the probability of winning. Next, two symbolic algorithms running in polynomial time are proposed to calculate the expected mean payoffs, and both algorithms adopt uniform random strategies. Combining the probability of system winning, the expected mean payoffs of the system when it has the probability of winning is calculated. Finally, our two algorithms are implemented, and their convergence and volatility are demonstrated through experiments. The traditional synthesis problem aims to automatically construct a reactive system (if it exists) satisfying a given Linear Temporal Logic (LTL) specifications, and is often referred to as a qualitative problem. There is also a class of synthesis problems aiming at quantitative properties, such as mean-payoff values, and this type of problem is called a quantitative problem. For the two types of synthesis problems, the research on the former has been relatively mature, and the latter also has received huge amounts of attention. System designers prefer to synthesize systems that satisfy resource constraints. To this end, this paper focuses on the reactive synthesis problem of combining quantitative and qualitative objectives. First, zero-sum mean-payoff asynchronous probabilistic games are proposed, where the system aims at the expected mean payoff in a probabilistic environment while satisfying an LTL winning condition against an adversarial environment. Then, the case of taking the wider class of Generalized Reactivity(1) (GR(1)) formula as an LTL winning condition is studied, that is, the synthesis problem of the expected mean payoffs is studied for the system with the probability of winning. Next, two symbolic algorithms running in polynomial time are proposed to calculate the expected mean payoffs, and both algorithms adopt uniform random strategies. Combining the probability of system winning, the expected mean payoffs of the system when it has the probability of winning is calculated. Finally, our two algorithms are implemented, and their convergence and volatility are demonstrated through experiments.The traditional synthesis problem aims to automatically construct a reactive system (if it exists) satisfying a given Linear Temporal Logic (LTL) specifications, and is often referred to as a qualitative problem. There is also a class of synthesis problems aiming at quantitative properties, such as mean-payoff values, and this type of problem is called a quantitative problem. For the two types of synthesis problems, the research on the former has been relatively mature, and the latter also has received huge amounts of attention. System designers prefer to synthesize systems that satisfy resource constraints. To this end, this paper focuses on the reactive synthesis problem of combining quantitative and qualitative objectives. First, zero-sum mean-payoff asynchronous probabilistic games are proposed, where the system aims at the expected mean payoff in a probabilistic environment while satisfying an LTL winning condition against an adversarial environment. Then, the case of taking the wider class of Generalized Reactivity(1) (GR(1)) formula as an LTL winning condition is studied, that is, the synthesis problem of the expected mean payoffs is studied for the system with the probability of winning. Next, two symbolic algorithms running in polynomial time are proposed to calculate the expected mean payoffs, and both algorithms adopt uniform random strategies. Combining the probability of system winning, the expected mean payoffs of the system when it has the probability of winning is calculated. Finally, our two algorithms are implemented, and their convergence and volatility are demonstrated through experiments. Abstract The traditional synthesis problem aims to automatically construct a reactive system (if it exists) satisfying a given Linear Temporal Logic (LTL) specifications, and is often referred to as a qualitative problem. There is also a class of synthesis problems aiming at quantitative properties, such as mean-payoff values, and this type of problem is called a quantitative problem. For the two types of synthesis problems, the research on the former has been relatively mature, and the latter also has received huge amounts of attention. System designers prefer to synthesize systems that satisfy resource constraints. To this end, this paper focuses on the reactive synthesis problem of combining quantitative and qualitative objectives. First, zero-sum mean-payoff asynchronous probabilistic games are proposed, where the system aims at the expected mean payoff in a probabilistic environment while satisfying an LTL winning condition against an adversarial environment. Then, the case of taking the wider class of Generalized Reactivity(1) (GR(1)) formula as an LTL winning condition is studied, that is, the synthesis problem of the expected mean payoffs is studied for the system with the probability of winning. Next, two symbolic algorithms running in polynomial time are proposed to calculate the expected mean payoffs, and both algorithms adopt uniform random strategies. Combining the probability of system winning, the expected mean payoffs of the system when it has the probability of winning is calculated. Finally, our two algorithms are implemented, and their convergence and volatility are demonstrated through experiments. |
| ArticleNumber | 2291 |
| Author | Zhao, Wei Liu, Zhiming Wang, Tiexin Liu, Wanwei |
| Author_xml | – sequence: 1 givenname: Wei surname: Zhao fullname: Zhao, Wei email: zhaowei618@jsut.edu.cn organization: The Department of Computer Engineering, Jiangsu University of Technology – sequence: 2 givenname: Wanwei surname: Liu fullname: Liu, Wanwei organization: The National University of Defense Technology – sequence: 3 givenname: Zhiming surname: Liu fullname: Liu, Zhiming email: zhimingliu88@swu.edu.cn organization: Southwest University – sequence: 4 givenname: Tiexin surname: Wang fullname: Wang, Tiexin organization: The College of Computer Science and Technology, Nanjing University of Aeronautics and Astronautics |
| BackLink | https://www.ncbi.nlm.nih.gov/pubmed/39824925$$D View this record in MEDLINE/PubMed |
| BookMark | eNp9kstu1DAUhi3Uil5fgAWKxIaNwdfYXqGqglJpJDbt2nJ8mckosQc7QZo-Pe6klJYF3tg6_s5_jo__M3AUU_QAvMPoE0ZUfi4McyUhIhxKzqWC6g04JYhxSCghRy_OJ-CylC2qixPFsHoLTqiShCnCT8Hqqin7OG186Usz-mmTXBNSbh58TrDMY42ZCHdmn0JoTEXtJqeY5tLscupM1w99mXrbrM3oywU4DmYo_vJpPwf3377eXX-Hqx83t9dXK2hr0QnaICzqkPBcEcWpo9g7ylqHkcGiDY5abrHhDncOC-WEsKLDnQyW05pRX38Obhddl8xW73I_mrzXyfT6EEh5rU2uXQ1eM2WFZJIJhzALOCjGkGMIeRuC4MhVrS-L1m7uRu-sj1M2wyvR1zex3-h1-qUxFoygllWFj08KOf2cfZn02Bfrh8FEXwelKeataiVDoqIf_kG3ac6xzupAtUph9ij4_mVLz738-bUKkAWwOZWSfXhGMNKP7tCLO3R1hz64Q6uaRJekUuG49vlv7f9k_QYsXLv9 |
| Cites_doi | 10.3390/g13010019 10.1007/978-3-642-54830-7_14 10.1016/0304-3975(95)00188-3 10.1109/LICS.2015.33 10.1007/978-3-540-31980-1_31 10.1109/LICS.2005.26 10.1016/j.ic.2016.10.011 10.1007/978-3-642-23217-6_32 10.1007/978-3-642-22993-0_21 10.1007/11513988_23 10.1007/s10703-010-0105-x 10.1007/BFb0035790 10.1007/BF01768705 10.1016/j.ic.2015.03.001 10.1016/S0304-3975(03)00427-4 10.1007/3-540-45089-0_3 10.1007/978-3-642-33666-9_1 10.1016/j.jcss.2011.08.007 10.1080/01969722.2023.2175492 10.1007/978-3-642-15375-4_14 10.1007/s11704-020-0076-z 10.4230/LIPIcs.CONCUR.2016.9 10.1016/j.tcs.2017.03.038 10.1109/LICS.2015.32 10.1145/963927.963928 |
| ContentType | Journal Article |
| Copyright | The Author(s) 2025 2025. The Author(s). Copyright Nature Publishing Group 2025 The Author(s) 2025 2025 |
| Copyright_xml | – notice: The Author(s) 2025 – notice: 2025. The Author(s). – notice: Copyright Nature Publishing Group 2025 – notice: The Author(s) 2025 2025 |
| DBID | C6C AAYXX CITATION NPM 3V. 7X7 7XB 88A 88E 88I 8FE 8FH 8FI 8FJ 8FK ABUWG AEUYN AFKRA AZQEC BBNVY BENPR BHPHI CCPQU DWQXO FYUFA GHDGH GNUQQ HCIFZ K9. LK8 M0S M1P M2P M7P PHGZM PHGZT PIMPY PJZUB PKEHL PPXIY PQEST PQGLB PQQKQ PQUKI PRINS Q9U 7X8 5PM DOA |
| DOI | 10.1038/s41598-025-85589-9 |
| DatabaseName | Springer Nature OA Free Journals CrossRef PubMed ProQuest Central (Corporate) Health & Medical Collection ProQuest Central (purchase pre-March 2016) Biology Database (Alumni Edition) Medical Database (Alumni Edition) Science Database (Alumni Edition) ProQuest SciTech Collection ProQuest Natural Science Collection Hospital Premium Collection Hospital Premium Collection (Alumni Edition) ProQuest Central (Alumni) (purchase pre-March 2016) ProQuest Central (Alumni) One Sustainability ProQuest Central UK/Ireland ProQuest Central Essentials Biological Science Collection ProQuest Central Natural Science Collection ProQuest One Community College ProQuest Central Health Research Premium Collection Health Research Premium Collection (Alumni) ProQuest Central Student SciTech Premium Collection ProQuest Health & Medical Complete (Alumni) ProQuest Biological Science Collection Health & Medical Collection (Alumni Edition) PML(ProQuest Medical Library) Science Database Biological Science Database ProQuest Databases ProQuest One Academic (New) Publicly Available Content Database ProQuest Health & Medical Research Collection ProQuest One Academic Middle East (New) One Health & Nursing ProQuest One Academic Eastern Edition (DO NOT USE) One Applied & Life Sciences ProQuest One Academic (retired) ProQuest One Academic UKI Edition ProQuest Central China ProQuest Central Basic MEDLINE - Academic PubMed Central (Full Participant titles) DOAJ Directory of Open Access Journals |
| DatabaseTitle | CrossRef PubMed Publicly Available Content Database ProQuest Central Student ProQuest One Academic Middle East (New) ProQuest Central Essentials ProQuest Health & Medical Complete (Alumni) ProQuest Central (Alumni Edition) SciTech Premium Collection ProQuest One Community College ProQuest One Health & Nursing ProQuest Natural Science Collection ProQuest Central China ProQuest Biology Journals (Alumni Edition) ProQuest Central ProQuest One Applied & Life Sciences ProQuest One Sustainability ProQuest Health & Medical Research Collection Health Research Premium Collection Health and Medicine Complete (Alumni Edition) Natural Science Collection ProQuest Central Korea Health & Medical Research Collection Biological Science Collection ProQuest Central (New) ProQuest Medical Library (Alumni) ProQuest Science Journals (Alumni Edition) ProQuest Biological Science Collection ProQuest Central Basic ProQuest Science Journals ProQuest One Academic Eastern Edition ProQuest Hospital Collection Health Research Premium Collection (Alumni) Biological Science Database ProQuest SciTech Collection ProQuest Hospital Collection (Alumni) ProQuest Health & Medical Complete ProQuest Medical Library ProQuest One Academic UKI Edition ProQuest One Academic ProQuest One Academic (New) ProQuest Central (Alumni) MEDLINE - Academic |
| DatabaseTitleList | MEDLINE - Academic Publicly Available Content Database PubMed |
| Database_xml | – sequence: 1 dbid: DOA name: DOAJ Directory of Open Access Journals url: https://www.doaj.org/ sourceTypes: Open Website – sequence: 2 dbid: NPM name: PubMed url: http://www.ncbi.nlm.nih.gov/entrez/query.fcgi?db=PubMed sourceTypes: Index Database – sequence: 3 dbid: PIMPY name: Publicly Available Content Database url: http://search.proquest.com/publiccontent sourceTypes: Aggregation Database |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Biology |
| EISSN | 2045-2322 |
| EndPage | 13 |
| ExternalDocumentID | oai_doaj_org_article_49c784847d014f1f9440d400ecff750d PMC11742064 39824925 10_1038_s41598_025_85589_9 |
| Genre | Journal Article |
| GroupedDBID | 0R~ 3V. 4.4 53G 5VS 7X7 88A 88E 88I 8FE 8FH 8FI 8FJ AAFWJ AAJSJ AAKDD ABDBF ABUWG ACGFS ACSMW ACUHS ADBBV ADRAZ AENEX AEUYN AFKRA AJTQC ALIPV ALMA_UNASSIGNED_HOLDINGS AOIJS AZQEC BAWUL BBNVY BCNDV BENPR BHPHI BPHCQ BVXVI C6C CCPQU DIK DWQXO EBD EBLON EBS ESX FYUFA GNUQQ GROUPED_DOAJ GX1 HCIFZ HH5 HMCUK HYE KQ8 LK8 M0L M1P M2P M48 M7P M~E NAO OK1 PIMPY PQQKQ PROAC PSQYO RNT RNTTT RPM SNYQT UKHRP AASML AAYXX AFFHD AFPKN CITATION PHGZM PHGZT PJZUB PPXIY PQGLB NPM 7XB 8FK K9. PKEHL PQEST PQUKI PRINS Q9U 7X8 5PM |
| ID | FETCH-LOGICAL-c492t-cf7c0b07e592953d31ed346d10a176fd3c5c1a5d1bd179d77c7b1b8fc53592103 |
| IEDL.DBID | M2P |
| ISICitedReferencesCount | 0 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=001399011400022&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 2045-2322 |
| IngestDate | Mon Nov 10 04:32:49 EST 2025 Tue Nov 04 02:04:35 EST 2025 Sun Nov 09 10:34:39 EST 2025 Tue Oct 07 07:44:24 EDT 2025 Wed Jan 22 16:37:16 EST 2025 Sat Nov 29 03:22:20 EST 2025 Fri Feb 21 02:37:31 EST 2025 |
| IsDoiOpenAccess | true |
| IsOpenAccess | true |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 1 |
| Language | English |
| License | 2025. The Author(s). Open Access This article is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License, which permits any non-commercial use, sharing, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons licence, and indicate if you modified the licensed material. You do not have permission under this licence to share adapted material derived from this article or parts of it. The images or other third party material in this article are included in the article’s Creative Commons licence, unless indicated otherwise in a credit line to the material. If material is not included in the article’s Creative Commons licence and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder. To view a copy of this licence, visit http://creativecommons.org/licenses/by-nc-nd/4.0/. |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c492t-cf7c0b07e592953d31ed346d10a176fd3c5c1a5d1bd179d77c7b1b8fc53592103 |
| Notes | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 content type line 23 |
| OpenAccessLink | https://www.proquest.com/docview/3156699144?pq-origsite=%requestingapplication% |
| PMID | 39824925 |
| PQID | 3156699144 |
| PQPubID | 2041939 |
| PageCount | 13 |
| ParticipantIDs | doaj_primary_oai_doaj_org_article_49c784847d014f1f9440d400ecff750d pubmedcentral_primary_oai_pubmedcentral_nih_gov_11742064 proquest_miscellaneous_3156968407 proquest_journals_3156699144 pubmed_primary_39824925 crossref_primary_10_1038_s41598_025_85589_9 springer_journals_10_1038_s41598_025_85589_9 |
| PublicationCentury | 2000 |
| PublicationDate | 2025-01-17 |
| PublicationDateYYYYMMDD | 2025-01-17 |
| PublicationDate_xml | – month: 01 year: 2025 text: 2025-01-17 day: 17 |
| PublicationDecade | 2020 |
| PublicationPlace | London |
| PublicationPlace_xml | – name: London – name: England |
| PublicationTitle | Scientific reports |
| PublicationTitleAbbrev | Sci Rep |
| PublicationTitleAlternate | Sci Rep |
| PublicationYear | 2025 |
| Publisher | Nature Publishing Group UK Nature Publishing Group Nature Portfolio |
| Publisher_xml | – name: Nature Publishing Group UK – name: Nature Publishing Group – name: Nature Portfolio |
| References | P Bouyer (85589_CR18) 2010 85589_CR24 M Ummels (85589_CR17) 2011 Y Velner (85589_CR4) 2015; 241 85589_CR20 K Chatterjee (85589_CR26) 2011 A Church (85589_CR9) 1964; 29 R Alur (85589_CR12) 2004; 5 S Almagor (85589_CR21) 2016 P Hunter (85589_CR2) 2018; 735 L Brim (85589_CR5) 2011; 38 A Pnueli (85589_CR10) 1989 ML Puterman (85589_CR25) 2014 85589_CR3 V Bruyère (85589_CR8) 2017; 254 85589_CR13 85589_CR19 R Bloem (85589_CR15) 2012; 78 A Ehrenfeucht (85589_CR16) 1979; 8 N Wallmeier (85589_CR11) 2003 B Jobstmann (85589_CR14) 2005 H Björklund (85589_CR6) 2004; 310 JD López-Barrientos (85589_CR27) 2023 U Zwick (85589_CR7) 1996; 158 J Gutierrez (85589_CR23) 2022; 13 TA Henzinger (85589_CR1) 2012 W Zhao (85589_CR28) 2022; 16 M Jiménez-Lizárraga (85589_CR22) 2024 |
| References_xml | – volume: 13 start-page: 19 year: 2022 ident: 85589_CR23 publication-title: Games doi: 10.3390/g13010019 – ident: 85589_CR3 doi: 10.1007/978-3-642-54830-7_14 – volume: 158 start-page: 343 year: 1996 ident: 85589_CR7 publication-title: Theor. Comput. Sci. doi: 10.1016/0304-3975(95)00188-3 – ident: 85589_CR24 doi: 10.1109/LICS.2015.33 – ident: 85589_CR13 doi: 10.1007/978-3-540-31980-1_31 – ident: 85589_CR19 doi: 10.1109/LICS.2005.26 – volume: 254 start-page: 259 year: 2017 ident: 85589_CR8 publication-title: Inf. Comput. doi: 10.1016/j.ic.2016.10.011 – start-page: 482 volume-title: CONCUR 2011—Concurrency Theory—22nd International Conference, CONCUR 2011, Aachen, Germany, September 6–9, 2011. Proceedings. Lecture Notes in Computer Science year: 2011 ident: 85589_CR17 doi: 10.1007/978-3-642-23217-6_32 – year: 2024 ident: 85589_CR22 publication-title: Int. J. Syst. Sci. doi: 10.1007/978-3-642-22993-0_21 – start-page: 226 volume-title: Computer Aided Verification, 17th International Conference, CAV 2005, Edinburgh, Scotland, UK, July 6–10, 2005, Proceedings. Lecture Notes in Computer Science year: 2005 ident: 85589_CR14 doi: 10.1007/11513988_23 – volume: 38 start-page: 97 year: 2011 ident: 85589_CR5 publication-title: Formal Methods Syst. Des. doi: 10.1007/s10703-010-0105-x – volume: 29 start-page: 210 year: 1964 ident: 85589_CR9 publication-title: J. Symb. Logic – start-page: 652 volume-title: Automata, Languages and Programming, 16th International Colloquium, ICALP89, Stresa, Italy, July 11–15, 1989, Proceedings. Lecture Notes in Computer Science year: 1989 ident: 85589_CR10 doi: 10.1007/BFb0035790 – volume: 8 start-page: 109 year: 1979 ident: 85589_CR16 publication-title: Int. J. Game Theory doi: 10.1007/BF01768705 – volume: 241 start-page: 177 year: 2015 ident: 85589_CR4 publication-title: Inf. Comput. doi: 10.1016/j.ic.2015.03.001 – volume: 310 start-page: 365 year: 2004 ident: 85589_CR6 publication-title: Theor. Comput. Sci. doi: 10.1016/S0304-3975(03)00427-4 – volume-title: Markov Decision Processes: Discrete Stochastic Dynamic Programming year: 2014 ident: 85589_CR25 – start-page: 11 volume-title: Implementation and Application of Automata, 8th International Conference, CIAA 2003, Santa Barbara, California, USA, July 16–18, 2003, Proceedings. Lecture Notes in Computer Science year: 2003 ident: 85589_CR11 doi: 10.1007/3-540-45089-0_3 – start-page: 1 volume-title: Model Driven Engineering Languages and Systems—15th International Conference, MODELS 2012, Innsbruck, Austria, September 30–October 5, 2012. Proceedings. Lecture Notes in Computer Science year: 2012 ident: 85589_CR1 doi: 10.1007/978-3-642-33666-9_1 – volume: 78 start-page: 911 year: 2012 ident: 85589_CR15 publication-title: J. Comput. Syst. Sci. doi: 10.1016/j.jcss.2011.08.007 – year: 2023 ident: 85589_CR27 publication-title: Cybern. Syst. doi: 10.1080/01969722.2023.2175492 – start-page: 192 volume-title: CONCUR 2010—Concurrency Theory, 21st International Conference, CONCUR 2010, Paris, France, August 31–September 3, 2010. Proceedings. Lecture Notes in Computer Science year: 2010 ident: 85589_CR18 doi: 10.1007/978-3-642-15375-4_14 – volume: 16 year: 2022 ident: 85589_CR28 publication-title: Front. Comput. Sci. doi: 10.1007/s11704-020-0076-z – start-page: 9:1 volume-title: 27th International Conference on Concurrency Theory, CONCUR 2016, August 23–26, 2016, Québec City, Canada. LIPIcs year: 2016 ident: 85589_CR21 doi: 10.4230/LIPIcs.CONCUR.2016.9 – volume: 735 start-page: 82 year: 2018 ident: 85589_CR2 publication-title: Theor. Comput. Sci. doi: 10.1016/j.tcs.2017.03.038 – start-page: 206 volume-title: Mathematical Foundations of Computer Science 2011—36th International Symposium, MFCS 2011, Warsaw, Poland, August 22–26, 2011. Proceedings. Lecture Notes in Computer Science year: 2011 ident: 85589_CR26 doi: 10.1007/978-3-642-22993-0_21 – ident: 85589_CR20 doi: 10.1109/LICS.2015.32 – volume: 5 start-page: 1 year: 2004 ident: 85589_CR12 publication-title: ACM Trans. Comput. Log. doi: 10.1145/963927.963928 |
| SSID | ssj0000529419 |
| Score | 2.4401605 |
| Snippet | The traditional synthesis problem aims to automatically construct a reactive system (if it exists) satisfying a given Linear Temporal Logic (LTL)... Abstract The traditional synthesis problem aims to automatically construct a reactive system (if it exists) satisfying a given Linear Temporal Logic (LTL)... |
| SourceID | doaj pubmedcentral proquest pubmed crossref springer |
| SourceType | Open Website Open Access Repository Aggregation Database Index Database Publisher |
| StartPage | 2291 |
| SubjectTerms | 639/166/987 639/705/1041 639/705/794 Algorithms Humanities and Social Sciences multidisciplinary Science Science (multidisciplinary) |
| SummonAdditionalLinks | – databaseName: DOAJ Directory of Open Access Journals dbid: DOA link: http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV1LbxQxDLZQBRIXRFseA6WaStwgajJJNsmxICoOVcUBpN6iPGEvs9XOFmn59TiZ2W2Xh7hwnWQk67Md24rzGeC1c4nKKAyJPhkiOuqJmblMpIg6epmFDJVd_0JdXuqrK_Ppzqiv0hM20gOPwJ0KE5QWeIZGTOYzy0YIGtHwUsgZo10spy9V5k4xNbJ6d0YwM72SoVyfDhipymuyThItpTbE7ESiStj_pyzz92bJX25MayA6fwyPpgyyPRsl34d7qT-AB-NMyfUhXJy1w7rHtG6YD-04H7rFxLT9kZYLgmaH31xPrt16kXPrcGso9LhY_7dltkzl2y3Uze3X0j77BL6cf_j8_iOZRiaQIEy3IiGrQD1VSWLaI3nkLEUuZpFRx9QsRx5kYE5G5iN6YlQqKM-8zkFy_AOBegp7_aJPz6Hl3mkeQi69MSJ20XisJTsWqRbBJO4beLOBz16PzBi23mhzbUewLYJtK9jWNPCuILzdWVit6wfUtZ10bf-l6waONvqxk6sNlpcKFLNcIRo42S6jk5SbD9cnBLDuMYXWRjXwbFTnVhJudGFNlA3oHUXviLq70s-_VSJuhuVchzldA283NnEr19-xePE_sHgJD7tizJQRpo5gb7W8Sa_gfvi-mg_L4-oNPwFZrgz3 priority: 102 providerName: Directory of Open Access Journals |
| Title | A synthesis method for zero-sum mean-payoff asynchronous probabilistic games |
| URI | https://link.springer.com/article/10.1038/s41598-025-85589-9 https://www.ncbi.nlm.nih.gov/pubmed/39824925 https://www.proquest.com/docview/3156699144 https://www.proquest.com/docview/3156968407 https://pubmed.ncbi.nlm.nih.gov/PMC11742064 https://doaj.org/article/49c784847d014f1f9440d400ecff750d |
| Volume | 15 |
| WOSCitedRecordID | wos001399011400022&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: 2045-2322 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0000529419 issn: 2045-2322 databaseCode: DOA dateStart: 20110101 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: 2045-2322 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0000529419 issn: 2045-2322 databaseCode: M~E dateStart: 20110101 isFulltext: true titleUrlDefault: https://road.issn.org providerName: ISSN International Centre – providerCode: PRVPQU databaseName: AUTh Library subscriptions: ProQuest Central customDbUrl: eissn: 2045-2322 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0000529419 issn: 2045-2322 databaseCode: BENPR dateStart: 20110101 isFulltext: true titleUrlDefault: https://www.proquest.com/central providerName: ProQuest – providerCode: PRVPQU databaseName: Biological Science Database customDbUrl: eissn: 2045-2322 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0000529419 issn: 2045-2322 databaseCode: M7P dateStart: 20110101 isFulltext: true titleUrlDefault: http://search.proquest.com/biologicalscijournals providerName: ProQuest – providerCode: PRVPQU databaseName: Health & Medical Collection customDbUrl: eissn: 2045-2322 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0000529419 issn: 2045-2322 databaseCode: 7X7 dateStart: 20110101 isFulltext: true titleUrlDefault: https://search.proquest.com/healthcomplete providerName: ProQuest – providerCode: PRVPQU databaseName: Publicly Available Content Database customDbUrl: eissn: 2045-2322 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0000529419 issn: 2045-2322 databaseCode: PIMPY dateStart: 20110101 isFulltext: true titleUrlDefault: http://search.proquest.com/publiccontent providerName: ProQuest – providerCode: PRVPQU databaseName: Science Database customDbUrl: eissn: 2045-2322 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0000529419 issn: 2045-2322 databaseCode: M2P dateStart: 20110101 isFulltext: true titleUrlDefault: https://search.proquest.com/sciencejournals providerName: ProQuest |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1Lb9QwEB7RLkhceEMDZRUkbmA1ju21fUItagVSu4oQSMspSvwoe0m2my3S8usZO9mtlteFiw-JE9meGfuzZ_wNwOuqcpmwXBNbO014ntVETypPBLfK1sJzYSK7_rmcTtVspovhwK0bwio3c2KcqG1rwhn5EQsbDQQznL9bXJGQNSp4V4cUGnswQmRDQ0jXRV5sz1iCF4tTPdyVyZg66nC9CnfKckGUEEoTvbMeRdr-P2HN30Mmf_GbxuXo7P7_duQB3BuAaHrca85DuOWaR3CnT025fgznx2m3bhAddvMu7dNMp4hv0x9u2RL8Cz6rGrKo1q33aYVVTWDZba-7NKSoibS9gQE6vQxRuE_gy9np5_cfyJB5gRiu8xUxXpqszqQTiJ4Es4w6y_jE0qyicuItM8LQSlhaWzRoK6WRNa2VN4LhFzjST2G_aRt3ACmrK8WM8SHEhtvc6hq3pDm1meJGO1Yn8GYz_uWiJ9goo2OcqbKXVonSKqO0Sp3ASRDRtmYgx44P2uVlOdhaybWRiuOya3H_56nXnGcW5ypnvEeAZBM43EimHCy2K2_EksCr7Wu0teBAqRqHAxjr6MCOIxN41uvDtiVMq0C-KBJQO5qy09TdN838W-TzprgrzBEaJvB2o1Q37fr7WDz_dzdewN086HlGCZWHsL9aXruXcNt8X8275Rj25EzGUo1hdHI6LT6N43nEOJpQKCWWo-LjRfH1J5phIrM |
| linkProvider | ProQuest |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V1Lb9QwEB6VAoIL70egQJDgBFbj2N7YB4TKo2rVZdVDkXoziR9lL8my2YKWH8VvZOwkWy2vWw9cEydynM_jbzzjbwCelaXLhOWK2MopwvOsImpUeiK4lbYSngsT1fXHxWQij4_V4Qb8GM7ChLTKwSZGQ20bE_bIt1lwNJDMcP569oWEqlEhujqU0OhgceCW39Bla1_tv8P_-zzPd98fvd0jfVUBYrjKF8T4wmRVVjiBzEAwy6izjI8szUpajLxlRhhaCksri2C1RWGKilbSG8HwCZoxfO8FuMiDslhIFcwPV3s6IWrGqerP5mRMbre4PoYzbLkgUgipiFpb_2KZgD9x299TNH-J08blb_f6_zZwN-BaT7TTnW5m3IQNV9-Cy13pzeVtGO-k7bJG9ttO27Qro50if0-_u3lDsNd4razJrFw23qclNjVBRbg5bdNQgifKEgeF6_QkZBnfgY_n8il3YbNuancfUlaVkhnjQwoRt7lVFbrcObWZ5EY5ViXwYvjfetYJiOgY-GdSd-jQiA4d0aFVAm8CJFYtg_h3vNDMT3RvSzRXppAcaYVF_9ZTrxCLFm2xM94jAbQJbA1I0L1FavUZDBJ4urqNtiQEiMra4QDGNiqo_xQJ3Ovwt-oJUzKIS4oE5Boy17q6fqeefo565RS93hypbwIvBxCf9evvY_Hg35_xBK7sHX0Y6_H-5OAhXM3DHMsoocUWbC7mp-4RXDJfF9N2_jhO0hQ-nTe4fwICtHgw |
| linkToPdf | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V1Lj9MwEB4tXUBceD8CCwQJTmA1ju3GPiC0sFRUW6oeQFpO3sSPpZekNF1Q-Wn8OsZJ2lV53fbANXYi2_k8_sYefwPwNM9dIixXxBZOEZ4mBVGD3BPBrbSF8FyYRl1_nE0m8uhITXfgx_ouTAirXNvExlDbyoQ98j4LjgaSGc77vguLmB4MX82_kJBBKpy0rtNptBA5dKtv6L7VL0cH-K-fpenw7Yc370iXYYAYrtIlMT4zSZFkTiBLEMwy6izjA0uTnGYDb5kRhubC0sIicG2WmayghfRGMHyDJgy_ewF2kZLztAe709H76afNDk84Q-NUdTd1Eib7Na6W4UZbKogUQiqitlbDJmnAn5ju7wGbv5zaNovh8Nr_PIzX4WpHweP9ds7cgB1X3oRLbVLO1S0Y78f1qkReXM_quE2wHSOzj7-7RUWw1fgsL8k8X1XexzlWNUFfuDqt45CcpxEsDtrX8UmIP74NH8-lK3egV1aluwcxK3LJjPEhuIjb1KoCnfGU2kRyoxwrIni-_vd63kqL6CYkgEndIkUjUnSDFK0ieB3gsakZZMGbB9XiRHdWRnNlMsmRcFj0fD31ivPEopV2xnukhjaCvTUqdGeran0GiQiebIrRyoSjo7x0OIBNHRV0gbII7rZY3LSEKRlkJ0UEcgulW03dLilnnxslc4r-cIqkOIIXa0CftevvY3H_3914DJcR03o8mhw-gCtpmG4JJTTbg95yceoewkXzdTmrF4-6GRvD8Xmj-yfR_YJ5 |
| 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=A+synthesis+method+for+zero-sum+mean-payoff+asynchronous+probabilistic+games&rft.jtitle=Scientific+reports&rft.au=Zhao%2C+Wei&rft.au=Liu%2C+Wanwei&rft.au=Liu%2C+Zhiming&rft.au=Wang%2C+Tiexin&rft.date=2025-01-17&rft.pub=Nature+Publishing+Group+UK&rft.eissn=2045-2322&rft.volume=15&rft_id=info:doi/10.1038%2Fs41598-025-85589-9&rft_id=info%3Apmid%2F39824925&rft.externalDocID=PMC11742064 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=2045-2322&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=2045-2322&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=2045-2322&client=summon |