Reachability Questions in Piecewise Deterministic Markov Processes
- Cite this paper as:
- Bujorianu M.L., Lygeros J. (2003) Reachability Questions in Piecewise Deterministic Markov Processes. In: Maler O., Pnueli A. (eds) Hybrid Systems: Computation and Control. HSCC 2003. Lecture Notes in Computer Science, vol 2623. Springer, Berlin, Heidelberg
We formulate a stochastic hybrid system model that allows us to capture a class of Markov processes known as piecewise deterministic Markov processes (PDMPs). For this class of stochastic processes we formulate a probabilistic reachability problem. Basic properties of PDMPs are reviewed and used to show that the reachability question is indeed well defined. Possible methods for computing the reach probability are then concerned.
KeywordsHybrid systems reachability Markov processes hitting times
Unable to display preview. Download preview PDF.