Differential Elimination and Algebraic Invariants of Polynomial Dynamical Systems
arXiv:2301.10935 · doi:10.1016/j.tcs.2026.115925
Abstract
Invariant sets are a key ingredient for verifying safety and other properties of cyber-physical systems that mix discrete and continuous dynamics. We adapt the elimination-theoretic Rosenfeld-Gröbner algorithm to systematically obtain algebraic invariants of polynomial dynamical systems without using Gröbner bases or quantifier elimination. We identify totally real varieties as an important class for efficient invariance checking.
Final version accepted for publication in Theoretical Computer Science
References in corpus (8)
- Differential Equation Invariance Axiomatization
- A Bound for Orders in Differential Nullstellensatz
- Complete algorithms for algebraic strongest postconditions and weakest preconditions in polynomial ODEs
- Pegasus: Sound Continuous Invariant Generation
- Bounds for algorithms in differential algebra
- Characterizing Positively Invariant Sets: Inductive and Topological Methods
- New order bounds in differential elimination algorithms
- Sums of Squares: A Real Projective Story