Probabilistic timed protocol verification for the extended state transition model

Abstract

In this paper, we propose a Timed Communicating State Machine ( T C S M ) , which belongs to the extended state transition model, to formally specify protocols that incorporate timed properties as part of their spec- ifications. Based o n the T C S M model, we also propose ( I ) a timed global state reachability analysis that takes time bounds and predicates into consideration, and (2) a probabilistic timed verification scheme thatis based o n the occurrence rates of communicating entities' transitions and the occurrence probabilities of channel entities' transitions. In this way, probabilitybased partial timed verification can be achieved for extended-state-transition-specified timed protocols.