Verification of Liveness Property for Communicating FSM's with Conditional Transitions Depending on State Visiting Numbers

Many communication protocols are modeled as finite state machines (FSM’s). In general, the size of states becomes large in order to treat parameter values such as sequence numbers, and the state explosion may occur. In this paper, we will propose an FSM/C model where the executability of each transition may depend on the number of times that its starting state has been visited, and propose a technique for verifying a liveness property for the model where we avoid the state explosion. For verifying the liveness property, we use an integer linear programming technique.