期刊文献+

基于OBDD的SMC反例生成研究 被引量:1

Counterexample generation research in symbolic model checking based on OBDD
在线阅读 下载PDF
导出
摘要 针对传统的符号模型检测反例生成算法在生成反例时会产生大量的无关变量,使得反例难以理解。提出一种改进的反例生成算法,将反例中的状态扩展为一个状态集,使用零压缩二叉决策图(Zero-Suppressed Binary Decision Diagrams,ZBDD)来存储所求出的状态集。删除了系统中的无关变量,仅保留了相关的变量,实验表明该算法能有效地减少状态的变量数,减少存储反例所需的空间。 Because the traditional symbolic model checking for counterexample generation algorithm to generate counter-examples of a large amount of unrelated variables, making the counter-example is very difficult to understand. An improved counter-example generation algorithm, the state of the anti-expansion case, a state set calculated using zero-suppressed binary decision diagrams(ZBDD)is used to store the state set. Then delete the system independent variables, retain the relevant variables. Experiments show that the algorithm can effectively reduce the number of state variables and reduce the storage space required by counterexample.
出处 《计算机工程与应用》 CSCD 2012年第10期54-58,145,共6页 Computer Engineering and Applications
关键词 有序二叉决策图 模型检测 计算树逻辑(CTL) 反例生成 Ordered Binary Decision Diagram(OBDD) model checking Computation Tree Logic(CTL) counter-example generation
  • 相关文献

参考文献7

  • 1Chen Hao,Wagner D.MOPS:an inf rast ructure for ex-amining security properties of software[C]//Proceedings of the9th ACM Conference on Computerand Communi-cations Security(CCS).Berkeley CA:University of Cali-fornia at Berkeley,2002:235-244.
  • 2何青,骆翔宇,苏开乐.基于符号化模型检测的对弈必胜策略验证[J].计算机工程与应用,2008,44(17):58-60. 被引量:1
  • 3Ravi K,Somenzi F.Minimal assignments for bounded model checking[C]//Jensen K,Podelski A.LNCS2988:Proc of the10th Conf on Tools and Algorithms for the Construction and Analysis of Systems(TACAS2004).Heidelberg:Springer-Verlag,2004:31-45.
  • 4Han T,Katoen J P.Counterexamples in probabilisticmodel checking[G]//Lecture Notes in Computer Sci-ence4424.Berlin:Springer,2007:72-86.
  • 5Damman B,Han T,Katoen J P.Regular expressions for PCTL counterexamples[C]//Proc Int’l Conf Quantitative Evaluation of Systems,2008.
  • 6Minato S.Zero-suppressed BDDS for set manipulation in combinatorial problems[C]//30th ACM/IEEE Design Automation Conference,1993.
  • 7姚全珠,魏小勇.基于OBDD的SMC中PRE■操作的改进算法[J].计算机工程,2008,34(14):69-71. 被引量:4

二级参考文献16

  • 1苏开乐,骆翔宇,吕关锋.符号化模型检测CTL[J].计算机学报,2005,28(11):1798-1806. 被引量:24
  • 2钱俊彦,古天龙,赵岭忠.基于EHA模型检验Statecharts[J].计算机工程,2006,32(3):19-21. 被引量:2
  • 3Marsland T A,Bjmsson Y.From minimax to manhattan[J].Games in t AI Research,2000 : 5-17.
  • 4Berlekamp E R,Conway J H,Guy R K.Winning ways[M].USA:Academie Press, 1982.
  • 5Bryant.Symbolic boolean manipulation with ordered binary-decision diagrams[J].ACM Computing Surveys, 1992,24( 3 ) : 293-318.
  • 6Edelkamp S.Symbolic exploration in two-player games:Preliminary results[C]//AIPS,Workshop on Model Checking,2002:40-48.
  • 7Hurd J. Formal verification of chess endgame databases[C]//Theorem Proving in Higher Order Logics:Emerging Trends Proceedings, 2005 : 85-100.
  • 8Baldamus M,Schneider K,Wenz M,et al.Can American checkers be solved by means of symbolic model checking? [J].Theoretical Computer Science,2001,5(43):89-101.
  • 9Backhouse R,Michaelis D.Fixed-point characterisation of winning strategies in impartial Games[C]//LNCS 3051,2004:34-47.
  • 10Clarke E M, Grumberg J O, Peled D A. Model Checking[M]. Massachusetts, USA: MIT Press, 1999.

共引文献3

同被引文献9

  • 1Martin Lange. Model checking for hybrid logic [J]. Journal of Logic, Language and Information, 2009, 18 (4): 465-491.
  • 2Dirk Beyer, Andreas Stahlbauer. BDD-based software model checking with CPACHECKER[C] // Proc of IEEE Conference on Mathematical and Engineering Methods in Computer Science, 2013: 1-11.
  • 3Stephen F Siegel. Transparent partial order reduction [J]. Formal Methods in System Design, 2012, 40 (1): 1-19.
  • 4Christel Baier, Joost-Pieter Katoen. Principles of model checking [M]. Cambridge: The Mit Press, 2008.
  • 5Dimitra Giannakopoulou, Corina S Pasareanu. Interface generation and compositional verification in javapathfinder [C] //Proc of IEEE Conference on Fundamental Approaches to Software Engineering, 2009: 94-108.
  • 6Pavel Parizek, Tomas Kalibera. Platform-specific restrictions on concurrency in model checking of Java programs [C] //Proc of IEEE Conference on Formal Methods for Industrial Critical Systems, 2009: 117-132.
  • 7Cyrille Artho, Watcharin Leungwattanakit, Masami Hagiya, et al. Efficient model checking of networked applications [C] //Proc of IEEE Conference on Objects, Components, Models and Patterns, 2008: 22-40.
  • 8吴立军,苏金树,苏开乐.多智能体系统时态认知规范高效符号模型检测的算法研究[J].计算机学报,2008,31(2):245-252. 被引量:2
  • 9马亚南,刘楠,陈晶宁,祝跃飞.基于偏序归约的状态空间约简算法[J].计算机应用与软件,2012,29(2):80-82. 被引量:3

引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部