首页 | 本学科首页   官方微博 | 高级检索  
     


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 fnot, vert, similar0?’, where not, vert, similarset membership, variant{=,>,<}. 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 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号