Protocol conversion—correctness problems
SIGCOMM '86 Proceedings of the ACM SIGCOMM conference on Communications architectures & protocols
A formal protocol conversion method
SIGCOMM '86 Proceedings of the ACM SIGCOMM conference on Communications architectures & protocols
An exercise in deriving a protocol conversion
SIGCOMM '87 Proceedings of the ACM workshop on Frontiers in computer communications technology
Deriving a protocol converter: a top-down method
SIGCOMM '89 Symposium proceedings on Communications architectures & protocols
An approach to protocol complementation for internetworking
ISCI '90 Proceedings of the first international conference on systems integration on Systems integration '90
A simple scheme for slot reuse without latency for a dual bus configuration
IEEE/ACM Transactions on Networking (TON)
Synchronizing transition set approach to protocol conversion
Synchronizing transition set approach to protocol conversion
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
IEEE Transactions on Software Engineering
Formal methods for protocol conversion
IEEE Journal on Selected Areas in Communications
| Hi-index | 0.24 |
During the past four years, the authors have developed the Synchronizing Transition Set (STS) approach to solve protocol conversion problems for interconnecting heterogeneous computer networks. The STS approach is a 5-step formal algorithm: given service specifications of target protocols as its input, it derives a protocol converter specification as output. Several variations of the STS algorithm have been studied, and it was formally proven that all of these variations support the same correctness properties [1-4], such as conformity, liveness and transparency properties. Recently, the STS algorithm has been fully implemented in an STS protocol converter generation package. The package is written in the C language under a standard UNIX operating system. It needs less than 1000 lines of C statements to fully implement the STS algorithm. Moreover, to generate a converter between some classical example protocols, such as ABP (alternating bit protocol) and go-back-n protocols, it only takes a few seconds to derive a correct protocol converter specification using a desktop workstation. In this paper, the STS algorithm and its implementation are presented.