Abstract
This paper discusses a transport protocol and its formal description techniques for local network. The transport layer function, the transport services and a transport protocol design in a local network architecture model are presented. A transport protocol specification using the finite state automata (FSA) is given. The correctness of the protocol is verified by using the reachability tree technique with respect to the protocol properties of completeness, deadlock and livelock freeness, termination and reachability.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Li Layuan, Computer Local Networks, Hubei Press Agency of Sci. and Tech., 1986.
Li Layuan, A routing algorithm for distributed optimal double loop computer networks,J. of Comput. Sci. and Technol.,2:2 (1987).
Li Layuan, The internet architecture model for local networks,Computer Eng., 5 (1986).
Transport protocol specification, ISO/TC 97/SC 16, Draft proposal ISO/DP 8073, June 1982.
Pitro Zafiropuloet al., Protocol Analysis and Synthesis Using a State Transition Model, Computer Networks Architectures and Protocols, Plenum Press, New York, 1982.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Li, L. Formal description and verification of a transport protocol for local networks. J. of Comput. Sci. & Technol. 5, 64–70 (1990). https://doi.org/10.1007/BF02946565
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF02946565