{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,31]],"date-time":"2025-08-31T10:12:58Z","timestamp":1756635178112,"version":"3.40.3"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030822538"},{"type":"electronic","value":"9783030822545"}],"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-82254-5_13","type":"book-chapter","created":{"date-parts":[[2021,7,19]],"date-time":"2021-07-19T22:02:32Z","timestamp":1626732152000},"page":"211-227","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Logic and Model Checking by Imprecise Probabilistic Interpreted Systems"],"prefix":"10.1007","author":[{"given":"Alberto","family":"Termine","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alessandro","family":"Antonucci","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Giuseppe","family":"Primiero","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alessandro","family":"Facchini","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,7,20]]},"reference":[{"key":"13_CR1","unstructured":"Antonucci, A., Huber, D., Zaffalon, M., Luginb\u00fchl, P., Chapman, I., Ladouceur, R.: Credo: a military decision-support system based on credal networks. In: Proceedings of the 16th Conference on Information Fusion (FUSION 2013), Istanbul, Turkey (2013)"},{"key":"13_CR2","doi-asserted-by":"publisher","unstructured":"Baier, C., Hensel, C., Hutschenreiter, L., Junges, S., Katoen, J., Klein, J.: Parametric Markov chains: PCTL complexity and fraction-free Gaussian elimination. Inf. Comput. 272, 104504 (2020). https:\/\/doi.org\/10.1016\/j.ic.2019.104504","DOI":"10.1016\/j.ic.2019.104504"},{"key":"13_CR3","volume-title":"Principles of Model Checking","author":"C Baier","year":"2008","unstructured":"Baier, C., Katoen, J.: Principles of Model Checking. MIT Press, Cambridge (2008)"},{"key":"13_CR4","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1016\/j.ijar.2020.05.001","volume":"123","author":"P Baldi","year":"2020","unstructured":"Baldi, P., Hosni, H.: Depth-bounded belief functions. Int. J. Approximate Reason. 123, 26\u201340 (2020). https:\/\/doi.org\/10.1016\/j.ijar.2020.05.001","journal-title":"Int. J. Approximate Reason."},{"key":"13_CR5","series-title":"Computational Biology","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-030-17297-8_1","volume-title":"Automated Reasoning for Systems Biology and Medicine","author":"N Bene\u0161","year":"2019","unstructured":"Bene\u0161, N., Brim, L., Pastva, S., \u0160afr\u00e1nek, D.: Model checking approach to the analysis of biological systems. In: Li\u00f2, P., Zuliani, P. (eds.) Automated Reasoning for Systems Biology and Medicine. CB, vol. 30, pp. 3\u201335. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-17297-8_1"},{"key":"13_CR6","doi-asserted-by":"publisher","unstructured":"Bentahar, J., Moulin, B., Meyer, J.C.: A new model checking approach for verifying agent communication protocols. In: Proceedings of the Canadian Conference on Electrical and Computer Engineering, CCECE 2006, Ottawa Congress Centre, Ottawa, Canada, 7\u201310 May 2006, pp. 1586\u20131590. IEEE (2006). https:\/\/doi.org\/10.1109\/CCECE.2006.277640","DOI":"10.1109\/CCECE.2006.277640"},{"key":"13_CR7","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-04558-9","volume-title":"Systems and Software Verification, Model-Checking Techniques and Tools","author":"B B\u00e9rard","year":"2001","unstructured":"B\u00e9rard, B., et al.: Systems and Software Verification, Model-Checking Techniques and Tools. Springer, Heidelberg (2001)"},{"key":"13_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1007\/978-3-642-38874-3_3","volume-title":"Formal Methods for Dynamical Systems","author":"L Brim","year":"2013","unstructured":"Brim, L., \u010ce\u0161ka, M., \u0160afr\u00e1nek, D.: Model checking of biological systems. In: Bernardo, M., de Vink, E., Di Pierro, A., Wiklicky, H. (eds.) SFM 2013. LNCS, vol. 7938, pp. 63\u2013112. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-38874-3_3"},{"issue":"4","key":"13_CR9","doi-asserted-by":"publisher","first-page":"679","DOI":"10.1007\/s11225-015-9621-4","volume":"104","author":"T Chen","year":"2016","unstructured":"Chen, T., Primiero, G., Raimondi, F., Rungta, N.: A computationally grounded, weighted doxastic logic. Stud. Logica. 104(4), 679\u2013703 (2016)","journal-title":"Stud. Logica."},{"key":"13_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1007\/978-3-540-31862-0_21","volume-title":"Theoretical Aspects of Computing - ICTAC 2004","author":"C Daws","year":"2005","unstructured":"Daws, C.: Symbolic and parametric model checking of discrete-time Markov chains. In: Liu, Z., Araki, K. (eds.) ICTAC 2004. LNCS, vol. 3407, pp. 280\u2013294. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/978-3-540-31862-0_21"},{"key":"13_CR11","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1016\/j.ijar.2016.04.009","volume":"76","author":"G De Cooman","year":"2016","unstructured":"De Cooman, G., De Bock, J., Lopatatzidis, S.: Imprecise stochastic processes in discrete time: global models, imprecise Markov chains and ergodic theorems. Int. J. Approx. Reason. 76, 18\u201346 (2016)","journal-title":"Int. J. Approx. Reason."},{"issue":"4","key":"13_CR12","doi-asserted-by":"publisher","first-page":"597","DOI":"10.1017\/S0269964809990039","volume":"23","author":"G De Cooman","year":"2009","unstructured":"De Cooman, G., Hermans, F., Quaeghebeur, E.: Imprecise Markov chains and their limit behavior. Probab. Eng. Inf. Sci. 23(4), 597\u2013635 (2009)","journal-title":"Probab. Eng. Inf. Sci."},{"key":"13_CR13","doi-asserted-by":"publisher","first-page":"192","DOI":"10.1016\/j.artint.2015.09.005","volume":"230","author":"KV Delgado","year":"2016","unstructured":"Delgado, K.V., De Barros, L.N., Dias, D.B., Sanner, S.: Real-time dynamic programming for Markov decision processes with imprecise probabilities. Artif. Intell. 230, 192\u2013223 (2016)","journal-title":"Artif. Intell."},{"issue":"5","key":"13_CR14","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":"13_CR15","doi-asserted-by":"publisher","first-page":"452","DOI":"10.1016\/j.ijar.2017.06.012","volume":"88","author":"T Krak","year":"2017","unstructured":"Krak, T., De Bock, J., Siebes, A.: Imprecise continuous-time Markov chains. Int. J. Approximate Reason. 88, 452\u2013528 (2017)","journal-title":"Int. J. Approximate Reason."},{"key":"13_CR16","unstructured":"Krak, T.E., T\u2019Joens, N., Bock, J.D.: Hitting times and probabilities for imprecise Markov chains. In: Bock, J.D., de Campos, C.P., de Cooman, G., Quaeghebeur, E., Wheeler, G.R. (eds.) International Symposium on Imprecise Probabilities: Theories and Applications, ISIPTA 2019, Thagaste, Ghent, Belgium, 3\u20136 July 2019. Proceedings of Machine Learning Research, vol. 103, pp. 265\u2013275. PMLR (2019). http:\/\/proceedings.mlr.press\/v103\/krak19a.html"},{"key":"13_CR17","doi-asserted-by":"publisher","first-page":"603","DOI":"10.1613\/jair.4355","volume":"50","author":"DD Mau\u00e1","year":"2014","unstructured":"Mau\u00e1, D.D., de Campos, C.P., Benavoli, A., Antonucci, A.: Probabilistic inference in credal networks: new complexity results. J. Artif. Intell. Res. 50, 603\u2013637 (2014)","journal-title":"J. Artif. Intell. Res."},{"key":"13_CR18","unstructured":"Parker, D., Norman, G., Kwiatkowska, M.: Prism: probabilistic symbolic model checker, 4.6 version (2020). https:\/\/www.prismmodelchecker.org"},{"key":"13_CR19","unstructured":"Revuz, D.: Markov Chains. Elsevier (2008)"},{"key":"13_CR20","volume-title":"Reinforcement Learning - An Introduction. Adaptive Computation and Machine Learning","author":"RS Sutton","year":"1998","unstructured":"Sutton, R.S., Barto, A.G.: Reinforcement Learning - An Introduction. Adaptive Computation and Machine Learning. MIT Press, Cambridge (1998)"},{"key":"13_CR21","unstructured":"Termine, A., Antonucci, A., Facchini, A., Primiero, G.: Robust model checking with imprecise Markov reward models. In: International Symposium on Imprecise Probabilities: Theories and Applications, ISIPTA 2021, Granada, Spain, 6\u20139 July 2021. Proceedings of Machine Learning Research, PMLR (2021)"},{"key":"13_CR22","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1007\/978-3-030-29765-7_38","volume-title":"Symbolic and Quantitative Approaches to Reasoning with Uncertainty","author":"N T\u2019Joens","year":"2019","unstructured":"T\u2019Joens, N., Krak, T., Bock, J.D., Cooman, G.: A recursive algorithm for computing inferences in imprecise Markov chains. In: Kern-Isberner, G., Ognjanovi\u0107, Z. (eds.) ECSQARU 2019. LNCS (LNAI), vol. 11726, pp. 455\u2013465. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-29765-7_38"},{"key":"13_CR23","unstructured":"Troffaes, M.C.M., Skulj, D.: Model checking for imprecise Markov chains. In: Cozman, F., Denoeux, T., Destercke, S., Seidenfeld, T. (eds.) Proceedings of the Eighth International Symposium on Imprecise Probability: Theories and Applications, ISIPTA 2013, Compi\u00e8gne, France, 2\u20135 July 2013, pp. 337\u2013344. Society for Imprecise Probability: Theories and Applications (SIPTA), July 2013"},{"key":"13_CR24","unstructured":"van Ditmarsch, H., van der Hoek, W., Halpern, J., Kooi, B. (eds.): Handbook of Epistemic Logic. College Publications (2015)"},{"key":"13_CR25","doi-asserted-by":"crossref","unstructured":"Walley, P.: Statistical Reasoning with Imprecise Probabilities. Chapman and Hall (1991)","DOI":"10.1007\/978-1-4899-3472-7"},{"key":"13_CR26","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1016\/j.knosys.2013.06.017","volume":"50","author":"W Wan","year":"2013","unstructured":"Wan, W., Bentahar, J., Hamza, A.B.: Model checking epistemic-probabilistic logic using probabilistic interpreted systems. Knowl. Based Syst. 50, 279\u2013295 (2013). https:\/\/doi.org\/10.1016\/j.knosys.2013.06.017","journal-title":"Knowl. Based Syst."}],"container-title":["Lecture Notes in Computer Science","Multi-Agent Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-82254-5_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,7,19]],"date-time":"2021-07-19T22:05:35Z","timestamp":1626732335000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-82254-5_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030822538","9783030822545"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-82254-5_13","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":"20 July 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"EUMAS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"European Conference on Multi-Agent Systems","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":"28 June 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 June 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"eumas2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/biu-ai.com\/EUMAS21\/","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":"51","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":"16","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":"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.2","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.05","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)"}}]}}