Note: This content is accessible to all versions of every browser. However, this browser does not seem to support current Web standards, preventing the display of our site's design details.

  

Reachability Questions in Piecewise Deterministic Markov Processes

Author(s):

M.L. Bujorianu, J. Lygeros
Conference/Journal:

Lecture Notes in Computer Science LNCS, no. 2623, pp. 126-140, Article in book: "Hybrid Systems: Computation and Control"
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.

Year:

2003
Type of Publication:

Book Chapter
Supervisor:



File Download:

Request a copy of this publication.
(Uses JavaScript)
% No recipe for automatically generating a BibTex entry for Book Chapter
Permanent link