首页 | 本学科首页   官方微博 | 高级检索  
     

基于模拟关系的精化检测方法
引用本文:王婷,陈铁明,刘杨.基于模拟关系的精化检测方法[J].软件学报,2016,27(3):580-592.
作者姓名:王婷  陈铁明  刘杨
作者单位:浙江工业大学 计算机科学与技术学院, 杭州 310023,浙江工业大学 计算机科学与技术学院, 杭州 310023,南洋理工大学 计算机学院, 新加坡 639798
基金项目:国家自然科学基金(61103044)
摘    要:精化检测是一种重要的形式化验证方法,将系统实现和性质规约用相同形式化语言进行建模,如能证明两者间存在某种精化关系且该关系能够维持性质,可得出系统实现满足性质规约.为验证不同类型的系统性质, traces、stable failures和failures-divergence精化检测方法已被提出.精化检测算法依赖于子集构造,因而其面临状态空间爆炸问题.近年来,已有学者针对NFA语言包含问题提出了基于模拟关系的状态空间消减方法,大大提高了算法性能,且该方法能直接用于traces精化检测.在此基础上,本文提出了基于模拟关系的stable failures和failures-divergence精化检测方法.此外,本文还将精化检测扩展到了时间系统的验证中,提出了基于模拟关系的时间自动机traces精化检测方法.实验结果表明,基于模拟关系的算法效率有很大提高.

关 键 词:精化检测  模拟  failures  divergence  时间自动机
收稿时间:2015/7/15 0:00:00
修稿时间:2015/10/20 0:00:00

Refinement Checking Based on Simulation Relations
WANG Ting,CHEN Tie-Ming and LIU Yang.Refinement Checking Based on Simulation Relations[J].Journal of Software,2016,27(3):580-592.
Authors:WANG Ting  CHEN Tie-Ming and LIU Yang
Affiliation:College of Computer Science and Technology, Zhejiang University of Technology, Hangzhou 310023, China,College of Computer Science and Technology, Zhejiang University of Technology, Hangzhou 310023, China and School of Computer Engineering, Nanyang Technological University, Singapore 639798, Singapore
Abstract:Refinement checking is an important method in formal verification, which shows a refinement relationship between an implementation model and a specification model in the same language. If the specification satisfies certain property and the refinement relationship is strong enough to preserve the property, then implementation satisfies the property. In order to verify different kinds of properties, traces, stables failures and failures/divergence refinement checking have been proposed. Refinement checking often relies on the subset construction, and suffers from state space explosion. Recently, some researchers proposed a simulation based approach for solving the language inclusion problem of NFA, which outperforms the previous ones significantly, and can be directly used in traces refinement checking. On this basis, this work further proposes stable failures and failures-divergence refinement checking algorithms based on simulation relations. On the other hand, this work also extends the idea of trace refinement checking to timed systems, and proposes timed automata traces refinement checking based on simulation relations. Experimental results show the efficiency of our approaches.
Keywords:refinement checking  simulation  failures  divergence  timed automata
点击此处可从《软件学报》浏览原始摘要信息
点击此处可从《软件学报》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号