简介:SupposethatCisafinitecollectionofpatterns.ObserveaMarkovchainuntiloneofthepatternsinCoccursasarun.Thistimeisdenotedbyτ.Inthispaper,weaimtogiveaneasywaytocalculatethemeanwaitingtimeE(τ)andthestoppingprobabilitiesP(τ=τA)withA∈C,whereτAisthewaitingtimeuntilthepatternAappearsasarun.
简介:Inthispaperexhaustive-servicepriority-M/G/1queueingsystemswithmultiplevacations,singlevacationandsetuptimesarestudiedunderthenonpreemptiveandpreemptiveresumeprioritydisciplines.Foreachofthesixmodelsanalysed,theLapLace-StieltjestransformofthevirtualwaitingtimeWκ(t)attimetofclasskisderivedbythemethodofcollectivemarks.AsufficientconditionforWκ(t)/√ακdd↑→|U|,whereUhasthestandardnormaldistribution,isalsogiven.