Principles of Model Checking (Representation and Mind Series)
Principles of Model Checking (Representation and Mind Series)
Probabilistic reachability and safety for controlled discrete time stochastic hybrid systems
Automatica (Journal of IFAC)
Computable CTL* for Discrete-Time and Continuous-Space Dynamic Systems
RP '09 Proceedings of the 3rd International Workshop on Reachability Problems
The Ins and Outs of the Probabilistic Model Checker MRMC
QEST '09 Proceedings of the 2009 Sixth International Conference on the Quantitative Evaluation of Systems
On the connections between PCTL and dynamic programming
Proceedings of the 13th ACM international conference on Hybrid systems: computation and control
Reachability questions in piecewise deterministic Markov processes
HSCC'03 Proceedings of the 6th international conference on Hybrid systems: computation and control
Verification of discrete time stochastic hybrid systems: A stochastic reach-avoid decision problem
Automatica (Journal of IFAC)
Satisfaction meets expectations: computing expected values of probabilistic hybrid systems with SMT
IFM'10 Proceedings of the 8th international conference on Integrated formal methods
Safety verification for probabilistic hybrid systems
CAV'10 Proceedings of the 22nd international conference on Computer Aided Verification
Monte Carlo Optimization for Conflict Resolution in Air Traffic Control
IEEE Transactions on Intelligent Transportation Systems
Computational Methods for Verification of Stochastic Hybrid Systems
IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans
Higher-Order approximations for verification of stochastic hybrid systems
ATVA'12 Proceedings of the 10th international conference on Automated Technology for Verification and Analysis
Formula-free finite abstractions for linear temporal verification of stochastic hybrid systems
Proceedings of the 16th international conference on Hybrid systems: computation and control
Quantitative automata-based controller synthesis for non-autonomous stochastic hybrid systems
Proceedings of the 16th international conference on Hybrid systems: computation and control
Control design for specifications on stochastic hybrid systems
Proceedings of the 16th international conference on Hybrid systems: computation and control
Characterization and computation of infinite-horizon specifications over Markov processes
Theoretical Computer Science
| Hi-index | 0.00 |
This paper considers the quantitative verification of discrete-time stochastic hybrid systems (DTSHS) against linear time objectives. The central question is to determine the likelihood of all the trajectories in a DTSHS that are accepted by an automaton on finite or infinite words. This verification covers regular and ω-regular properties, and thus comprises the linear temporal logic LTL. This work shows that these quantitative verification problems can be reduced to computing reachability probabilities over the product of an automaton and the DTSHS under study. The computation of reachability probabilities can be performed in a backward-recursive manner, and quantitatively approximated by procedures over discrete-time Markov chains. A case study shows the feasibility of the approach.