首页> 外国专利> TRANSFORMATION OF SIMPLE SUBSET OF PSL INTO SERE IMPLICATION FORMULAS FOR VERIFICATION WITH MODEL CHECKING AND SIMULATION ENGINES USING SEMANTIC PRESERVING REWRITE RULES

TRANSFORMATION OF SIMPLE SUBSET OF PSL INTO SERE IMPLICATION FORMULAS FOR VERIFICATION WITH MODEL CHECKING AND SIMULATION ENGINES USING SEMANTIC PRESERVING REWRITE RULES

机译:使用语义保留重写规则将PSL的简单子集转换为用于模型检验和模拟引擎验证的隐含公式

摘要

Simple-Subset PSL formulas are transformed to SERE implications (Figure 3). Verification engines are required to support the basic formula only (320). The basic formula is a form of automata in the property specification language. This is called SERE implication. The efficiency of verification is dependent on size of automata.
机译:简单子集PSL公式已转换为SERE含义(图3)。要求验证引擎仅支持基本公式(320)。基本公式是属性规范语言中的一种自动机形式。这称为SERE蕴涵。验证的效率取决于自动机的大小。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号