Probabilistic causes in Markov chains

From MaRDI portal
Publication:2147196

DOI10.1007/978-3-030-88885-5_14zbMATH Open1497.68356arXiv2104.13604OpenAlexW3211017378MaRDI QIDQ2147196FDOQ2147196

Simon Jantsch, Jakob Piribauer, Robin Ziemek, Christel Baier, Florian Funke

Publication date: 22 June 2022

Abstract: The paper studies a probabilistic notion of causes in Markov chains that relies on the counterfactuality principle and the probability-raising property. This notion is motivated by the use of causes for monitoring purposes where the aim is to detect faulty or undesired behaviours before they actually occur. A cause is a set of finite executions of the system after which the probability of the effect exceeds a given threshold. We introduce multiple types of costs that capture the consumption of resources from different perspectives, and study the complexity of computing cost-minimal causes.


Full work available at URL: https://arxiv.org/abs/2104.13604





Cites Work


Cited In (5)

Uses Software


   Recommendations





This page was built for publication: Probabilistic causes in Markov chains

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2147196)