Approximate Reachability Computation for Polynomial Systems
- 1 January 2006
- book chapter
- conference paper
- Published by Springer Science and Business Media LLC in Lecture Notes in Computer Science
- p. 138-152
- https://doi.org/10.1007/11730637_13
Abstract
No abstract availableKeywords
This publication has 18 references indexed in Scilit:
- Reachability of Uncertain Linear Systems Using ZonotopesLecture Notes in Computer Science, 2005
- Nonlinear Systems: Approximating Reach SetsLecture Notes in Computer Science, 2004
- Safety Verification of Hybrid Systems Using Barrier CertificatesLecture Notes in Computer Science, 2004
- Abstraction and Counterexample-Guided Refinement in Model Checking of Hybrid SystemsInternational Journal of Foundations of Computer Science, 2003
- Computational techniques for the verification of hybrid systemsProceedings of the IEEE, 2003
- Series of Abstractions for Hybrid AutomataLecture Notes in Computer Science, 2002
- Approximate Reachability Analysis of Piecewise-Linear Dynamical SystemsLecture Notes in Computer Science, 2000
- Ellipsoidal Techniques for Reachability AnalysisLecture Notes in Computer Science, 2000
- Verification of Polyhedral-Invariant Hybrid Automata Using Polygonal Flow Pipe ApproximationsLecture Notes in Computer Science, 1999
- Reachability analysis via face liftingLecture Notes in Computer Science, 1998