• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文会议>14th International Conference on Concurrency Theory (CONCUR 2003) Sep 3-5, 2003 Marseille, France >Quantitative Verification and Control via the
【24h】

Quantitative Verification and Control via the

机译：通过定量验证和控制

获取原文
获取原文并翻译 | 示例
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

Linear-time properties and symbolic algorithms provide a widely used framework for system specification and verification. In this framework, the verification and control questions are phrased as boolean questions: a system either satisfies (or can be made to satisfy) a property, or it does not. These questions can be answered by symbolic algorithms expressed in the μ-calculus. We illustrate how the μ-calculus also provides the basis for two quantitative extensions of this approach: a probabilistic extension, where the verification and control problems are answered in terms of the probability with which the specification holds, and a discounted extension, in which events in the near future are weighted more heavily than events in the far away future.
机译：线性时间属性和符号算法为系统规范和验证提供了广泛使用的框架。在此框架中，验证和控制问题被表述为布尔型问题：系统满足（或可以满足）某个属性，或者不满足。这些问题可以通过μ演算中表达的符号算法来回答。我们将说明μ演算还如何为该方法的两个定量扩展提供基础：概率扩展，其中验证和控制问题根据规范的持有概率进行回答；折扣扩展，其中发生事件在不久的将来，比在遥远的将来发生的事件更重要。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号