Abstract
This paper describes a model of a link-level communication line, and defines a set of operations meant to form the basis of data transfer protocols. Some problems concerning verification of protocols are discussed, and it is shown that all protocols using the given operations as a basis are partially correct. Conditions are given for total correctness.
Similar content being viewed by others
References
G. V. Bochmann,Logical verification and implementation of protocols, Proceedings of the Fourth Data Communications Symp. 1975.
G. V. Bochmann,Communication protocols and error recovery procedures, Proceedings of the ACM SIGCOMM/SIGPOS Interprocess Communications Workshop 1975.
G. V. Bochmann, J. Gecsei,A unified method of the specification and verification of protocols, Proc. of IFIP '77, 1977.
O.-J. Dahl, B. Myrhaug, K. Nygaard,SIMULA information, Common Base Language, Norwegian Computing Center 1970.
C. A. R. Hoare,An axiomatic basis for computer programming, CACM. 12 (1969) 576–583.
J. B. Postel,A graph model analysis of computer communications protocols, UCLA-ENG 7410, 1974.
R. E. Rushbridge, A. Langsford,Formal representation of protocols for computer networks, Report AFRE-R-7826, UKAEA, Harwell, England, 1974.
N. V. Stenning,A data transfer protocol, Computer Networks, Vol. 1, sept. 76, 99–110.
C. A. Sunshine,Survey of protocol definition and verification techniques, presented at the Symposium on Computer Network Protocols, Liege, February −78.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Krogdahl, S. Verification of a class of link-level protocols. BIT 18, 436–448 (1978). https://doi.org/10.1007/BF01932022
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01932022