Paper Info
Title
Reachability analysis of multi-affine systems
Abstract
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.
Year
DOI
Venue
2006
10.1007/11730637_27
Transactions of The Institute of Measurement and Control
Keywords
Field
DocType
reachability analysis,continuous multi-affine system,discrete quotient,larger discrete quotient,multi-affine function,rectangular hybrid automaton,multi-affine vector field,finite set,vector field,rectangular partition
Affine transformation,Discrete mathematics,Convexity,Finite set,Iterative method,Reachability,Reachability problem,Discrete time and continuous time,Mathematics,Hybrid automaton
Conference
Volume
Issue
ISSN
31
5
0142-3312
ISBN
Citations 
PageRank 
3-540-33170-0
31
2.04
References 
Authors
21
2
Name
Order
Citations
PageRank
Marius Kloetzer147629.21
Calin Belta22197153.54