Reachability Analysis of Polynomial Systems Using Linear Programming Relaxations
- 1 January 2012
- conference paper
- conference paper
- Published by Springer Science and Business Media LLC in Lecture Notes in Computer Science
Abstract
No abstract availableThis publication has 26 references indexed in Scilit:
- SpaceEx: Scalable Verification of Hybrid SystemsLecture Notes in Computer Science, 2011
- Accurate hybridization of nonlinear systemsPublished by Association for Computing Machinery (ACM) ,2010
- Image Computation for Polynomial Dynamical Systems Using the Bernstein ExpansionLecture Notes in Computer Science, 2009
- Computing Reachable States for Nonlinear Biological ModelsLecture Notes in Computer Science, 2009
- Analysis of lactose metabolism in E.coli using reachability analysis of hybrid systemsIET Systems Biology, 2007
- Hybridization methods for the analysis of nonlinear systemsActa Informatica, 2007
- Reachability Analysis of Large-Scale Affine Systems Using Low-Dimensional PolytopesLecture Notes in Computer Science, 2006
- Efficient Computation of Reachable Sets of Linear Time-Invariant Systems with InputsLecture Notes in Computer Science, 2006
- Approximate Reachability Computation for Polynomial SystemsLecture Notes in Computer Science, 2006
- Impulses and Physiological States in Theoretical Models of Nerve MembraneBiophysical Journal, 1961