A fast protocol conversion technique using reduction of state transition graphs

A technique to improve the formal protocol conversion method suggested by K. Okumura (1986) is presented. The algorithm first constructs the reduced state transition graphs (STGs) of the protocols for which the converter is to be designed, and then follows the Okumura algorithm to produce a reduced communicating finite state machine (CFSM) model of the converter. This reduced machine is expanded to obtain the complete single CFSM converter. The reduction of STGs lowers the computational complexity of Okumura's algorithm by one or two orders of magnitude but does not disturb the desired functionality of the converter. The approach has been applied to design a converter between two example protocols.<
>