Bounded model checking of CTL

doi:10.1007/s11390-007-9004-z

科研成果详情

题名	Bounded model checking of CTL
作者	Tao，Zhi Hong 1; Zhou，Cong Hua 2; Chen，Zhong 1; Wang，Li Fu 1
发表日期	2007
发表期刊	Journal of Computer Science and Technology
ISSN/eISSN	1000-9000
卷号	22 期号:1 页码:39-43
摘要	Bounded Model Checking has been recently introduced as an efficient verification method for reactive systems. This technique reduces model checking of linear temporal logic to propositional satisfiability. In this paper we first present how quantified Boolean decision procedures can replace BDDs. We introduce a bounded model checking procedure for temporal logic CTL* which reduces model checking to the satisfiability of quantified Boolean formulas. Our new technique avoids the space blow up of BDDs, and extends the concept of bounded model checking. © Science Press, Beijing, China and Springer Science + Business Media, LLC, USA 2007.
关键词	Bounded model checking CTL QBF Symbolic model checking
DOI	10.1007/s11390-007-9004-z
URL	查看来源
语种	英语English
Scopus入藏号	2-s2.0-33847065015
引用统计	被引频次：4[WOS] [WOS记录] [WOS相关记录]
文献类型	期刊论文
条目标识符	https://repository.uic.edu.cn/handle/39GCC9TT/13580
专题	个人在本单位外知识产出
作者单位	1.Department of Computer Science and Technology,Peking University,Beijing 100871,China 2.Department of Mathematics,Nanjing University,Nanjing 210093,China
推荐引用方式 GB/T 7714	Tao，Zhi Hong,Zhou，Cong Hua,Chen，Zhonget al. Bounded model checking of CTL[J]. Journal of Computer Science and Technology, 2007, 22(1): 39-43.
APA	Tao，Zhi Hong, Zhou，Cong Hua, Chen，Zhong, & Wang，Li Fu. (2007). Bounded model checking of CTL. Journal of Computer Science and Technology, 22(1), 39-43.
MLA	Tao，Zhi Hong,et al."Bounded model checking of CTL". Journal of Computer Science and Technology 22.1(2007): 39-43.