首页> 外文会议>Computational methods in transport: Verification and validation >Some Verification Problems with Possible Transport Applications
【24h】

Some Verification Problems with Possible Transport Applications

机译:可能的运输应用中的一些验证问题

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

摘要

While the body of verification problems in the literature is growing, it is still far smaller than the authors would like [KS03]. And while the problems presented here are not terribly complicated, nor are they trivial. Also they are exact, easy to compute, and easy to implement. And from simple to sophisticated there is a role to play for all verification problems. Should a code fail on the more complicated verification solutions the simpler ones may provide a way of isolating what is causing the problem. And with every exact solution a computer code computes our confidence in the unverifiable solutions grows. The verification solutions presented above have proven useful to the authors and we hope others will find them so as well.
机译:尽管文献中的验证问题越来越多,但仍然远远少于作者希望的[KS03]。尽管这里提出的问题不是十分复杂,也不是琐碎的。而且它们是精确的,易于计算且易于实现的。从简单到复杂,所有验证问题都可以发挥作用。如果代码在较复杂的验证解决方案上失败,则较简单的验证解决方案可以提供一种隔离导致问题的原因的方法。有了每一个精确的解决方案,计算机代码便可以计算出我们对无法验证的解决方案的信心。上面介绍的验证解决方案已证明对作者有用,我们希望其他人也能找到它们。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号