{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T03:54:16Z","timestamp":1742961256663,"version":"3.40.3"},"publisher-location":"Cham","reference-count":37,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031212024"},{"type":"electronic","value":"9783031212031"}],"license":[{"start":{"date-parts":[[2022,11,12]],"date-time":"2022-11-12T00:00:00Z","timestamp":1668211200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,11,12]],"date-time":"2022-11-12T00:00:00Z","timestamp":1668211200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-21203-1_11","type":"book-chapter","created":{"date-parts":[[2022,11,11]],"date-time":"2022-11-11T07:35:25Z","timestamp":1668152125000},"page":"173-191","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Assume-Guarantee Verification of\u00a0Strategic Ability"],"prefix":"10.1007","author":[{"given":"\u0141ukasz","family":"Mikulski","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wojciech","family":"Jamroga","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Damian","family":"Kurpiewski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,11,12]]},"reference":[{"issue":"1","key":"11_CR1","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1023\/A:1008739929481","volume":"15","author":"R Alur","year":"1999","unstructured":"Alur, R., Henzinger, T.: Reactive modules. Form. Meth. Syst. Des. 15(1), 7\u201348 (1999)","journal-title":"Form. Meth. Syst. Des."},{"key":"11_CR2","doi-asserted-by":"publisher","first-page":"672","DOI":"10.1145\/585265.585270","volume":"49","author":"R Alur","year":"2002","unstructured":"Alur, R., Henzinger, T., Kupferman, O.: Alternating-time temporal logic. J. ACM 49, 672\u2013713 (2002)","journal-title":"J. ACM"},{"key":"11_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"521","DOI":"10.1007\/BFb0028774","volume-title":"Computer Aided Verification","author":"R Alur","year":"1998","unstructured":"Alur, R., Henzinger, T.A., Mang, F.Y.C., Qadeer, S., Rajamani, S.K., Tasiran, S.: MOCHA: modularity in model checking. In: Hu, A.J., Vardi, M.Y. (eds.) CAV 1998. LNCS, vol. 1427, pp. 521\u2013525. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/BFb0028774"},{"key":"11_CR4","doi-asserted-by":"crossref","unstructured":"Alur, R., Henzinger, T., Vardi, M.: Parametric real-time reasoning. In: Proceedings of STOC, pp. 592\u2013601. ACM (1993)","DOI":"10.1145\/167088.167242"},{"key":"11_CR5","doi-asserted-by":"publisher","unstructured":"Bulling, N., Dix, J., Jamroga, W.: Model checking logics of strategic ability: complexity. In: Dastani, M., Hindriks, K., Meyer, J.J. (eds.) Specification and Verification of Multi-agent Systems, pp. 125\u2013159. Springer, Boston (2010). https:\/\/doi.org\/10.1007\/978-1-4419-6984-2_5","DOI":"10.1007\/978-1-4419-6984-2_5"},{"key":"11_CR6","doi-asserted-by":"publisher","first-page":"128","DOI":"10.1016\/j.ic.2015.03.014","volume":"242","author":"S Busard","year":"2015","unstructured":"Busard, S., Pecheur, C., Qu, H., Raimondi, F.: Reasoning about memoryless strategies under partial observability and unconditional fairness constraints. Inf. Comp. 242, 128\u2013156 (2015)","journal-title":"Inf. Comp."},{"key":"11_CR7","doi-asserted-by":"crossref","unstructured":"Cerm\u00e1k, P., Lomuscio, A., Murano, A.: Verifying and synthesising multi-agent systems against one-goal strategy logic specifications. In: Proceedings of AAAI, pp. 2038\u20132044 (2015)","DOI":"10.1609\/aaai.v29i1.9444"},{"key":"11_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1007\/978-3-540-71209-1_21","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"K Chatterjee","year":"2007","unstructured":"Chatterjee, K., Henzinger, T.A.: Assume-guarantee synthesis. In: Grumberg, O., Huth, M. (eds.) TACAS 2007. LNCS, vol. 4424, pp. 261\u2013275. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-71209-1_21"},{"key":"11_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"643","DOI":"10.1007\/978-3-642-16558-0_52","volume-title":"Leveraging Applications of Formal Methods, Verification, and Validation","author":"Y-F Chen","year":"2010","unstructured":"Chen, Y.-F., et al.: Comparing learning algorithms in automated assume-guarantee reasoning. In: Margaria, T., Steffen, B. (eds.) ISoLA 2010. LNCS, vol. 6415, pp. 643\u2013657. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-16558-0_52"},{"key":"11_CR10","unstructured":"Clarke, E., Long, D., McMillan, K.: Compositional model checking. In: Proceeding of LICS, pp. 353\u2013362. IEEE Computer Society Press (1989)"},{"key":"11_CR11","unstructured":"Devereux, B.: Compositional reasoning about aspects using alternating-time logic. In: Proceedings of FOAL, pp. 45\u201350 (2003)"},{"key":"11_CR12","unstructured":"Dima, C., Tiplea, F.: Model-checking ATL under imperfect information and perfect recall semantics is undecidable. CoRR abs\/1102.4225 (2011)"},{"key":"11_CR13","doi-asserted-by":"crossref","unstructured":"Fijalkow, N., Maubert, B., Murano, A., Vardi, M.: Assume-guarantee synthesis for prompt linear temporal logic. In: Proceedings of IJCAI, pp. 117\u2013123. ijcai.org (2020)","DOI":"10.24963\/ijcai.2020\/17"},{"key":"11_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s11334-022-00450-w","volume":"18","author":"B Finkbeiner","year":"2022","unstructured":"Finkbeiner, B., Passing, N.: Compositional synthesis of modular systems. Innov. Syst. Softw. Eng. 18, 1\u201315 (2022)","journal-title":"Innov. Syst. Softw. Eng."},{"issue":"3","key":"11_CR15","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1007\/s10515-005-2641-y","volume":"12","author":"D Giannakopoulou","year":"2005","unstructured":"Giannakopoulou, D., Pasareanu, C., Barringer, H.: Component verification with automatically generated assumptions. Autom. Softw. Eng. 12(3), 297\u2013320 (2005)","journal-title":"Autom. Softw. Eng."},{"issue":"1","key":"11_CR16","doi-asserted-by":"publisher","first-page":"93","DOI":"10.3166\/jancl.21.93-131","volume":"21","author":"D Guelev","year":"2011","unstructured":"Guelev, D., Dima, C., Enea, C.: An alternating-time temporal logic with knowledge, perfect recall and past: axiomatisation and model-checking. J. Appl. Non-Classical Log. 21(1), 93\u2013131 (2011)","journal-title":"J. Appl. Non-Classical Log."},{"key":"11_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"310","DOI":"10.1007\/978-3-319-41528-4_17","volume-title":"Computer Aided Verification","author":"F He","year":"2016","unstructured":"He, F., Mao, S., Wang, B.-Y.: Learning-based assume-guarantee regression verification. In: Chaudhuri, S., Farzan, A. (eds.) CAV 2016. LNCS, vol. 9779, pp. 310\u2013328. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-41528-4_17"},{"key":"11_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"440","DOI":"10.1007\/BFb0028765","volume-title":"Computer Aided Verification","author":"TA Henzinger","year":"1998","unstructured":"Henzinger, T.A., Qadeer, S., Rajamani, S.K.: You assume, we guarantee: methodology and case studies. In: Hu, A.J., Vardi, M.Y. (eds.) CAV 1998. LNCS, vol. 1427, pp. 440\u2013451. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/BFb0028765"},{"issue":"10","key":"11_CR19","doi-asserted-by":"publisher","first-page":"576","DOI":"10.1145\/363235.363259","volume":"12","author":"C Hoare","year":"1969","unstructured":"Hoare, C.: An axiomatic basis for computer programming. Commun. ACM 12(10), 576\u2013580 (1969)","journal-title":"Commun. ACM"},{"key":"11_CR20","doi-asserted-by":"crossref","unstructured":"Huang, X., van der Meyden, R.: Symbolic model checking epistemic strategy logic. In: Proceedings of AAAI, pp. 1426\u20131432 (2014)","DOI":"10.1609\/aaai.v28i1.8894"},{"key":"11_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/978-3-030-60347-2_9","volume-title":"Electronic Voting","author":"W Jamroga","year":"2020","unstructured":"Jamroga, W., Kim, Y., Kurpiewski, D., Ryan, P.Y.A.: Towards model checking of voting protocols in UPPAAL. In: Krimmer, R., et al. (eds.) E-Vote-ID 2020. LNCS, vol. 12455, pp. 129\u2013146. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-60347-2_9"},{"key":"11_CR22","doi-asserted-by":"crossref","unstructured":"Jamroga, W., Knapik, M., Kurpiewski, D., Mikulski, \u0141.: Approximate verification of strategic abilities under imperfect information. Artif. Int. 277, 103172 (2019)","DOI":"10.1016\/j.artint.2019.103172"},{"key":"11_CR23","doi-asserted-by":"crossref","unstructured":"Jamroga, W., Penczek, W., Sidoruk, T.: Strategic abilities of asynchronous agents: Semantic side effects and how to tame them. In: Proceedings of KR, pp. 368\u2013378 (2021)","DOI":"10.24963\/kr.2021\/35"},{"key":"11_CR24","unstructured":"Jones, C.: Specification and design of (parallel) programs. In: Proceedings of IFIP, pp. 321\u2013332. North-Holland\/IFIP (1983)"},{"key":"11_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"328","DOI":"10.1007\/978-3-642-17164-2_23","volume-title":"Programming Languages and Systems","author":"S Kong","year":"2010","unstructured":"Kong, S., Jung, Y., David, C., Wang, B.-Y., Yi, K.: Automatically inferring quantified loop invariants by algorithmic learning from simple templates. In: Ueda, K. (ed.) APLAS 2010. LNCS, vol. 6461, pp. 328\u2013343. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-17164-2_23"},{"key":"11_CR26","doi-asserted-by":"crossref","unstructured":"Kurpiewski, D., Marmsoler, D.: Strategic logics for collaborative embedded systems. SICS Soft. Int. Cyber-Phys. Syst. 34(4), 201\u2013212 (2019)","DOI":"10.1007\/s00450-019-00424-7"},{"key":"11_CR27","unstructured":"Kurpiewski, D., Pazderski, W., Jamroga, W., Kim, Y.: STV+reductions: towards practical verification of strategic ability using model reductions. In: Proceedings of AAMAS, pp. 1770\u20131772. ACM (2021)"},{"key":"11_CR28","doi-asserted-by":"crossref","unstructured":"Kurpiewski, D., Mikulski, \u0141., Jamroga, W.: STV+AGR: towards verification of strategic ability using assume-guarantee reasoning. In: Proceedings of PRIMA (2022)","DOI":"10.1007\/978-3-031-21203-1_47"},{"key":"11_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/978-3-642-12002-2_3","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"M Kwiatkowska","year":"2010","unstructured":"Kwiatkowska, M., Norman, G., Parker, D., Qu, H.: Assume-guarantee verification for probabilistic systems. In: Esparza, J., Majumdar, R. (eds.) TACAS 2010. LNCS, vol. 6015, pp. 23\u201337. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-12002-2_3"},{"issue":"1","key":"11_CR30","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1007\/s10009-015-0378-x","volume":"19","author":"A Lomuscio","year":"2017","unstructured":"Lomuscio, A., Qu, H., Raimondi, F.: MCMAS: an open-source model checker for the verification of multi-agent systems. Int. J. Soft. Tools Tech. Trans. 19(1), 9\u201330 (2017)","journal-title":"Int. J. Soft. Tools Tech. Trans."},{"key":"11_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"204","DOI":"10.1007\/978-3-642-16901-4_15","volume-title":"Formal Methods and Software Engineering","author":"A Lomuscio","year":"2010","unstructured":"Lomuscio, A., Strulo, B., Walker, N., Wu, P.: Assume-guarantee reasoning with local specifications. In: Dong, J.S., Zhu, H. (eds.) ICFEM 2010. LNCS, vol. 6447, pp. 204\u2013219. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-16901-4_15"},{"issue":"4","key":"11_CR32","doi-asserted-by":"publisher","first-page":"419","DOI":"10.1142\/S0129054113500123","volume":"24","author":"A Lomuscio","year":"2013","unstructured":"Lomuscio, A., Strulo, B., Walker, N., Wu, P.: Assume-guarantee reasoning with local specifications. Int. J. Found. Comput. Sci. 24(4), 419\u2013444 (2013)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"11_CR33","doi-asserted-by":"crossref","unstructured":"Mikulski, \u0141., Jamroga, W., Kurpiewski, D.: Towards assume-guarantee verification of strategic ability. In: Proceedings of of AAMAS 2022, pp. 1702\u20131704. IFAAMAS (2022)","DOI":"10.1007\/978-3-031-21203-1_11"},{"issue":"4","key":"11_CR34","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2631917","volume":"15","author":"F Mogavero","year":"2014","unstructured":"Mogavero, F., Murano, A., Perelli, G., Vardi, M.: Reasoning about strategies: on the model-checking problem. ACM Trans. Comp. Log. 15(4), 1\u201342 (2014)","journal-title":"ACM Trans. Comp. Log."},{"issue":"5","key":"11_CR35","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1145\/360051.360224","volume":"19","author":"S Owicki","year":"1976","unstructured":"Owicki, S., Gries, D.: Verifying properties of parallel programs: an axiomatic approach. Commun. ACM 19(5), 279\u2013285 (1976)","journal-title":"Commun. ACM"},{"key":"11_CR36","doi-asserted-by":"publisher","unstructured":"Pnueli, A.: In transition from global to modular temporal reasoning about programs. In: Apt, K.R. (ed.) Logics and Models of Concurrent Systems. NATO ASI Series, vol. 13, pp. 123\u2013144. Springer, Heidelberg (1984). https:\/\/doi.org\/10.1007\/978-3-642-82453-1_5","DOI":"10.1007\/978-3-642-82453-1_5"},{"issue":"2","key":"11_CR37","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1016\/S1571-0661(05)82604-0","volume":"85","author":"P Schobbens","year":"2004","unstructured":"Schobbens, P.: Alternating-time logic with imperfect recall. Electr. Not. Theor. Comput. Sci. 85(2), 82\u201393 (2004)","journal-title":"Electr. Not. Theor. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","PRIMA 2022: Principles and Practice of Multi-Agent Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-21203-1_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,3,11]],"date-time":"2023-03-11T20:41:01Z","timestamp":1678567261000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-21203-1_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,11,12]]},"ISBN":["9783031212024","9783031212031"],"references-count":37,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-21203-1_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022,11,12]]},"assertion":[{"value":"12 November 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"PRIMA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Principles and Practice of Multi-Agent Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Valencia","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Spain","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 November 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 November 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"prima2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/prima2022.webs.upv.es\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"100","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"31","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"15","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"31% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"1 (demo paper)","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}