多项式常微分方程代数最强后置条件和最弱前置条件的完备算法
Complete algorithms for algebraic strongest postconditions and weakest preconditions in polynomial ODEs
摘要:
多项式常微分方程(ODE)的系统通过多元多项式的向量或向量场$F$来指定。安全断言$ψ\rightarrow[F]ϕ$意味着系统的轨迹将位于状态空间的子集$ϕ$(后置条件)中,无论何时初始状态属于子集$ψ$(前置条件)。我们考虑的情况下,当$ϕ$和$ψ$是代数簇,即零集的多项式。特别地,指定后置条件的多项式可以被看作是由$ψ$隐含的系统的守恒律。检查代数安全断言的有效性是一个基本问题,例如,混合系统。我们考虑这个问题的一个广义版本,并提供了一个算法,给定用户指定的多项式集$P$和一个代数前提$ψ$,发现多项式的最大子集$P$隐含的$ψ$(相对化最强后置条件)。在对$ϕ$的某些假设下,该算法还可以用来寻找$ϕ$中包含的最大代数不变量和$ϕ$的最弱代数预条件.连续半代数系统的应用也被考虑。该算法的有效性证明了几个案例研究从文献。
英文摘要:
A system of polynomial ordinary differential equations (ODEs) is specified via a vector of multivariate polynomials, or vector field, $F$. A safety assertion $ψ\rightarrow[F]ϕ$ means that the trajectory of the system will lie in a subset $ϕ$ (the postcondition) of the state-space, whenever the initial state belongs to a subset $ψ$ (the precondition). We consider the case when $ϕ$ and $ψ$ are algebraic varieties, that is, zero sets of polynomials. In particular, polynomials specifying the postcondition can be seen as a system's conservation laws implied by $ψ$. Checking the validity of algebraic safety assertions is a fundamental problem in, for instance, hybrid systems. We consider a generalized version of this problem, and offer an algorithm that, given a user specified polynomial set $P$ and an algebraic precondition $ψ$, finds the largest subset of polynomials in $P$ implied by $ψ$ (relativized strongest postcondition). Under certain assumptions on $ϕ$, this algorithm can also be used to find the largest algebraic invariant included in $ϕ$ and the weakest algebraic precondition for $ϕ$. Applications to continuous semialgebraic systems are also considered. The effectiveness of the proposed algorithm is demonstrated on several case studies from the literature.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。