By Topic

An algorithm for reachability computations on hybrid automata models of protein signaling networks

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
$33 $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

2 Author(s)
R. Ghosh ; Dept. of Aeronaut. & Astronaut., Stanford Univ., CA, USA ; C. Tomlin

Hybrid automata theory is an ideal mathematical framework for modeling biological protein signaling mechanisms. Reachability analysis of these models is essential, because the set of points backward reachable from a biologically feasible equilibrium contains all initial protein concentrations from which that steady state can be attained. This is useful for determining experimentally verifiable properties of the system under study. This paper proposes an algorithm for computing discrete abstractions of a class of hybrid automata with piecewise affine continuous dynamics, defined completely in terms of symbolic variables and parameters. These discrete abstractions are utilized to compute symbolic parametric backward reachable sets from the equilibria of the hybrid automata. The algorithm has been implemented and used to compute reachable sets for the biologically observed equilibria of multiple cell Delta-Notch protein signaling networks.

Published in:

Decision and Control, 2004. CDC. 43rd IEEE Conference on  (Volume:2 )

Date of Conference:

17-17 Dec. 2004