期刊文献+

模态转移系统的三值逻辑模型检验 被引量:2

Three Valued Model Checking on Modal Transition Systems
下载PDF
导出
摘要 分析了现有的模型检验技术应用于模态转移系统的三值逻辑公式的模型检验中存在的问题·提出了把模态转移系统转换成Kripke结构的算法以及三值逻辑公式转换成2个二值逻辑的算法,经过转换后可用现有的模型检验技术进行模型检验·用该算法转换后,状态数、转移数和原子命题数目与原模型呈线性关系,没有增加模型检验的复杂度· Analysis is conducted on model checking for three valued logic formulae of modal transition system using existing model checking techniques. We reduce the three valued logic model checking problem for modal transition system to the two valued model checking problem under Kripke structure. This reduction is linear in the number of states, size of transition relations, and number of atomic propositional formulae in the new formed model compared with those in the original model. It does not increase the complexity of model checking under the Kripke structures.
作者 郭建 韩俊刚
出处 《计算机辅助设计与图形学学报》 EI CSCD 北大核心 2006年第6期881-884,共4页 Journal of Computer-Aided Design & Computer Graphics
基金 国家自然科学基金(90207015)
关键词 三值逻辑 模型检验 模态转移系统 不完全Kripke结构 three valued logic model checking modal transition system partial Kripke structure
  • 相关文献

参考文献4

  • 1Gdoerfroid P,J agadeesan R.On the expressiveness of 3-valued models[C] //Proceedings of the 4th International Workshop on Verification,Model Checking and Abstract Interpretation.Heidelberg:Springer,2003:206-222
  • 2Hennessy M,Milner R.Algebraic laws for nondeterminism and concurrency[J].Journal of the ACM,1985,32(1):137-161
  • 3Huth M.Model checking modal transition systems using Kripke structure[C] //Proceedings of the 3rd International Workshop on Verification,Model Checking and Abstract Interpretation.Heidelberg:Springer,2002:302-316
  • 4Bruns G,Godefroid P.Generalized model checking:reasoning about partial state spaces[C] //Proceedings of the 11th International Conference of Concurrency Theory,University Park,2000:168-182

同被引文献13

  • 1Bruns G, Godefroid P. Model checking partial state spaces with 3 valued temporal logics [M] //I.ecturc Notes in Computer Science. Heidelberg: Springer, 1999, 1633: 274- 287.
  • 2Godefroid P, Huth M, Jagadeesan R. Abstraction based model checking using modal transition syslems [M] //Lecture Notes in Computer Science. Heidelberg: Springer, 2001, 2154:426-440.
  • 3Shoham S, Grumberg O. Multi valued model checking games [M] //Lecture Notes in Computer Science. Heidelberg: Springer, 2005, 3707:354-369.
  • 4Bauer K, Gentilini R, Schneider K. Property driven three valued model checking on hybrid automata [M] // Lecture Notes in Computer Science. Heidelberg: Springer, 2009, 5514:218-229.
  • 5Kleene S C. Introduction to metamathematics [M]. New York: ISHI Press, 1987.
  • 6Ourfinkel A, Chechik M. Proof like counter examples[M] // Lecture Notes in Computer Science. Heidelberg: Springer, 2003, 2619:160-175.
  • 7Clarke E, Jha S, Lu Y, et al. Tree-like eounterexamples in model checking [C] //Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science. Los Alamitos: IEEEComputer Society Press, 2002:19-29.
  • 8Guo J, Han J G. Symbolic model checking for three valued logic [C] //Proceedings of IEEE International Conference on Communications and Mobile Computing. Los Alarnitos: IEEE Computer Society Press, 2009, 3:401-405.
  • 9Beer I, David S B, Eisner C. Efficient Detecting of Vacuity in Temporal Model Checking[C]//Formal Methods in System Design of 18th. Manufactured in the Netherlands: Kluwer Academic Publishers, 2001: 141-163.
  • 10Kupferman O, Vardi M Y. Vacuity Tetection in Temporal Model Checking[J]. Software Tools for Technology Transfer, 2003, 4(2): 224-233.

引证文献2

二级引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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