Probabilistic Causes in Markov Chains

Research output: Contribution to book/conference proceedings/anthology/reportChapter in book/anthology/reportContributedpeer-review

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 consump-tion of resources from different perspectives, and study the complexity of computing cost-minimal causes.

Details

Original languageEnglish
Title of host publicationAutomated Technology for Verification and Analysis
EditorsZhe Hou, Vijay Ganesh
PublisherSpringer, Berlin [u. a.]
Pages205–221
Number of pages17
ISBN (print)978-3-030-88884-8
Publication statusPublished - 2021
Peer-reviewedYes

Publication series

SeriesLecture Notes in Computer Science, Volume 12971
ISSN0302-9743

Conference

Title19th International Symposium on Automated Technology for Verification and Analysis
Abbreviated titleATVA 2021
Conference number19
Duration18 - 22 October 2021
Website
Degree of recognitionInternational event
Locationonline
CityGold Coast
CountryAustralia

External IDs

Scopus 85118163265
ORCID /0000-0002-5321-9343/work/142236772
ORCID /0000-0002-8490-1433/work/142246190
ORCID /0000-0003-4829-0476/work/165453937

Keywords

Library keywords