Efficient computation of the bounds of continuous time imprecise Markov chains
type: Item
instance of: scholarly article
title: Efficient computation of the bounds of continuous time imprecise Markov chains
zbMATH Open document ID: 1328.60180
author: Damjan Škulj
published in: Applied Mathematics and Computation
publication date: 2016-01-04T00:00:00Z
Mathematics Subject Classification ID: 60J27
Mathematics Subject Classification ID: 65C40
Mathematics Subject Classification ID: 34A40
Mathematics Subject Classification ID: 34C11
zbMATH DE Number: 6525892
zbMATH Keywords: uncertainty modelling
zbMATH Keywords: Markov processes
zbMATH Keywords: differential inequalities
zbMATH Keywords: discretisation
MaRDI profile type: Publication
full work available at URL: j.amc.2014.10.092
OpenAlex ID: W2003095404
cites work: Efficient computation of time-bounded reachability probabilities in uniform continuous-time Markov decision processes
cites work: Numerical fixed grid methods for differential inclusions
cites work: Imprecise Markov chains with absorption
cites work: Transition matrix and generalized matrix exponential via the Peano-Baker series
cites work: IMPRECISE MARKOV CHAINS AND THEIR LIMIT BEHAVIOR
cites work: Difference Methods for Differential Inclusions: A Survey
cites work: Towards fully discretized differential inclusions
cites work: On the solutions to \(x'(t)=A(t)x(t)\) over all A(t), where P\(\leq A(t)\leq Q\)
cites work: Markov set-chains
cites work: Three-valued abstraction for probabilistic systems
cites work: Q5569338
cites work: A survey of the theory of coherent lower previsions
cites work: Introduction to the theory of differential inclusions
cites work: Discrete time Markov chains with interval probabilities
cites work: A classification of invariant distributions and convergence of imprecise Markov chains
cites work: Coefficients of ergodicity for Markov chains with uncertain parameters
cites work: Q3999364
DOI: 10.1016/J.AMC.2014.10.092
description: scientific article; zbMATH DE number 6525892