An ECFSM-based maximal progress protocol verification

Abstract

A number of protocol verification reduction techniques were proposed in the past. Most of these techniques are suitable for verifying communicating protocols specified in the Communicating Finite State Machine (CFSM) model. However, it is impossible to formally specify communicating protocols with predicates and variables using the CFSM model. The Extended Communicating Finite State Machine (ECFSM) model, which incorporates the mechanism for representing variables and predicates, can formally model communicating protocols with variables and predicates. To have more efficient verification for ECFSM-specified protocols, we propose an integrated ECFSM-based global state reduction technique. This new method is based on two techniques: the dead variables analysis which can reduce the number of global states, and the ECFSM-based maximal progress state exploration which can speed up the global state reachability analysis. Using our new ECFSM-based method, the maximal progress protocol verification can be directly applied to the formal description techniques (FDTs) which are based on the extended state transition model, i.e., ISO's Estelle and CCITT's SDL. >