This paper presents a new model, which is named Timed Communicating State Machine (TCSM), for specifying protocols that incorporate timed properties as part of their specifications. The TCSM model is similar to the Extended Communicating Finite State Machine (ECFSM) model. The major extension is providing an additional mechanism, i.e., a time interval attribute, for describing the timed properties. We also propose the corresponding formal TCSM-based timed verification scheme, i.e., a new timed global state reachability analysis. In the new timed global state reachability analysis, the exploration is decided by the predicate, the time relationships, and/or the input event. Using the TCSM model and the timed verification scheme, an Estelle-based Timed Protocol Verification System (ETPVS) has been developed on SUN SPARC workstations. In this way, timed protocols can be formally specified in Estelle and can also be verified using ETPVS.

No 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.

No abstract

No abstract