A recursive algorithm for computing inferences in imprecise Markov chains

DOI10.1007/978-3-030-29765-7_38MaRDI QIDQ2297800zbMATH OpenOpenAlexFDO

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

Publication date 20 February 2020

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

zbMATH Keywords

upper and lower expectationsimprecise Markov chainsrecursively decomposable inferences

Mathematics Subject Classification ID

Reasoning under uncertainty in the context of artificial intelligence (68T37)

Recommendations

• Imprecise continuous-time Markov chains
• Efficient computation of the bounds of continuous time imprecise Markov chains
• Bounding inferences for large-scale continuous-time Markov chains: a new approach based on lumping and imprecise Markov chains
• IMPRECISE MARKOV CHAINS AND THEIR LIMIT BEHAVIOR
• Discrete time Markov chains with interval probabilities

Cited in

(4)

• Game-theoretic upper expectations for discrete-time finite-state uncertain processes
• A Recursive Algorithm for Computing Inferences in Imprecise Markov Chains
• Randomness is inherently imprecise
• Average behaviour in discrete-time imprecise Markov chains: a study of weak ergodicity

This page was built for publication: A recursive algorithm for computing inferences in imprecise Markov chains

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