On the verification of time-dependent protocols using timed reachability analysis

An automated approach to verifying general properties of time-dependent protocols, using a formal model called time transmission grammar plus (TTG/sup +/), is introduced. The novel part of the approach is to represent the global state of the model as a pair of state and timing constraint matrices. Timed reachability analysis based on such a representation is then developed to verify various protocol properties. A simple multidestination stop-and-wait protocol is used to illustrate the model and the reachability algorithm.<
>