Under-approximating backward reachable sets by polytopes

DOI10.1007/978-3-319-41528-4_25MaRDI QIDQ4633547zbMATH OpenOpenAlexFDO

Authors Bai Xue, Zhikun She, Arvind Easwaran

Publication date 3 May 2019

Published in Computer Aided Verification (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-41528-4_25

zbMATH Keywords

backward reachable setsnonlinear systemspolytopic under-approximations

Mathematics Subject Classification ID

Computational aspects related to convexity (52B55) Specification and verification (program logics, model checking, etc.) (68Q60) Attainable sets, reachability (93B03)

Recommendations

• Under-approximating reach sets for polynomial continuous systems
• Forward inner-approximated reachability of non-linear continuous systems
• Convergent under-approximations of reachable sets and tubes: a piecewise constant approach
• Reachability analysis of polynomial systems using linear programming relaxations
• Reachability analysis of nonlinear systems using conservative polynomialization and non-convex sets

Cited in

(6)

• Convergent under-approximations of reachable sets and tubes: a piecewise constant approach
• Under-approximating reach sets for polynomial continuous systems
• Inferring sufficient conditions with backward polyhedral under-approximations
• UTOPIC: Under-Approximation Through Optimal Control
• Inner and outer approximations of arbitrarily quantified reachability problems
• Inner and outer approximate quantifier elimination for general reachability problems

This page was built for publication: Under-approximating backward reachable sets by polytopes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4633547)