Synthesizing a protocol converter from executable protocol traces (original) (raw)

Communicating finite state machines (CFSM's) with FIFO queues are used to model a protocol converter. A protocol conversion algorithm is developed and presented for the CFSM model of the protocols A and B. A converter H for protocols A = (&. A I) and B = (BO. B1) is viewed as a black box such that H is between sender A0 and receiver B1. This gives a resulting protocol S = (Ao, H , Bl). The conversion algorithm requires a specification of the message relationships between the messages of protocols A and B. It is assumed that protocols A and B have the required progress properties. The algorithm includes a search for related messages from the two protocols in a FIFO from a composite space formed by a Cartesian cross-product of state spaces A1 and Bo. The search produces finite length traces which are combined to form a state machine H which is examined for freedom from unspecijEed receptions, deadlocks, and livelocks. A protocol conversion example demonstrates the applicability of the algorithm.