Theoretical Computer Science
What's decidable about hybrid automata?
Journal of Computer and System Sciences
Communication and Concurrency
A New Class of Decidable Hybrid Systems
HSCC '99 Proceedings of the Second International Workshop on Hybrid Systems: Computation and Control
Series of Abstractions for Hybrid Automata
HSCC '02 Proceedings of the 5th International Workshop on Hybrid Systems: Computation and Control
Reachability Analysis of Hybrid Systems via Predicate Abstraction
HSCC '02 Proceedings of the 5th International Workshop on Hybrid Systems: Computation and Control
Decidability of Hybrid Systems with Rectangular Differential Inclusion
CAV '94 Proceedings of the 6th International Conference on Computer Aided Verification
Bisimulation relations for dynamical, control, and hybrid systems
Theoretical Computer Science
Automated symbolic reachability analysis: with application to delta-notch signaling automata
HSCC'03 Proceedings of the 6th international conference on Hybrid systems: computation and control
Model checking LTL over controllable linear systems is decidable
HSCC'03 Proceedings of the 6th international conference on Hybrid systems: computation and control
Discrete abstractions for robot motion planning and control in polygonal environments
IEEE Transactions on Robotics
Automatica (Journal of IFAC)
A control problem for affine dynamical systems on a full-dimensional polytope
Automatica (Journal of IFAC)
Qualitative Stability Patterns for Lotka-Volterra Systems on Rectangles
HSCC '08 Proceedings of the 11th international workshop on Hybrid Systems: Computation and Control
Relaxing Goodness Is Still Good
Proceedings of the 5th international colloquium on Theoretical Aspects of Computing
International Journal of Robotics Research
Accurate hybridization of nonlinear systems
Proceedings of the 13th ACM international conference on Hybrid systems: computation and control
Model checking genetic regulatory networks with parameter uncertainty
HSCC'07 Proceedings of the 10th international conference on Hybrid systems: computation and control
MARCO: a reachability algorithm for multi-affine systems with applications to biological systems
HSCC'07 Proceedings of the 10th international conference on Hybrid systems: computation and control
Comparing forward and backward reachability as tools for safety analysis
HSCC'07 Proceedings of the 10th international conference on Hybrid systems: computation and control
Approximate simulation relations and finite abstractions of quantized control systems
HSCC'07 Proceedings of the 10th international conference on Hybrid systems: computation and control
Language-based abstraction refinement for hybrid system verification
VMCAI'07 Proceedings of the 8th international conference on Verification, model checking, and abstract interpretation
Hybridization domain construction using curvature estimation
Proceedings of the 14th international conference on Hybrid systems: computation and control
Reachability analysis of polynomial systems using linear programming relaxations
ATVA'12 Proceedings of the 10th international conference on Automated Technology for Verification and Analysis
Reachability analysis of nonlinear systems using conservative polynomialization and non-convex sets
Proceedings of the 16th international conference on Hybrid systems: computation and control
One-shot computation of reachable sets for differential games
Proceedings of the 16th international conference on Hybrid systems: computation and control
| Hi-index | 0.00 |
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.