By Topic

A fast protocol conversion technique using reduction of state transition graphs

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Saha, D. ; Dept. of Comput. Sci. & Eng., Jadavpur Univ., Calcutta, India ; Dhar, P.

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

Published in:

Computers and Communications, 1992. Conference Proceedings., Eleventh Annual International Phoenix Conference on

Date of Conference:

1-3 April 1992