Reachability questions in piecewise deterministic Markov processes

69Citations
Citations of this article
12Readers
Mendeley users who have this article in their library.
Get full text

Abstract

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.

Cite

CITATION STYLE

APA

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

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free