{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T21:39:18Z","timestamp":1742938758990,"version":"3.40.3"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030921361"},{"type":"electronic","value":"9783030921378"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"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":[[2021]]},"DOI":"10.1007\/978-3-030-92137-8_4","type":"book-chapter","created":{"date-parts":[[2021,11,30]],"date-time":"2021-11-30T17:38:55Z","timestamp":1638293935000},"page":"53-69","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Model Checking and Strategy Synthesis for Multi-agent Systems for Resource Allocation"],"prefix":"10.1007","author":[{"given":"Nils","family":"Timm","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Josua","family":"Botha","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,11,26]]},"reference":[{"issue":"5","key":"4_CR1","doi-asserted-by":"publisher","first-page":"672","DOI":"10.1145\/585265.585270","volume":"49","author":"R Alur","year":"2002","unstructured":"Alur, R., Henzinger, T.A., Kupferman, O.: Alternating-time temporal logic. J. ACM (JACM) 49(5), 672\u2013713 (2002)","journal-title":"J. ACM (JACM)"},{"key":"4_CR2","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":"4_CR3","volume-title":"Principles of Model Checking","author":"C Baier","year":"2008","unstructured":"Baier, C., Katoen, J.P.: Principles of Model Checking. MIT Press, Cambridge (2008)"},{"issue":"2\u20134","key":"4_CR4","first-page":"75","volume":"4","author":"A Biere","year":"2008","unstructured":"Biere, A.: PicoSAT essentials. J. Satisf. Boolean Model. Comput. 4(2\u20134), 75\u201397 (2008)","journal-title":"J. Satisf. Boolean Model. Comput."},{"key":"4_CR5","unstructured":"Biere, A., Cimatti, A., Clarke, E.M., Strichman, O., Zhu, Y.: Bounded model checking. In: Handbook of Satisfiability, vol. 185, no. 99, pp. 457\u2013481 (2009)"},{"issue":"4","key":"4_CR6","doi-asserted-by":"publisher","first-page":"410","DOI":"10.1007\/s100090050046","volume":"2","author":"A Cimatti","year":"2000","unstructured":"Cimatti, A., Clarke, E., Giunchiglia, F., Roveri, M.: NUSMV: a new symbolic model checker. STTT 2(4), 410\u2013425 (2000). https:\/\/doi.org\/10.1007\/s100090050046","journal-title":"STTT"},{"key":"4_CR7","doi-asserted-by":"crossref","unstructured":"Cohen, M., Dam, M., Lomuscio, A., Qu, H.: A symmetry reduction technique for model checking temporal-epistemic logic. In: IJCAI (2009)","DOI":"10.1007\/978-3-642-04761-9_6"},{"key":"4_CR8","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1007\/978-3-030-14174-5_3","volume-title":"Multi-Agent Systems","author":"R De Masellis","year":"2019","unstructured":"De Masellis, R., Goranko, V., Gruner, S., Timm, N.: Generalising the dining philosophers problem: competitive dynamic resource allocation in multi-agent systems. In: Slavkovik, M. (ed.) EUMAS 2018. LNCS (LNAI), vol. 11450, pp. 30\u201347. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-14174-5_3"},{"key":"4_CR9","doi-asserted-by":"publisher","first-page":"817","DOI":"10.1613\/jair.1.11936","volume":"68","author":"W Jamroga","year":"2020","unstructured":"Jamroga, W., Penczek, W., Sidoruk, T., Dembi\u0144ski, P., Mazurkiewicz, A.: Towards partial order reductions for strategic ability. JAIR 68, 817\u2013850 (2020)","journal-title":"JAIR"},{"key":"4_CR10","doi-asserted-by":"crossref","unstructured":"Kacprzak, M., Penczek, W.: Unbounded model checking for alternating-time temporal logic. In: CAV, pp. 646\u2013653. IEEE (2004)","DOI":"10.1007\/1-4020-4094-6_9"},{"key":"4_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"557","DOI":"10.1007\/978-3-642-22110-1_44","volume-title":"Computer Aided Verification","author":"D Kroening","year":"2011","unstructured":"Kroening, D., Ouaknine, J., Strichman, O., Wahl, T., Worrell, J.: Linear completeness thresholds for bounded model checking. In: Gopalakrishnan, G., Qadeer, S. (eds.) CAV 2011. LNCS, vol. 6806, pp. 557\u2013572. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-22110-1_44"},{"issue":"16\u201317","key":"4_CR12","doi-asserted-by":"publisher","first-page":"1011","DOI":"10.1016\/j.artint.2007.05.005","volume":"171","author":"A Lomuscio","year":"2007","unstructured":"Lomuscio, A., Penczek, W., Wo\u017ana, B.: Bounded model checking for knowledge and real time. Artif. Intell. 171(16\u201317), 1011\u20131038 (2007)","journal-title":"Artif. Intell."},{"issue":"1","key":"4_CR13","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. STTT 19(1), 9\u201330 (2017). https:\/\/doi.org\/10.1007\/s10009-015-0378-x","journal-title":"STTT"},{"key":"4_CR14","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1007\/11941439_11","volume-title":"AI 2006: Advances in Artificial Intelligence","author":"X Luo","year":"2006","unstructured":"Luo, X., Su, K., Sattar, A., Reynolds, M.: Verification of multi-agent systems via bounded model checking. In: Sattar, A., Kang, B. (eds.) AI 2006. LNCS (LNAI), vol. 4304, pp. 69\u201378. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11941439_11"},{"issue":"7","key":"4_CR15","first-page":"1871","volume":"27","author":"J Pilecki","year":"2017","unstructured":"Pilecki, J., Bednarczyk, M.A., Jamroga, W.: SMC: synthesis of uniform strategies and verification of strategic ability for multi-agent systems. J. Log. Comput. 27(7), 1871\u20131895 (2017)","journal-title":"J. Log. Comput."},{"issue":"2","key":"4_CR16","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1016\/j.jal.2005.12.010","volume":"5","author":"F Raimondi","year":"2007","unstructured":"Raimondi, F., Lomuscio, A.: Automatic verification of multi-agent systems by model checking via ordered binary decision diagrams. J. Appl. Log. 5(2), 235\u2013251 (2007)","journal-title":"J. Appl. Log."},{"key":"4_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1007\/978-3-540-70583-3_31","volume-title":"Automata, Languages and Programming","author":"S Schewe","year":"2008","unstructured":"Schewe, S.: ATL* satisfiability is 2EXPTIME-complete. In: Aceto, L., Damg\u00e5rd, I., Goldberg, L.A., Halld\u00f3rsson, M.M., Ing\u00f3lfsd\u00f3ttir, A., Walukiewicz, I. (eds.) ICALP 2008. LNCS, vol. 5126, pp. 373\u2013385. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-70583-3_31"}],"container-title":["Lecture Notes in Computer Science","Formal Methods: Foundations and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-92137-8_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,4]],"date-time":"2021-12-04T00:06:33Z","timestamp":1638576393000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-92137-8_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030921361","9783030921378"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-92137-8_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"26 November 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SBMF","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Brazilian Symposium on Formal Methods","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 December 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 December 2021","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":"sbmf2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/sites.google.com\/computacao.ufcg.edu.br\/sbmf2021\/home","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-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":"15","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":"8","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":"0","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":"53% - 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":"2","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)"}}]}}