A formal protocol conversion method
SIGCOMM '86 Proceedings of the ACM SIGCOMM conference on Communications architectures & protocols
IBM Systems Journal
Deriving a protocol converter: a top-down method
SIGCOMM '89 Symposium proceedings on Communications architectures & protocols
A protocol conversion software toolkit
SIGCOMM '89 Symposium proceedings on Communications architectures & protocols
A systematic approach for constructing gateways
Computer Networks and ISDN Systems
A discipline for constructing multiphase communication protocols
ACM Transactions on Computer Systems (TOCS)
On the Construction of Submodule Specifications and Communication Protocols
ACM Transactions on Programming Languages and Systems (TOPLAS)
IEEE Transactions on Software Engineering
Protocol Conversion Method for Heterogeneous Systems Interconnection in Multi-Profile Environment
Proceedings of the IFIP WG6.1 Seventh International Conference on Protocol Specification, Testing and Verification VII
Protocol conversion: an algorithmic approach
Protocol conversion: an algorithmic approach
A polynomial algorithm for gateway generation from formal specifications
IEEE/ACM Transactions on Networking (TON)
Mobile Networks and Applications - Special issue: protocols for mobile environments
An efficient method for protocol conversion
ICCCN '95 Proceedings of the 4th International Conference on Computer Communications and Networks
Review: Construction of protocol converters using formal methods
Computer Communications
Review paper: Synthesis of communications protocol converters: survey and assessment
Computer Communications
Design of simplified protocol converters through protocol complementation
Computer Communications
Case study: Protocol converter validation through deductive inference: a case study
Computer Communications
| Hi-index | 0.00 |
Communicating 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=(A/sub 0/, A/sub 1/) and B=(B/sub 0/, B/sub 1/) is viewed as a black box such that H is between sender A/sub 0/ and receiver B/sub 1/. This gives a resulting protocol X=(A/sub 0/, H, B/sub 1/). 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 A/sub 1/ and B/sub 0/. 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.