Skip to main navigation Skip to search Skip to main content

A Recursive Algorithm for Computing Inferences in Imprecise Markov Chains

  • Natan T'Joens
  • , Thomas Krak
  • , Jasper De Bock
  • , Gert de Cooman

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

Abstract

We present an algorithm that can efficiently compute a broad class of inferences for discrete-time imprecise Markov chains, a generalised type of Markov chains that allows one to take into account partially specified probabilities and other types of model uncertainty. The class of inferences that we consider contains, as special cases, tight lower and upper bounds on expected hitting times, on hitting probabilities and on expectations of functions that are a sum or product of simpler ones. Our algorithm exploits the specific structure that is inherent in all these inferences: they admit a general recursive decomposition. This allows us to achieve a computational complexity that scales linearly in the number of time points on which the inference depends, instead of the exponential scaling that is typical for a naive approach.

Original languageEnglish
Title of host publicationSymbolic and Quantitative Approaches to Reasoning with Uncertainty - 15th European Conference, ECSQARU 2019, Proceedings
EditorsGabriele Kern-Isberner, Zoran Ognjanović
PublisherSpringer
Pages455-465
Number of pages11
ISBN (Print)9783030297640
DOIs
Publication statusPublished - 2019

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume11726 LNAI
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Keywords

  • Imprecise Markov chains
  • Recursively decomposable inferences
  • Upper and lower expectations

Fingerprint

Dive into the research topics of 'A Recursive Algorithm for Computing Inferences in Imprecise Markov Chains'. Together they form a unique fingerprint.

Cite this