Abstract

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.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.