{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,13]],"date-time":"2026-01-13T06:24:31Z","timestamp":1768285471542,"version":"3.49.0"},"publisher-location":"Cham","reference-count":41,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030992521","type":"print"},{"value":"9783030992538","type":"electronic"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T00:00:00Z","timestamp":1648512000000},"content-version":"vor","delay-in-days":87,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>The purpose of this paper is to introduce a notion of causality in Markov decision processes based on the probability-raising principle and to analyze its algorithmic properties. The latter includes algorithms for checking cause-effect relationships and the existence of probability-raising causes for given effect scenarios. Inspired by concepts of statistical analysis, we study quality measures (recall, coverage ratio and f-score) for causes and develop algorithms for their computation. Finally, the computational complexity for finding optimal causes with respect to these measures is analyzed.<\/jats:p>","DOI":"10.1007\/978-3-030-99253-8_3","type":"book-chapter","created":{"date-parts":[[2022,3,28]],"date-time":"2022-03-28T20:02:48Z","timestamp":1648497768000},"page":"40-60","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["On probability-raising causality in Markov decision processes"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5321-9343","authenticated-orcid":false,"given":"Christel","family":"Baier","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7301-1550","authenticated-orcid":false,"given":"Florian","family":"Funke","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4829-0476","authenticated-orcid":false,"given":"Jakob","family":"Piribauer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8490-1433","authenticated-orcid":false,"given":"Robin","family":"Ziemek","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,3,29]]},"reference":[{"key":"3_CR1","doi-asserted-by":"publisher","unstructured":"\u00c1brah\u00e1m, E., Bonakdarpour, B.: HyperPCTL: A temporal logic for probabilistic hyperproperties. In: McIver, A., Horv\u00e1th, A. (eds.) 15th International Conference on Quantitative Evaluation of Systems (QEST). Lecture Notes in Computer Science, vol. 11024, pp. 20\u201335. Springer (2018), https:\/\/doi.org\/10.1007\/978-3-319-99154-2_2","DOI":"10.1007\/978-3-319-99154-2_2"},{"key":"3_CR2","unstructured":"de\u00a0Alfaro, L.: Formal Verification of Probabilistic Systems. Phd thesis, Stanford University, Stanford, USA (1997), https:\/\/wcl.cs.rpi.edu\/pilots\/library\/papers\/TAGGED\/4375-de Alfaro (1997) - Formal Verification of Probabilistic Systems.pdf"},{"key":"3_CR3","doi-asserted-by":"publisher","unstructured":"de\u00a0Alfaro, L.: Computing minimum and maximum reachability times in probabilistic systems. In: Baeten, J.C.M., Mauw, S. (eds.) 10th International Conference on Concurrency Theory (CONCUR). Lecture Notes in Computer Science, vol.\u00a01664, pp. 66\u201381. Springer (1999), https:\/\/doi.org\/10.1007\/3-540-48320-9_7","DOI":"10.1007\/3-540-48320-9_7"},{"key":"3_CR4","doi-asserted-by":"publisher","unstructured":"Baier, C., Bertrand, N., Dubslaff, C., Gburek, D., Sankur, O.: Stochastic shortest paths and weight-bounded properties in Markov decision processes. In: Dawar, A., Gr\u00e4del, E. (eds.) 33rd Annual ACM\/IEEE Symposium on Logic in Computer Science, LICS 2018, Oxford, UK, July 09-12, 2018. pp. 86\u201394. ACM (2018), https:\/\/doi.org\/10.1145\/3209108.3209184","DOI":"10.1145\/3209108.3209184"},{"key":"3_CR5","doi-asserted-by":"publisher","unstructured":"Baier, C., Dubslaff, C., Funke, F., Jantsch, S., Majumdar, R., Piribauer, J., Ziemek, R.: From verification to causality-based explications (invited talk). In: Bansal, N., Merelli, E., Worrell, J. (eds.) 48th International Colloquium on Automata, Languages, and Programming, (ICALP). LIPIcs, vol.\u00a0198, pp. 1:1\u20131:20. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2021), https:\/\/doi.org\/10.4230\/LIPIcs.ICALP.2021.1","DOI":"10.4230\/LIPIcs.ICALP.2021.1"},{"key":"3_CR6","unstructured":"Baier, C., Funke, F., Jantsch, S., Piribauer, J., Ziemek, R.: Probabilistic causes in Markov chains. CoRR abs\/2104.13604 (2021), https:\/\/arxiv.org\/abs\/2104.13604, accepted for publication at ATVA\u201921."},{"key":"3_CR7","doi-asserted-by":"publisher","unstructured":"Baier, C., Funke, F., Majumdar, R.: A game-theoretic account of responsibility allocation. In: Zhou, Z. (ed.) 30th International Joint Conference on Artificial Intelligence (IJCAI). pp. 1773\u20131779. ijcai.org (2021), https:\/\/doi.org\/10.24963\/ijcai.2021\/244","DOI":"10.24963\/ijcai.2021\/244"},{"key":"3_CR8","unstructured":"Baier, C., Funke, F., Piribauer, J., Ziemek, R.: On probability-raising causality in markov decision processes (2022), https:\/\/arxiv.org\/abs\/2201.08768"},{"key":"3_CR9","unstructured":"Baier, C., Katoen, J.P.: Principles of Model Checking (Representation and Mind Series). The MIT Press, Cambridge, MA (2008)"},{"key":"3_CR10","doi-asserted-by":"publisher","unstructured":"Baier, C., Klein, J., Kl\u00fcppelholz, S., M\u00e4rcker, S.: Computing conditional probabilities in Markovian models efficiently. In: \u00c1brah\u00e1m, E., Havelund, K. (eds.) 20th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS). Lecture Notes in Computer Science, vol.\u00a08413, pp. 515\u2013530. Springer (2014), https:\/\/doi.org\/10.1007\/978-3-642-54862-8_43","DOI":"10.1007\/978-3-642-54862-8_43"},{"key":"3_CR11","doi-asserted-by":"publisher","unstructured":"Beer, I., Ben-David, S., Chockler, H., Orni, A., Trefler, R.J.: Explaining counterexamples using causality. Formal Methods in System Design 40(1), 20\u201340 (2012), https:\/\/doi.org\/10.1007\/s10703-011-0132-2","DOI":"10.1007\/s10703-011-0132-2"},{"key":"3_CR12","doi-asserted-by":"crossref","unstructured":"Bertsekas, D.P., Tsitsiklis, J.N.: An analysis of stochastic shortest path problems. Mathemathics of Operations Research 16(3), 580\u2013595 (1991)","DOI":"10.1287\/moor.16.3.580"},{"key":"3_CR13","doi-asserted-by":"crossref","unstructured":"Canny, J.F.: Some algebraic and geometric computations in PSPACE. In: 20th Annual ACM Symposium on Theory of Computing (STOC). pp. 460\u2013467. ACM (1988)","DOI":"10.1145\/62212.62257"},{"key":"3_CR14","doi-asserted-by":"publisher","unstructured":"Chockler, H.: Causality and responsibility for formal verification and beyond. In: First Workshop on Causal Reasoning for Embedded and safety-critical Systems Technologies (CREST). EPTCS, vol.\u00a0224, pp.\u00a01\u20138 (2016), https:\/\/doi.org\/10.4204\/EPTCS.224.1","DOI":"10.4204\/EPTCS.224.1"},{"key":"3_CR15","doi-asserted-by":"crossref","unstructured":"Chockler, H., Halpern, J.Y., Kupferman, O.: What causes a system to satisfy a specification? ACM Transactions on Computational Logic 9(3), 20:1\u201320:26 (2008)","DOI":"10.1145\/1352582.1352588"},{"key":"3_CR16","unstructured":"Clarke, E.M., Grumberg, O., Peled, D.: Model Checking. MIT Press (1999)"},{"key":"3_CR17","doi-asserted-by":"publisher","unstructured":"Dimitrova, R., Finkbeiner, B., Torfah, H.: Probabilistic hyperproperties of Markov decision processes. In: Hung, D.V., Sokolsky, O. (eds.) 18th International Symposium on Automated Technology for Verification and Analysis (ATVA). Lecture Notes in Computer Science, vol. 12302, pp. 484\u2013500. Springer (2020), https:\/\/doi.org\/10.1007\/978-3-030-59152-6_27","DOI":"10.1007\/978-3-030-59152-6_27"},{"key":"3_CR18","unstructured":"Eells, E.: Probabilistic Causality. Cambridge Studies in Probability, Induction and Decision Theory, Cambridge University Press (1991)"},{"key":"3_CR19","doi-asserted-by":"publisher","unstructured":"Friedenberg, M., Halpern, J.Y.: Blameworthiness in multi-agent settings. In: 33rd Conference on Artificial Intelligence (AAAI). pp. 525\u2013532. AAAI Press (2019), https:\/\/doi.org\/10.1609\/aaai.v33i01.3301525","DOI":"10.1609\/aaai.v33i01.3301525"},{"key":"3_CR20","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman (1979)"},{"key":"3_CR21","unstructured":"Halpern, J.Y., Pearl, J.: Causes and explanations: A structural-model approach: Part 1: Causes. In: 17th Conference in Uncertainty in Artificial Intelligence (UAI). pp. 194\u2013202 (2001)"},{"key":"3_CR22","doi-asserted-by":"crossref","unstructured":"Hitchcock, C.: Probabilistic causation. In: H\u00e1jek, A., Hitchcock, C. (eds.) The Oxford Handbook of Probability and Philosophy, pp. 815\u2013832. Oxford University Press (2016)","DOI":"10.1093\/oxfordhb\/9780199607617.013.41"},{"key":"3_CR23","unstructured":"Kallenberg, L.: Lecture Notes Markov Decision Problems - version 2020 (02 2020)"},{"key":"3_CR24","unstructured":"Kleinberg, S., Mishra, B.: The temporal logic of causal structures. In: 25th Conference on Uncertainty in Artificial Intelligence (UAI). pp. 303\u2013312 (2009)"},{"key":"3_CR25","doi-asserted-by":"crossref","unstructured":"Kleinberg, S.: Causality, Probability and Time. Cambridge University Press (2012)","DOI":"10.1017\/CBO9781139207799"},{"key":"3_CR26","doi-asserted-by":"crossref","unstructured":"Kozlov, M.K., Tarasov, S.P., Khachiyan, L.G.: The polynomial solvability of convex quadratic programming. USSR Computational Mathematics and Mathematical Physics 20(5), 223\u2013228 (1980)","DOI":"10.1016\/0041-5553(80)90098-1"},{"key":"3_CR27","doi-asserted-by":"publisher","unstructured":"Kuntz, M., Leitner-Fischer, F., Leue, S.: From probabilistic counterexamples via causality to fault trees. In: Flammini, F., Bologna, S., Vittorini, V. (eds.) 30th International Conference on Computer Safety, Reliability, and Security (SAFECOMP). Lecture Notes in Computer Science, vol.\u00a06894, pp. 71\u201384. Springer (2011), https:\/\/doi.org\/10.1007\/978-3-642-24270-0_6","DOI":"10.1007\/978-3-642-24270-0_6"},{"key":"3_CR28","unstructured":"Leitner-Fischer, F.: Causality Checking of Safety-Critical Software and Systems. Ph.D. thesis, University of Konstanz, Germany (2015), http:\/\/kops.uni-konstanz.de\/handle\/123456789\/30778"},{"key":"3_CR29","doi-asserted-by":"crossref","unstructured":"Lewis, D.: Counterfactuals and comparative possibility. Journal of Philosophical Logic 2(4), 418\u2013446 (1973)","DOI":"10.1007\/BF00262950"},{"key":"3_CR30","unstructured":"Manna, Z., Pnueli, A.: The Temporal Logic of Reactive and Concurrent Systems: Safety. Springer-Verlag (1995)"},{"key":"3_CR31","unstructured":"M\u00e4rcker, S.: Model checking techniques for design and analysis of future hardware and software systems. Ph.D. thesis, TU Dresden, Germany (2020), https:\/\/d-nb.info\/1232958204"},{"key":"3_CR32","doi-asserted-by":"publisher","unstructured":"Namjoshi, K.S.: Certifying model checkers. In: 13th International Conference on Computer Aided Verification (CAV). Lecture Notes in Computer Science, vol.\u00a02102, pp. 2\u201313. Springer (2001), https:\/\/doi.org\/10.1007\/3-540-44585-4_2","DOI":"10.1007\/3-540-44585-4_2"},{"key":"3_CR33","doi-asserted-by":"crossref","unstructured":"Pardalos, P.M., Vavasis, S.A.: Quadratic programming with one negative eigenvalue is np-hard. Journal of Global optimization 1(1), 15\u201322 (1991)","DOI":"10.1007\/BF00120662"},{"key":"3_CR34","doi-asserted-by":"crossref","unstructured":"Patek, S.D., Bertsekas, D.P.: Stochastic shortest path games. SIAM Journal on Control and Optimization 37(3), 804\u2013824 (1999)","DOI":"10.1137\/S0363012996299557"},{"key":"3_CR35","unstructured":"Pearl, J.: Causality. Cambridge University Press, 2nd edn. (2009)"},{"key":"3_CR36","unstructured":"Powers, D.: Evaluation: From precision, recall and f-factor to ROC, informedness, markedness & correlation. Mach. Learn. Technol. 2 (01 2008)"},{"key":"3_CR37","doi-asserted-by":"crossref","unstructured":"Puterman, M.: Markov Decision Processes: Discrete Stochastic Dynamic Programming. John Wiley & Sons, Inc., New York, NY (1994)","DOI":"10.1002\/9780470316887"},{"key":"3_CR38","doi-asserted-by":"crossref","unstructured":"Reichenbach, H.: The Direction of Time. Dover Publications (1956)","DOI":"10.1063\/1.3059791"},{"key":"3_CR39","unstructured":"Suppes, P.: A Probabilistic Theory of Causality. Amsterdam: North-Holland Pub. Co. (1970)"},{"key":"3_CR40","doi-asserted-by":"publisher","unstructured":"Yazdanpanah, V., Dastani, M.: Distant group responsibility in multi-agent systems. In: Baldoni, M., Chopra, A.K., Son, T.C., Hirayama, K., Torroni, P. (eds.) 19th International Conference on Princiles and Practice of Multi-Agent Systems (PRIMA). Lecture Notes in Computer Science, vol.\u00a09862, pp. 261\u2013278. Springer (2016), https:\/\/doi.org\/10.1007\/978-3-319-44832-9_16","DOI":"10.1007\/978-3-319-44832-9_16"},{"key":"3_CR41","unstructured":"Yazdanpanah, V., Dastani, M., Jamroga, W., Alechina, N., Logan, B.: Strategic responsibility under imperfect information. In: Elkind, E., Veloso, M., Agmon, N., Taylor, M.E. (eds.) 18th International Conference on Autonomous Agents and MultiAgent Systems (AAMAS). pp. 592\u2013600. International Foundation for Autonomous Agents and Multiagent Systems (2019), http:\/\/dl.acm.org\/citation.cfm?id=3331745"}],"container-title":["Lecture Notes in Computer Science","Foundations of Software Science and Computation Structures"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-99253-8_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,30]],"date-time":"2023-01-30T13:51:37Z","timestamp":1675086697000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-99253-8_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783030992521","9783030992538"],"references-count":41,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-99253-8_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"29 March 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"FoSSaCS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Foundations of Software Science and Computation Structures","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Munich","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","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":"4 April 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 April 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"fossacs2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/etaps.org\/2022\/fossacs","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":"77","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":"23","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":"30% - 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":"9","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)"}}]}}