Approximate Time Bounded Reachability for CTMCs and CTMDPs: A Lyapunov Approach
DOI10.1007/978-3-319-99154-2_24zbMath1514.68146arXiv1909.06112OpenAlexW2885972047MaRDI QIDQ6104820
Rupak Majumdar, Sadegh Soudjani, Unnamed Author
Publication date: 28 June 2023
Published in: Quantitative Evaluation of Systems (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1909.06112
Lyapunov and storage functions (93D30) Linear systems in control theory (93C05) Markov and semi-Markov decision processes (90C40) Logic in computer science (03B70) Specification and verification (program logics, model checking, etc.) (68Q60) Attainable sets, reachability (93B03) Applications of continuous-time Markov processes on discrete state spaces (60J28) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Metrics for labelled Markov processes
- Finite optimal control for time-bounded reachability in CTMDPs and continuous-time Markov games
- Bisimulation through probabilistic testing
- Approximate bisimulation relations for constrained linear systems
- On the Total Variation Distance of Semi-Markov Chains
- Graph Implementations for Nonsmooth Convex Programs
- Linear Matrix Inequalities in System and Control Theory
- Approximately Bisimilar Symbolic Models for Incrementally Stable Switched Systems
- Model-checking continuous-time Markov chains
This page was built for publication: Approximate Time Bounded Reachability for CTMCs and CTMDPs: A Lyapunov Approach
