首页> 外文会议>International conference on concurrency theory >Proof-checking protocols using bisimulations
【24h】

Proof-checking protocols using bisimulations

机译:使用Bisimulations的验证检查协议

获取原文

摘要

We report on our experience in using the Isabelle/HOL theorem proover to mechanize proofs of observation equivalence for systems with infinitely many states, and for parameterized systems. We follow the direct approach: An infinite relation containing the pair of systems to be shown equivalent is defined, and then proved to be a weak bisimulation. The weak bisimilarity proof is split into many cases, corresponding to the derivatives of the pairs in the relation. Isabelle/HOL automatically proves simple cases, and guarantees that no case is forgotten. The strengths and weaknesses of the approach are discussed.
机译:我们报告了我们在使用Isabelle / HOL定理程序的经验,以将观察等价的证明机械化,为具有无限许多状态的系统以及参数化系统。我们遵循直接方法:定义了包含该对系统的无限关系,然后被证明是一种弱的双刺激。弱的双模证据被分成许多情况,对应于关系中对的衍生物。 Isabelle / Hol自动证明简单的案例,保证没有遗忘任何情况。讨论了这种方法的优势和弱点。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号