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. © Springer-Verlag Berlin Heidelberg 2003.
CITATION STYLE
Bujorianu, M. L., & Lygeros, J. (2003). Reachability questions in piecewise deterministic Markov processes. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2623, 126–140. https://doi.org/10.1007/3-540-36580-x_12
Mendeley helps you to discover research relevant for your work.