Efficient computation of the bounds of continuous time imprecise Markov chains
From MaRDI portal
Publication:902823
DOI10.1016/j.amc.2014.10.092zbMath1328.60180OpenAlexW2003095404MaRDI QIDQ902823
Publication date: 4 January 2016
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2014.10.092
Numerical analysis or methods applied to Markov chains (65C40) Growth and boundedness of solutions to ordinary differential equations (34C11) Continuous-time Markov processes on discrete state spaces (60J27) Differential inequalities involving functions of a single real variable (34A40)
Related Items (10)
Random walks on graphs with interval weights and precise marginals ⋮ Markovian imprecise jump processes: extension to measurable variables, convergence theorems and algorithms ⋮ Imprecise continuous-time Markov chains ⋮ Markov chains under nonlinear expectation ⋮ Errors bounds for finite approximations of coherent lower previsions on finite probability spaces ⋮ On nonlinear expectations and Markov chains under model uncertainty ⋮ The limit behaviour of imprecise continuous-time Markov chains ⋮ Extended Laplace principle for empirical measures of a Markov chain ⋮ Bounding inferences for large-scale continuous-time Markov chains: a new approach based on lumping and imprecise Markov chains ⋮ Normal cones corresponding to credal sets of lower probabilities
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Three-valued abstraction for probabilistic systems
- Imprecise Markov chains with absorption
- Discrete time Markov chains with interval probabilities
- On the solutions to \(x'(t)=A(t)x(t)\) over all A(t), where P\(\leq A(t)\leq Q\)
- Markov set-chains
- Towards fully discretized differential inclusions
- Coefficients of ergodicity for Markov chains with uncertain parameters
- A survey of the theory of coherent lower previsions
- A classification of invariant distributions and convergence of imprecise Markov chains
- Numerical fixed grid methods for differential inclusions
- Efficient computation of time-bounded reachability probabilities in uniform continuous-time Markov decision processes
- Transition matrix and generalized matrix exponential via the Peano-Baker series
- IMPRECISE MARKOV CHAINS AND THEIR LIMIT BEHAVIOR
- Difference Methods for Differential Inclusions: A Survey
This page was built for publication: Efficient computation of the bounds of continuous time imprecise Markov chains