首页> 外文会议>International Symposium on NASA Formal Methods >Verifying Nonpolynomial Hybrid Systems by Qualitative Abstraction and Automated Theorem Proving
【24h】

Verifying Nonpolynomial Hybrid Systems by Qualitative Abstraction and Automated Theorem Proving

机译:通过定性抽象和自动定理来验证非生物混合系统

获取原文

摘要

Few methods can automatically verify nonlinear hybrid systems that are modelled by nonpolynomial functions. Qualitative abstraction is a potential alternative to numerical reachability methods for formally verifying these systems. The QUANTUM abstracter is shown to be competitive at verifying several benchmark nonpolynomial hybrid systems.
机译:很少有方法可以自动验证由非平合作函数建模的非线性混合系统。定性抽象是用于正式验证这些系统的数值可达性方法的潜在替代方法。在验证几个基准非增强混合系统时,量子摘要显示竞争性。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号