Invariance of Conjunctions of Polynomial Equalities for Algebraic Differential Equations.

Lecture Notes in Computer Science(2014)

引用 11|浏览27
暂无评分
摘要
In this paper we seek to provide greater automation for formal deductive verification tools working with continuous and hybrid dynamical systems. We present an efficient procedure to check invariance of conjunctions of polynomial equalities under the flow of polynomial ordinary differential equations. The procedure is based on a necessary and sufficient condition that characterizes invariant conjunctions of polynomial equalities. We contrast this approach to an alternative one which combines fast and sufficient (but not necessary) conditions using differential cuts for soundly restricting the system evolution domain.
更多
查看译文
关键词
reasoning,polynomials,differential equations,set theory,efficiency,dynamics,hybrid systems,lie groups,logic,automation,verification,computations,behavior,invariance
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要