Efficient computation of the bounds of continuous time imprecise Markov chains
DOI10.1016/J.AMC.2014.10.092zbMATH Open1328.60180OpenAlexW2003095404MaRDI QIDQ902823FDOQ902823
Authors: Damjan Škulj 
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
Recommendations
- Imprecise continuous-time Markov chains
- Computing lower and upper expected first-passage and return times in imprecise birth-death chains
- Bounding inferences for large-scale continuous-time Markov chains: a new approach based on lumping and imprecise Markov chains
- Discrete time Markov chains with interval probabilities
- IMPRECISE MARKOV CHAINS AND THEIR LIMIT BEHAVIOR
Numerical analysis or methods applied to Markov chains (65C40) Continuous-time Markov processes on discrete state spaces (60J27) Differential inequalities involving functions of a single real variable (34A40) Growth and boundedness of solutions to ordinary differential equations (34C11)
Cites Work
- Title not available (Why is that?)
- Coefficients of ergodicity for Markov chains with uncertain parameters
- Introduction to the theory of differential inclusions
- IMPRECISE MARKOV CHAINS AND THEIR LIMIT BEHAVIOR
- Title not available (Why is that?)
- Efficient computation of time-bounded reachability probabilities in uniform continuous-time Markov decision processes
- Markov set-chains
- A survey of the theory of coherent lower previsions
- Difference Methods for Differential Inclusions: A Survey
- Discrete time Markov chains with interval probabilities
- Transition matrix and generalized matrix exponential via the Peano-Baker series
- Towards fully discretized differential inclusions
- Numerical fixed grid methods for differential inclusions
- Three-valued abstraction for probabilistic systems
- Imprecise Markov chains with absorption
- On the solutions to \(x'(t)=A(t)x(t)\) over all A(t), where P\(\leq A(t)\leq Q\)
- A classification of invariant distributions and convergence of imprecise Markov chains
Cited In (14)
- Errors bounds for finite approximations of coherent lower previsions on finite probability spaces
- Markovian imprecise jump processes: extension to measurable variables, convergence theorems and algorithms
- Application of normal cones to the computation of solutions of the nonlinear Kolmogorov backward equation
- Extended Laplace principle for empirical measures of a Markov chain
- Random walks on graphs with interval weights and precise marginals
- Markov chains under nonlinear expectation
- On nonlinear expectations and Markov chains under model uncertainty
- Discrete time Markov chains with interval probabilities
- Imprecise continuous-time Markov chains
- Computing lower and upper expected first-passage and return times in imprecise birth-death chains
- 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
- The limit behaviour of imprecise continuous-time Markov chains
- Hyperaccurate bounds in discrete-state Markovian systems
This page was built for publication: Efficient computation of the bounds of continuous time imprecise Markov chains
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q902823)
