{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,14]],"date-time":"2026-02-14T05:13:42Z","timestamp":1771046022875,"version":"3.50.1"},"publisher-location":"Cham","reference-count":39,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031331695","type":"print"},{"value":"9783031331701","type":"electronic"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-33170-1_15","type":"book-chapter","created":{"date-parts":[[2023,6,2]],"date-time":"2023-06-02T12:55:27Z","timestamp":1685710527000},"page":"241-259","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Quantitative Verification and\u00a0Strategy Synthesis for\u00a0BDI Agents"],"prefix":"10.1007","author":[{"given":"Blair","family":"Archibald","sequence":"first","affiliation":[]},{"given":"Muffy","family":"Calder","sequence":"additional","affiliation":[]},{"given":"Michele","family":"Sevegnani","sequence":"additional","affiliation":[]},{"given":"Mengwei","family":"Xu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,6,3]]},"reference":[{"key":"15_CR1","unstructured":"Bratman, M.: Intention, Plans, and Practical Reason. Harvard University Press (1987)"},{"key":"15_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1007\/BFb0031845","volume-title":"Agents Breaking Away","author":"AS Rao","year":"1996","unstructured":"Rao, A.S.: AgentSpeak(L): BDI agents speak out in a logical computable language. In: Van de Velde, W., Perram, J.W. (eds.) MAAMAW 1996. LNCS, vol. 1038, pp. 42\u201355. Springer, Heidelberg (1996). https:\/\/doi.org\/10.1007\/BFb0031845"},{"key":"15_CR3","unstructured":"Winikoff, M., Padgham, L., Harland, J., Thangarajah, J.: Declarative and procedural goals in intelligent agent systems. In: The 8th International Conference on Principles of Knowledge Representation and Reasoning. Morgan Kaufman (2002)"},{"key":"15_CR4","doi-asserted-by":"crossref","unstructured":"Hindriks, K.V., De Boer, F.S., Van der Hoek, W., Meyer, J.-J.Ch.: Agent programming in 3APL. Auton. Agents Multi-Agent Syst. 2(4), 357\u2013401 (1999)","DOI":"10.1023\/A:1010084620690"},{"issue":"3","key":"15_CR5","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1007\/s10458-008-9036-y","volume":"16","author":"M Dastani","year":"2008","unstructured":"Dastani, M.: 2APL: a practical agent programming language. Auton. Agent. Multi-Agent Syst. 16(3), 214\u2013248 (2008)","journal-title":"Auton. Agent. Multi-Agent Syst."},{"key":"15_CR6","series-title":"Multiagent Systems, Artificial Societies, and Simulated Organizations","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1007\/0-387-26350-0_7","volume-title":"Multi-Agent Programming","author":"M Winikoff","year":"2005","unstructured":"Winikoff, M.: Jack\u2122 intelligent agents: an industrial strength platform. In: Bordini, R.H., Dastani, M., Dix, J., El Fallah Seghrouchni, A. (eds.) Multi-Agent Programming. MSASSO, vol. 15, pp. 175\u2013193. Springer, Boston (2005). https:\/\/doi.org\/10.1007\/0-387-26350-0_7"},{"key":"15_CR7","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-71956-4","volume-title":"Programming Multi-agent Systems in AgentSpeak Using Jason","author":"RH Bordini","year":"2007","unstructured":"Bordini, R.H., H\u00fcJomi, J.F., Wooldridge, M.: Programming Multi-agent Systems in AgentSpeak Using Jason, vol. 8. Wiley, Hoboken (2007)"},{"key":"15_CR8","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/978-3-642-33323-1_2","volume-title":"Multiagent Systems and Applications","author":"A Pokahr","year":"2013","unstructured":"Pokahr, A., Braubach, L., Jander, K.: The Jadex project: programming model. In: Ganzha, M., Jain, L. (eds.) Multiagent Systems and Applications, pp. 21\u201353. Springer, Cham (2013). https:\/\/doi.org\/10.1007\/978-3-642-33323-1_2"},{"key":"15_CR9","volume-title":"An Introduction to Multiagent Systems","author":"M Wooldridge","year":"2009","unstructured":"Wooldridge, M.: An Introduction to Multiagent Systems. Wiley, Hoboken (2009)"},{"issue":"5","key":"15_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3342355","volume":"52","author":"M Luckcuck","year":"2019","unstructured":"Luckcuck, M., Farrell, M., Dennis, L.A., Dixon, C., Fisher, M.: Formal specification and verification of autonomous robotic systems: a survey. ACM Comput. Surv. (CSUR) 52(5), 1\u201341 (2019)","journal-title":"ACM Comput. Surv. (CSUR)"},{"issue":"1","key":"15_CR11","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1007\/s10515-011-0088-x","volume":"19","author":"LA Dennis","year":"2012","unstructured":"Dennis, L.A., Fisher, M., Webster, M.P., Bordini, R.H.: Model checking agent programming languages. Autom. Softw. Eng. 19(1), 5\u201363 (2012)","journal-title":"Autom. Softw. Eng."},{"key":"15_CR12","doi-asserted-by":"crossref","unstructured":"Jensen, A.B.: Machine-checked verification of cognitive agents. In: Proceedings of the 14th International Conference on Agents and Artificial Intelligence, pp. 245\u2013256 (2022)","DOI":"10.5220\/0010838700003116"},{"issue":"03","key":"15_CR13","doi-asserted-by":"publisher","first-page":"1750012","DOI":"10.1142\/S2424862217500129","volume":"2","author":"H Chen","year":"2017","unstructured":"Chen, H.: Applications of cyber-physical system: a literature review. J. Ind. Integr. Manag. 2(03), 1750012 (2017)","journal-title":"J. Ind. Integr. Manag."},{"key":"15_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"262","DOI":"10.1007\/978-3-030-92124-8_15","volume-title":"Software Engineering and Formal Methods","author":"B Archibald","year":"2021","unstructured":"Archibald, B., Calder, M., Sevegnani, M., Xu, M.: Probabilistic BDI agents: actions, plans, and intentions. In: Calinescu, R., P\u0103s\u0103reanu, C.S. (eds.) SEFM 2021. LNCS, vol. 13085, pp. 262\u2013281. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-92124-8_15"},{"key":"15_CR15","doi-asserted-by":"crossref","unstructured":"Ghallab, M., Nau, D., Traverso, P.: Automated Planning: Theory and Practice. Elsevier (2004)","DOI":"10.1016\/B978-155860856-6\/50021-1"},{"key":"15_CR16","doi-asserted-by":"crossref","unstructured":"Geffner, H., Bonet, B.: A concise Introduction to Models and Methods for Automated Planning. Synthesis Lectures on Artificial Intelligence and Machine Learning, vol. 8, no. 1, pp. 1\u2013141 (2013)","DOI":"10.2200\/S00513ED1V01Y201306AIM022"},{"issue":"2","key":"15_CR17","doi-asserted-by":"publisher","first-page":"272","DOI":"10.1016\/j.tcs.2005.11.018","volume":"354","author":"Y Abdedda\u0131","year":"2006","unstructured":"Abdedda\u0131, Y., Asarin, E., Maler, O., et al.: Scheduling with timed automata. Theor. Comput. Sci. 354(2), 272\u2013300 (2006)","journal-title":"Theor. Comput. Sci."},{"key":"15_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1007\/978-3-319-02444-8_2","volume-title":"Automated Technology for Verification and Analysis","author":"M Kwiatkowska","year":"2013","unstructured":"Kwiatkowska, M., Parker, D.: Automated verification and strategy synthesis for probabilistic systems. In: Van Hung, D., Ogawa, M. (eds.) ATVA 2013. LNCS, vol. 8172, pp. 5\u201322. Springer, Cham (2013). https:\/\/doi.org\/10.1007\/978-3-319-02444-8_2"},{"key":"15_CR19","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1007\/s10458-010-9130-9","volume":"23","author":"S Sardina","year":"2011","unstructured":"Sardina, S., Padgham, L.: A BDI agent programming language with failure handling, declarative goals, and planning. Auton. Agents Multi-Agent Syst. 23, 18\u201370 (2011)","journal-title":"Auton. Agents Multi-Agent Syst."},{"key":"15_CR20","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511626661","volume-title":"The Space and Motion of Communicating Agents","author":"R Milner","year":"2009","unstructured":"Milner, R.: The Space and Motion of Communicating Agents. Cambridge University Press, Cambridge (2009)"},{"issue":"2","key":"15_CR21","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3545180","volume":"34","author":"B Archibald","year":"2022","unstructured":"Archibald, B., Calder, M., Sevegnani, M.: Probabilistic bigraphs. Formal Aspects Comput. 34(2), 1\u201327 (2022)","journal-title":"Formal Aspects Comput."},{"key":"15_CR22","doi-asserted-by":"crossref","unstructured":"Bellman, R.: A Markovian decision process. J. Math. Mech. 679\u2013684 (1957)","DOI":"10.1512\/iumj.1957.6.56038"},{"key":"15_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"494","DOI":"10.1007\/978-3-319-41540-6_27","volume-title":"Computer Aided Verification","author":"M Sevegnani","year":"2016","unstructured":"Sevegnani, M., Calder, M.: BigraphER: rewriting and analysis engine for bigraphs. In: Chaudhuri, S., Farzan, A. (eds.) CAV 2016. LNCS, vol. 9780, pp. 494\u2013501. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-41540-6_27"},{"key":"15_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"585","DOI":"10.1007\/978-3-642-22110-1_47","volume-title":"Computer Aided Verification","author":"M Kwiatkowska","year":"2011","unstructured":"Kwiatkowska, M., Norman, G., Parker, D.: PRISM 4.0: verification of probabilistic real-time systems. In: Gopalakrishnan, G., Qadeer, S. (eds.) CAV 2011. LNCS, vol. 6806, pp. 585\u2013591. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-22110-1_47"},{"key":"15_CR25","doi-asserted-by":"crossref","unstructured":"Hensel, C., Junges, S., Katoen, J.P., Quatmann, T., Volk, M.: The probabilistic model checker storm. Int. J. Softw. Tools Technol. Transfer 1\u201322 (2021)","DOI":"10.1007\/s10009-021-00633-z"},{"key":"15_CR26","doi-asserted-by":"crossref","unstructured":"Di Pierro, A., Wiklicky, H.: An operational semantics for probabilistic concurrent constraint programming. In: The 1998 International Conference on Computer Languages, pp. 174\u2013183. IEEE (1998)","DOI":"10.1007\/BFb0055794"},{"key":"15_CR27","doi-asserted-by":"publisher","unstructured":"Xu, M.: Bigraph models of smart manufacturing and rover example in can (2022). https:\/\/doi.org\/10.5281\/zenodo.7441574","DOI":"10.5281\/zenodo.7441574"},{"issue":"5","key":"15_CR28","doi-asserted-by":"publisher","first-page":"512","DOI":"10.1007\/BF01211866","volume":"6","author":"H Hansson","year":"1994","unstructured":"Hansson, H., Jonsson, B.: A logic for reasoning about time and reliability. Formal Aspects Comput. 6(5), 512\u2013535 (1994)","journal-title":"Formal Aspects Comput."},{"key":"15_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1007\/978-3-642-33386-6_25","volume-title":"Automated Technology for Verification and Analysis","author":"V Forejt","year":"2012","unstructured":"Forejt, V., Kwiatkowska, M., Parker, D.: Pareto curves for probabilistic model checking. In: Chakraborty, S., Mukund, M. (eds.) ATVA 2012. LNCS, pp. 317\u2013332. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-33386-6_25"},{"key":"15_CR30","volume-title":"Reinforcement Learning: An Introduction","author":"RS Sutton","year":"2018","unstructured":"Sutton, R.S., Barto, A.G.: Reinforcement Learning: An Introduction. MIT Press, Cambridge (2018)"},{"key":"15_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"406","DOI":"10.1007\/978-3-031-19759-8_25","volume-title":"International Symposium on Leveraging Applications of Formal Methods","author":"A Hartmanns","year":"2022","unstructured":"Hartmanns, A., Klauck, M.: The modest state of learning, sampling, and verifying strategies. In: Margaria, T., Steffen, B. (eds.) ISoLA 2022. LNCS, vol. 13703, pp. 406\u2013432. Springer, Heidelberg (2022). https:\/\/doi.org\/10.1007\/978-3-031-19759-8_25"},{"key":"15_CR32","unstructured":"Padgham, L., Singh, D.: Situational preferences for BDI plans. In: The 2013 International Conference on Autonomous Agents and Multi-agent Systems, pp. 1013\u20131020 (2013)"},{"issue":"1","key":"15_CR33","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1017\/S0269888913000337","volume":"30","author":"F Meneguzzi","year":"2015","unstructured":"Meneguzzi, F., De Silva, L.: Planning in BDI agents: a survey of the integration of planning algorithms and agent reasoning. Knowl. Eng. Rev. 30(1), 1\u201344 (2015)","journal-title":"Knowl. Eng. Rev."},{"key":"15_CR34","doi-asserted-by":"crossref","unstructured":"De Silva, L., Meneguzzi, F.R., Logan, B.: BDI agent architectures: a survey. In: The 29th International Joint Conference on Artificial Intelligence (2020)","DOI":"10.24963\/ijcai.2020\/684"},{"key":"15_CR35","doi-asserted-by":"crossref","unstructured":"Bordini, R.H., Bazzan, A.L.C., Jannone, R.D.O., Basso, D.M., Vicari, R.M., Lesser, V.R.: AgentSpeak (XL) efficient intention selection in BDI agents via decision-theoretic task scheduling. In: The First International Joint Conference on Autonomous Agents and Multiagent Systems: Part 3, pp. 1294\u20131302 (2002)","DOI":"10.1145\/545056.545122"},{"key":"15_CR36","doi-asserted-by":"crossref","unstructured":"Xu, M., McAreavey, K., Bauters, K., Liu, W.: Intention interleaving via classical replanning. In: 2019 IEEE 31st International Conference on Tools with Artificial Intelligence, pp. 85\u201392. IEEE (2019)","DOI":"10.1109\/ICTAI.2019.00021"},{"key":"15_CR37","unstructured":"Logan, B., Thangarajah, J., Yorke-Smith, N.: Progressing intention progression: a call for a goal-plan tree contest. In: AAMAS, pp. 768\u2013772 (2017)"},{"key":"15_CR38","unstructured":"Intention progression competition. https:\/\/www.intentionprogression.org\/"},{"key":"15_CR39","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1007\/978-3-030-00461-3_23","volume-title":"Scalable Uncertainty Management","author":"M Xu","year":"2018","unstructured":"Xu, M., Bauters, K., McAreavey, K., Liu, W.: A formal approach to embedding first-principles planning in BDI agent systems. In: Ciucci, D., Pasi, G., Vantaggi, B. (eds.) SUM 2018. LNCS (LNAI), vol. 11142, pp. 333\u2013347. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-00461-3_23"}],"container-title":["Lecture Notes in Computer Science","NASA Formal Methods"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-33170-1_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,2]],"date-time":"2023-06-02T12:58:12Z","timestamp":1685710692000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-33170-1_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031331695","9783031331701"],"references-count":39,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-33170-1_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"3 June 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"NFM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"NASA Formal Methods Symposium","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Houston, TX","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 May 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 May 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"nfm2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/conf.researchr.org\/home\/nfm-2023","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":"75","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":"26","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":"3","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":"35% - 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.9","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":"6","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)"}}]}}