Reachability Analysis of Multi-affine Systems

We present a technique for reachability analysis of continuous multi-affine systems based on rectangular partitions. The method is iterative. At each step, finer partitions and larger discrete quotients are produced. We exploit some interesting convexity properties of multi-affine functions on rectangles to show that the construction of the discrete quotient at each step requires only the evaluation of the vector field at the set of all vertices of all rectangles in the partition and finding the roots of a finite set of scalar affine functions. The methodology promises to be easily extendable to rectangular hybrid automata with multi-affine vector fields and is expected to find important applications in analysis of biological networks and robot control.

[1]  C. Belta,et al.  Constructing decidable hybrid systems with velocity bounds , 2004, 2004 43rd IEEE Conference on Decision and Control (CDC) (IEEE Cat. No.04CH37601).

[2]  Calin Belta,et al.  Temporal Logic Analysis of Gene Networks Under Parameter Uncertainty , 2008, IEEE Transactions on Automatic Control.

[3]  Calin Belta,et al.  Controlling a Class of Nonlinear Systems on Rectangles , 2006, IEEE Transactions on Automatic Control.

[4]  A. J. Lotka.  Elements of Physical Biology. , 1925, Nature.

[5]  Rajeev Alur,et al.  Predicate abstraction for reachability analysis of hybrid systems , 2006, TECS.

[6]  Paulo Tabuada,et al.  Bisimulation relations for dynamical, control, and hybrid systems , 2005, Theor. Comput. Sci..

[7]  David Park,et al.  Concurrency and Automata on Infinite Sequences , 1981, Theoretical Computer Science.

[8]  George J. Pappas.  Bisimilar linear systems , 2003, Autom..

[9]  Rajeev Alur,et al.  A Theory of Timed Automata , 1994, Theor. Comput. Sci..

[10]  Robin Milner,et al.  Communication and concurrency , 1989, PHI Series in computer science.

[11]  Thomas Brihaye,et al.  On O-Minimal Hybrid Systems , 2004, HSCC.

[12]  Calin Belta,et al.  A Fully Automated Framework for Control of Linear Systems from Temporal Logic Specifications , 2008, IEEE Transactions on Automatic Control.

[13]  Calin Belta.  On controlling aircraft and underwater vehicles , 2004, IEEE International Conference on Robotics and Automation, 2004. Proceedings. ICRA '04. 2004.

[14]  Joseph Sifakis,et al.  An Approach to the Description and Analysis of Hybrid Systems , 1992, Hybrid Systems.

[15]  Rajeev Alur,et al.  Reachability Analysis of Hybrid Systems via Predicate Abstraction , 2002, HSCC.

[16]  Ashish Tiwari,et al.  Automated Symbolic Reachability Analysis; with Application to Delta-Notch Signaling Automata , 2003, HSCC.

[17]  Gerardo Lafferriere,et al.  A New Class of Decidable Hybrid Systems , 1999, HSCC.

[18]  Calin Belta,et al.  Model Checking Genetic Regulatory Networks with Parameter Uncertainty , 2007, HSCC.

[19]  Ashish Tiwari,et al.  Series of Abstractions for Hybrid Automata , 2002, HSCC.

[20]  George J. Pappas,et al.  Reachability computation for linear hybrid systems , 1999 .

[21]  Paulo Tabuada,et al.  Bisimulation Relations for Dynamical and Control Systems , 2003, CTCS.

[22]  A. J. Lotka,et al.  Elements of Physical Biology. , 1925, Nature.

[23]  Pravin Varaiya,et al.  Decidability of Hybrid Systems with Rectangular Differential Inclusion , 1994, CAV.

[24]  Jan H. van Schuppen,et al.  A control problem for affine dynamical systems on a full-dimensional polytope , 2004, Autom..

[25]  Calin Belta,et al.  Discrete abstractions for robot motion planning and control in polygonal environments , 2005, IEEE Transactions on Robotics.

[26]  Paulo Tabuada,et al.  Model Checking LTL over Controllable Linear Systems Is Decidable , 2003, HSCC.

[27]  V. Volterra.  Fluctuations in the Abundance of a Species considered Mathematically , 1926, Nature.

[28]  Pravin Varaiya,et al.  What's decidable about hybrid automata? , 1995, STOC '95.

[29]  Thomas A. Henzinger,et al.  Hybrid Automata: An Algorithmic Approach to the Specification and Verification of Hybrid Systems , 1992, Hybrid Systems.