首页> 外文期刊>urnal of Symbolic Computation >Symbolic Reachability Computation for Families of Linear Vector Fields
【24h】

Symbolic Reachability Computation for Families of Linear Vector Fields

机译:线性向量场族的符号可达性计算

获取原文
获取原文并翻译 | 示例
       

摘要

The control paradigm of physical processes being supervised by digital programs has lead to the development of a theory of hybrid systems combining finite state automata with differential equations. One of the most important problems in the verification of hybrid systems is the reachability problem. Even though the computation of reachable spaces for finite state machines is well developed, computing the reachable space of a differential equation is difficult.
机译:由数字程序监督的物理过程的控制范式导致了混合系统理论的发展,该系统结合了有限状态自动机和微分方程。混合系统验证中最重要的问题之一是可达性问题。即使有限状态机的可到达空间的计算已得到很好的发展,但微分方程的可到达空间的计算仍然是困难的。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号