By Topic

Verification of a class of hybrid systems using mathematical programming

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Prasanth, R. ; Sci. Syst. Co., Inc., Woburn, MA, USA ; Bergstrom, S. ; Boskovic, J.D. ; Mehra, R.K.

A computational procedure for the analysis of a class of hybrid systems evolving under the influence of initial conditions and exogenous inputs is presented in this paper. The procedure consists of constructing a non-deterministic finite state automaton whose behaviors contain the behaviors of the hybrid system and specification, and solving the corresponding language emptiness problem. The underlying computations use convex/LMI techniques and graph search. Specifically, convex/LMI methods are used to outer approximate reach sets and to check if there is a transition between two states of the automaton, while depth first and similar algorithms are employed for emptiness checking. The overall verification procedure iteratively refines the approximating automaton and provides the following guarantee: if the iterations terminate, then the hybrid system satisfies the specifications. Examples are given to illustrate the procedures.

Published in:

American Control Conference, 2003. Proceedings of the 2003  (Volume:6 )

Date of Conference:

4-6 June 2003