Interactions Between PVS and Maple in Symbolic Analysis of Control Systems |
| |
Authors: | Ruth Hardy |
| |
Affiliation: | School of Computer Science, University of St Andrews, St Andrews, Scotland |
| |
Abstract: | This paper presents a decision procedure for problems relating polynomial and transcendental functions. The procedure applies to functions that are continuously differentiable with a finite number of points of inflection in a closed convex set. It decides questions of the form ‘is f 0?’, where ![not, vert, similar not, vert, similar](http://www.sciencedirect.com/scidirimg/entities/223c.gif) {=,>,<}. An implementation of the procedure in Maple and PVS exploits the existing Maple, PVS and QEPCAD connections. It is at present limited to those twice differentiable functions whose derivatives are rational functions (rationally differentiable). This procedure is particularly applicable to the analysis of control systems in determining important properties such as stability. |
| |
Keywords: | reliable mathematics formal methods quantifier elimination control systems Maple-PVS QEPCAD |
本文献已被 ScienceDirect 等数据库收录! |
|