Theory of linear and integer programming
Theory of linear and integer programming
The algorithmic analysis of hybrid systems
Theoretical Computer Science - Special issue on hybrid systems
Reachability Analysis via Face Lifting
HSCC '98 Proceedings of the First International Workshop on Hybrid Systems: Computation and Control
Reachability Analysis Using Polygonal Projections
HSCC '99 Proceedings of the Second International Workshop on Hybrid Systems: Computation and Control
Verification of Polyhedral-Invariant Hybrid Automata Using Polygonal Flow Pipe Approximations
HSCC '99 Proceedings of the Second International Workshop on Hybrid Systems: Computation and Control
Ellipsoidal Techniques for Reachability Analysis
HSCC '00 Proceedings of the Third International Workshop on Hybrid Systems: Computation and Control
Level Set Methods for Computation in Hybrid Systems
HSCC '00 Proceedings of the Third International Workshop on Hybrid Systems: Computation and Control
Approximate Reachability Analysis of Piecewise-Linear Dynamical Systems
HSCC '00 Proceedings of the Third International Workshop on Hybrid Systems: Computation and Control
Verification of Hybrid Systems with Linear Differential Inclusions Using Ellipsoidal Approximations
HSCC '00 Proceedings of the Third 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
Counterexample-guided predicate abstraction of hybrid systems
Theoretical Computer Science - Tools and algorithms for the construction and analysis of systems (TACAS 2003)
Hybridization methods for the analysis of nonlinear systems
Acta Informatica - Hybrid Systems
Approximating Continuous Systems by Timed Automata
FMSB '08 Proceedings of the 1st international workshop on Formal Methods in Systems Biology
Parameter Synthesis in Nonlinear Dynamical Systems: Application to Systems Biology
RECOMB 2'09 Proceedings of the 13th Annual International Conference on Research in Computational Molecular Biology
Qualitative simulation of genetic regulatory networks: method and application
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
Model checking genetic regulatory networks with parameter uncertainty
HSCC'07 Proceedings of the 10th international conference on Hybrid systems: computation and control
Approximate reachability computation for polynomial systems
HSCC'06 Proceedings of the 9th 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
PHAVer: algorithmic verification of hybrid systems past hytech
HSCC'05 Proceedings of the 8th international conference on Hybrid Systems: computation and control
Reachability of uncertain linear systems using zonotopes
HSCC'05 Proceedings of the 8th international conference on Hybrid Systems: computation and control
On interleaving in timed automata
CONCUR'06 Proceedings of the 17th international conference on Concurrency Theory
Hybridization domain construction using curvature estimation
Proceedings of the 14th international conference on Hybrid systems: computation and control
SpaceEx: scalable verification of hybrid systems
CAV'11 Proceedings of the 23rd international conference on Computer aided verification
CLSE: closed-loop symbolic execution
NFM'12 Proceedings of the 4th international conference on NASA Formal Methods
Reachability analysis of polynomial systems using linear programming relaxations
ATVA'12 Proceedings of the 10th international conference on Automated Technology for Verification and Analysis
On approximative reachability analysis of biochemical dynamical systems
Transactions on Computational Systems Biology XIV
Timed Modelling of Gene Networks with Arbitrarily Precise Expression Discretization
Electronic Notes in Theoretical Computer Science (ENTCS)
Reachability analysis of nonlinear systems using conservative polynomialization and non-convex sets
Proceedings of the 16th international conference on Hybrid systems: computation and control
| Hi-index | 0.00 |
In this paper we describe reachability computation for continuous and hybrid systems and its potential contribution to the process of building and debugging biological models. We then develop a novel algorithm for computing reachable states for nonlinear systems and report experimental results obtained using a prototype implementation. We believe these results constitute a promising contribution to the analysis of complex models of biological systems.