Computational geometry: an introduction
Computational geometry: an introduction
Smooth dynamical systems which realize arithmetical and logical operations
Three decades of mathematical system theory
The algorithmic analysis of hybrid systems
Theoretical Computer Science - Special issue on hybrid systems
HSCC '98 Proceedings of the First International Workshop on Hybrid Systems: Computation and Control
Reachability Analysis via Face Lifting
HSCC '98 Proceedings of the First International Workshop on Hybrid Systems: Computation and Control
Verifying Safety Properties of Differential Equations
CAV '96 Proceedings of the 8th International Conference on Computer Aided Verification
Proving Newtonian arbiters Correct, almost surely
DCC'96 Proceedings of the 3rd international conference on Designing Correct Circuits
On the Decidability of the Reachability Problem for Planar Differential Inclusions
HSCC '01 Proceedings of the 4th International Workshop on Hybrid Systems: Computation and Control
HSCC '01 Proceedings of the 4th International Workshop on Hybrid Systems: Computation and Control
Hybrid Control of a Truck and Trailer Vehicle
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
Computing Reachable States for Nonlinear Biological Models
CMSB '09 Proceedings of the 7th International Conference on Computational Methods in Systems Biology
Computing reachable states for nonlinear biological models
Theoretical Computer Science
Hybridization domain construction using curvature estimation
Proceedings of the 14th international conference on Hybrid systems: computation and control
Efficient computation of reachable sets of linear time-invariant systems with inputs
HSCC'06 Proceedings of the 9th international conference on Hybrid Systems: computation and control
Bounds on the reachable sets of nonlinear control systems
Automatica (Journal of IFAC)
Reachability analysis of nonlinear analog circuits through iterative reachable set reduction
Proceedings of the Conference on Design, Automation and Test in Europe
| Hi-index | 0.00 |
This paper presents Coho, a reachability analysis tool for systems modeled by non-linear, ordinary differential equations. Coho represents high-dimensional objects using projections onto planes corresponding to pairs of variables. This representation is compact and allows efficient algorithms from computational geometry to be exploited while also capturing dependencies in the behaviour of related variables. Reachability is performed by integration where methods from linear programming and linear systems theory are used to bound trajectories emanating from each face of the object. This paper has two contributions: first, we describe the implementation of Coho and, second, we present analysis results obtained by using Coho on several simple models.