NASA Logo

NTRS

NTRS - NASA Technical Reports Server

Back to Results
Synthesizing a protocol converter from executable protocol tracesCommunicating finite state machines (CFSM's) with FIFO (first in, first out) queues are used to model a protocol converter. A protocol conversion algorithm is developed and presented for the CSFM model of the protocols A and B. A converter H for protocols A = (A0, A1) and B = (B0, B1) is viewed as a black box such that H is between sender A0 and receiver B1. This gives a resulting protocol X = (A0, H, B1). 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 an FIFO from a composite space formed by a Cartesian cross-product of state spaces A1 and B0. The search produces finite-length traces which are combined to form a state machine H, which is examined for freedom from unspecified receptions, deadlocks, and livelocks. A protocol conversion example demonstrates the applicability of the algorithm.
Document ID
19910062480
Acquisition Source
Legacy CDMS
Document Type
Reprint (Version printed in journal)
External Source(s)
Authors
Rajagopal, Murali
(IBM Corp. Lexington, KY, United States)
Miller, Raymond E.
(NASA Goddard Space Flight Center Greenbelt; Maryland, University, College Park, United States)
Date Acquired
August 14, 2013
Publication Date
April 1, 1991
Publication Information
Publication: IEEE Transactions on Computers
Volume: 40
ISSN: 0018-9340
Subject Category
Computer Programming And Software
Accession Number
91A47103
Distribution Limits
Public
Copyright
Other

Available Downloads

There are no available downloads for this record.
No Preview Available