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

模糊计算树逻辑的符号模型检测
引用本文:聂朋展,姜久雷,马占有. 模糊计算树逻辑的符号模型检测[J]. 计算机应用研究, 2021, 38(8): 2381-2385. DOI: 10.19734/j.issn.1001-3695.2020.12.0405
作者姓名:聂朋展  姜久雷  马占有
作者单位:北方民族大学计算机科学与工程学院,银川750021;常熟理工学院计算机科学与工程学院,江苏苏州215500
基金项目:国家自然科学基金资助项目(61762002,61962001);宁夏自然科学基金资助项目(2018AAC03127);北方民族大学研究生创新项目(YCX20068)
摘    要:对含有模糊不确定性信息的系统进行模型检测时,状态空间爆炸问题成为了亟待解决的主要问题.将形式化的系统模型用拟布尔公式表示,用多终端二叉决策图来对拟布尔公式进行存储.对模糊计算树逻辑的不动点语义给出了解释和证明,然后给出模糊计算树逻辑的符号化模型检测算法,最后通过一个实例验证算法的正确性.该算法可有效缓解对模糊模型检测验证时的状态空间爆炸问题,并扩展了模型检测的应用范围.

关 键 词:模糊计算树逻辑  不动点算法  多终端二叉决策图  符号模型检测
收稿时间:2020-12-02
修稿时间:2021-01-13

Symbolic model checking of fuzzy computation tree logic
Nie Pengzhan,Jiang Jiulei and Ma Zhanyou. Symbolic model checking of fuzzy computation tree logic[J]. Application Research of Computers, 2021, 38(8): 2381-2385. DOI: 10.19734/j.issn.1001-3695.2020.12.0405
Authors:Nie Pengzhan  Jiang Jiulei  Ma Zhanyou
Affiliation:College of Computer Science and Engineering,North Minzu University,Yinchuan,,
Abstract:In the process of model checking for systems with fuzzy and uncertain information, the problem of state space explosion becomes the main problem. This paper used Quasi-boolean formula to represent the formal model of the system and multi-terminal binary decision graph to store the quasi-boolean formula. The paper provided explanation and proof of the fixed point semantics of fuzzy computation tree logic and gave the symbolic model checking algorithm of fuzzy computation tree logic. Finally, this paper verified the correctness of the algorithm through an example. This algorithm can effectively alleviate the problem of state space explosion in the verification of fuzzy model checking and expands the application scope of model checking.
Keywords:fuzzy computation tree logic   fixed point algorithm   multi-terminal binary decision diagrams   symbolic model checking
本文献已被 万方数据 等数据库收录!
点击此处可从《计算机应用研究》浏览原始摘要信息
点击此处可从《计算机应用研究》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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