State constrained reachability for stochastic hybrid systems

Abstract

The stochastic hybrid systems constitute well established classes of realistic models of hybrid discrete/continuous dynamics subject to random perturbations, autonomous uncontrollable transitions, nondeterminism or uncertainty. Stochastic reachability analysis is a key factor in the verification and deployment of stochastic hybrid systems. The encouraging recent progress prompts us to refine the problem to cover more realistic situations. We extend the so called constrained reachability problem from the probabilistic discrete case to stochastic hybrid systems. Then we define mathematically this problem, and we obtain the reach probabilities as solutions of a boundary value problem. The last problem is well studied and numerical, even symbolic solutions exist. This characterization is useful in stochastic control, in probabilistic path planning and for nano-systems.

Behavioral modeling and automated verification of a Cloud-based framework to share the knowledge and skills of human resources

“…Reachability analysis is at the heart of any verification process. The standard form of reachability analysis asks to compute/ approximate the probability of all system paths that start from a given initial state and visit a target state set [17]. Fairness prevents infinite behaviors that are considered unrealistic and are often necessary to establish liveness properties [18].…”