Reachability Analysis of Polynomial Systems Using Linear Programming Relaxations

DOI10.1007/978-3-642-33386-6_12zbMath1375.68077MaRDI QIDQ4649293

Antoine Girard, Mohamed Amin Ben Sassi, Thao Dang, Romain Testylier

Publication date: 21 November 2012

Published in: Automated Technology for Verification and Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-33386-6_12

Mathematics Subject Classification ID

90C26: Nonconvex programming, global optimization

90C05: Linear programming

93C55: Discrete-time control/observation systems

68Q60: Specification and verification (program logics, model checking, etc.)

Uses Software

• SpaceEx
• RAMAS