摘要
Inthispaper,aqualitativemodelcheckingalgorithmforverificationofdistributedprobabilisticreal-timesystems(DPRS)ispresented.ThemodelofDPRS,calledreal-timeprobabilisticprocessmodel(RPPM),isovercontinuoustimedomain.ThepropertiesofDPRSaredescribedbyusingdeterministictimedautomata(DTA).Thekeypartinthealgorithmistomapcontinuoustimetofinitetimeintervalswithflagvariables.Comparedwiththeexistingalgorithms,thisalgorithmusesmoregeneraldelaytimeequivalenceclassesinsteadoftheunitdelaytimeequivalenceclassesrestrictedbyeventsequence,andavoidsgeneratingtheequivalenceclassesofstatesonlyduetothepassageoftime.Theresultshowsthatthisalgorithmischeaper.
出版日期
1998年06月16日(中国期刊网平台首次上网日期,不代表论文的发表时间)