简介: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.
简介:Fuzzycontrolproblemsforsystemswithboundeduncertaindelayswerestudied.BasedonLyapunovstabilitytheoryandmatrixtheory,anonlinearstatefeedbackfuzzycontrollerwasdesignedbylinearmatrixinequalities(LMI)approach,andtheglobalexponentialstabilityoftheclosed-loopsystemwasstrictlyproved.Forafuzzycontrolsystemwithboundeduncertaindelays,undertheglobalexponentialstabilityconditionwhichisreducedtoplinearmatrixinequalities,thecontrollerguaranteesstabilityperformancesofstatevariables.Finally,thesimulationshowsthevalidityofthemethodinthispaper.
简介:Somepreliminaryresultsonstrictboundedreallemmafortime-varyingcontinuouslinearsystemsareproposed,whereuncertaintyininitialconditions,terminalcostandextremeofthecostfunctionaredealtwithexplicitly.Basedontheseresults,anewrecursiveapproachisproposedinthenecessityproofofstrictboundedreallemmaforgeneralizedlinearsystemwithfinitediscretejumps.