A transport protocol and its formal description for local networks

Author

Layuan, Li ; Chunling, Li ; Shengjun, Xue

Author_Institution

Dept. of Comput. Sci., Wuhan Transp. Univ., China

Volume

2

fYear

1997

fDate

28-31 Oct 1997

Firstpage

1616

Abstract

This paper discusses a transport protocol and its formal description techniques for local area networks. The transport layer function, the transport services and a transport protocol design in a local area network architecture model are presented. A transport protocol specification using 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

Keywords

finite automata; formal specification; formal verification; local area networks; reachability analysis; transport protocols; completeness; deadlock; finite state automata; formal description; livelock freeness; local area networks; protocol specification; protocol verification; reachability tree; termination; transport layer function; transport protocol; transport services; Automata; Bridges; Computer architecture; Computer science; High-speed networks; IP networks; Intelligent networks; Local area networks; Routing; System recovery; Transport protocols; Transportation;

fLanguage

English

Publisher

ieee

Conference_Titel

Intelligent Processing Systems, 1997. ICIPS '97. 1997 IEEE International Conference on

Conference_Location

Beijing

Print_ISBN

0-7803-4253-4

Type

conf

DOI

10.1109/ICIPS.1997.669313

Filename

669313