Decidability of the Reachability for a Family of Linear Vector Fields

DOI10.1007/978-3-319-24953-7_34zbMath1476.68147OpenAlexW2396103282MaRDI QIDQ3460586

Mingshuai Chen, Bican Xia, Liyun Dai, Naijun Zhan, Ting Gan

Publication date: 8 January 2016

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-319-24953-7_34

zbMATH Keywords

reachabilityreal root isolationcylindrical algebraic decomposition (CAD)polynomial-exponential functionTarski's algebra

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Specification and verification (program logics, model checking, etc.) (68Q60) Decidability of theories and sets of sentences (03B25) Attainable sets, reachability (93B03) Control/observation systems governed by functional relations other than differential equations (such as hybrid and switching systems) (93C30)

Related Items (4)

Synthesizing invariant barrier certificates via difference-of-convex programming ⋮ Generating semi-algebraic invariants for non-autonomous polynomial hybrid systems ⋮ On the decidability of reachability in continuous time linear time-invariant systems ⋮ Encoding inductive invariants as barrier certificates: synthesis via difference-of-convex programming

Uses Software

• Flow*
• dReach

This page was built for publication: Decidability of the Reachability for a Family of Linear Vector Fields