电子学报2017，Vol.45Issue(11)：2641-2648,8.DOI:10.3969/j.issn.0372-2112.2017.11.010
广义可能性计算树逻辑的模型检测问题
The Model Checking Problem of Computing Tree Logic Based on Generalized Possibility Measures
摘要
Abstract
Firstly,two alternative equivalent forms of GPoCTL state formulas,"until","always",are given respectively.Secondly,it shows that the model checking problem of GPoCTL can be reduced to which of CTL,its algorithm is given through the method of cut set,and whose availability is explained with an example analysis,as a result,the time complexity of the algorithm is obtained.Finally,the properties of the GPoCTL model checking problem with fairness assumptions,which are similar to the GPoCTL,are studied by the similar method with GPoCTL.关键词
可能性理论/计算树逻辑/模型检测/时间复杂性/规约Key words
possibility theory/computation tree logic/model checking/time complexity/reduction分类
信息技术与安全科学引用本文复制引用
梁常建,李永明..广义可能性计算树逻辑的模型检测问题[J].电子学报,2017,45(11):2641-2648,8.基金项目
国家自然科学基金(No.11271237,No.11671244,No.11401363,No.11501345) （No.11271237,No.11671244,No.11401363,No.11501345）
高等学校博士学科点专项科研基金(No.20130202110001) （No.20130202110001）
