Improved Bounded Model Checking for the Universal Fragment of CTL

在线阅读 下载PDF 导出详情
摘要 SAT-basedboundedmodelchecking(BMC)hasbeenintroducedasacomplementarytechniquetoBDD-basedsymbolicmodelcheckinginrecentyears,andalotofsuccessfulworkhasbeendoneinthisdirection.TheapproachwasfirstintroducedbyA.Biereetal.incheckinglineartemporallogic(LTL)formulaeandthenalsoadaptedtocheckformulaeoftheuniversalfragmentofcomputationtreelogic(ACTL)byW.Penczeketal.Astheefficiencyofmodelcheckingisstillanimportantissue,wepresentanimprovedBMCapproachforACTLbasedonPenczek'smethod.Weconsidertwoaspectsoftheapproach.Oneisreductionofthenumberofvariablesandtransitionsinthek-modelbydistinguishingthetemporaloperatorEXfromtheothers.Theotherissimplificationofthetransformationofformulaebyusinguniformpathencodinginsteadofadisjunctionofallpathsneededinthek-model.Withtheseimprovements,foranACTLformula,thelengthofthefinalencodingoftheformulaintheworstcaseisreduced.TheimprovedapproachisimplementedinthetoolBMVandiscomparedwiththeoriginalonebyapplyingbothtotwowellknownexamples,mutualexclusionanddiningphilosophers.Thecomparisonshowstheadvantagesoftheimprovedapproachwithrespecttotheefficiencyofmodelchecking.
机构地区 不详
出版日期 2009年01月11日(中国期刊网平台首次上网日期,不代表论文的发表时间)
  • 相关文献