|
Work Description:
Safety constraints are naturally formulated
as questions of reachability of certain sets
in the state space. We will investigate
probabilistic versions of such reachability
questions starting with a class of systems
known as piecewise deterministic Markov
processes (PDMP) and working our way towards
more general classes of stochastic hybrid
systems. The work will be divided into a
number of Tasks:
Task SHS1: Identify a number of safety
critical situations from the motivating
applications to power train, flight and air
traffic control, to be treated as case
studies for subsequent results. Formalize
these safety problems as reachability
questions for appropriate stochastic hybrid
systems. Develop stochastic simulation
structures for encoding and simulating these
examples.
Task SHS2: Lay the foundations for
reachability analysis of PDMP. Fundamental
problems that will be addressed here include
the development of appropriate measures on
the space of trajectories of these systems
to capture reachability questions and
conceptual algorithms for computing the
measure of reachability “events”.
Task SHS3: Establish classes of stochastic
hybrid systems amenable to computational
analysis. We envision that computational
automation of reachability algorithms should
be possible for stochastic extensions of
timed and multi rate automata common in the
hybrid systems literature. Natural
extensions of these can be found within the
class of PDMP.
Task SHS4: Extend the results for more
general classes of stochastic hybrid
systems, e.g. systems that allow diffusion
in the continuous evolution. The full
theoretical treatment of this problem is
likely to be very difficult in general. If
needed we will establish special cases
amenable to theoretical manipulation ands
resort to simulation for treating the more
general case. |