The implementation of a protocol using automata

This paper describes the use of automata as protocol implementation models. It also compares and highlights several automata that can be used as such models. Some of these models not only provides an easy alternative for protocol implementation, but can also be used to simulate the process of recognizing and validating a message transmitted through a communications line using a specified protocol. The paper explains one of these implementation models, namely the Turing Automaton, in full. To illustrate the ease of use of this implementation method, a high level language implementation in C, using the model, is given.