Journal Article10.1016/0376-5075(76)90015-5
A data transfer protocol
189
TL;DR: A protocol for use at the host-host level of computer networks is presented and assertions which reflect important characteristics of the protocol are derived and verified, for a demonstration that cyclic sequence numbers could be used in the protocol without ambiguity.
read more
About: This article is published in Computer Networks. The article was published on 01 Sep 1976. The article focuses on the topics: Internet Protocol Control Protocol & Link Control Protocol.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
On Communicating Finite-State Machines
TL;DR: A model of commumcations protocols based on finite-state machines is investigated and it is determined to what extent the problem is solvable, and one approach to solving it is described.
1.2K
Formal Methods in Communication Protocol Design
Gregor von Bochmann,C. Sunshine +1 more
TL;DR: This paper surveys the formal methods being applied to the problems of protocol specification, verification, and implementation, including state transition models, program verification, symbolic execution, and design rules.
Modular Verification of Computer Communication Protocols
Brent Hailpern,Susan S. Owicki +1 more
TL;DR: This paper discusses the application of modular program verification techniques to protocols, and uses two data transfer protocols from the literature: the alternating bit protocol and a protocol proposed by Stenning.
130
Petri Nets Theory for the Correctness of Protocols
Gérard Berthelot,Richard Terrat +1 more
TL;DR: In this paper, a model of the connection and disconnection phases is developed, and properties of correctness are demonstrated, using Petri net theory results, namely, reductions and linear invariants techniques.
114
References
•Book
An axiomatic basis for computer programming
C. A. R. Hoare
- 01 Jan 2002
TL;DR: In this article, the logical foundations of computer programming are explored by using techniques first applied in the study of geometry and later extended to other branches of mathematics, and a formal proof of a simple theorem is displayed.
3.3K
An axiomatic basis for computer programming
TL;DR: An attempt is made to explore the logical foundations of computer programming by use of techniques which were first applied in the study of geometry and have later been extended to other branches of mathematics.
Recoverability of Communication Protocols--Implications of a Theoretical Study
P. Merlin,D. Farber +1 more
TL;DR: The time-Petri net (TPN) appears to be a suitable model for the study of practical recoverable processes and several practical communication protocols are formally designed and analyzed using this new model.
973
A Protocol for Packet Network Intercommunication
Vinton G. Cerf,Robert E. Kahn +1 more
TL;DR: A protocol that supports the sharing of resources that exist in different packet switching networks is presented and provides for variation in individual network packet sizes, transmission failures, sequencing, flow control, end-to-end error checking, and the creation and destruction of logical process- to-process connections.
HOST-HOST communication protocol in the ARPA network
C. Stephen Carr,Stephen D. Crocker,Vinton G. Cerf +2 more
- 05 May 1970
TL;DR: The Advanced Research Projects Agency (ARPA) Computer Network (hereafter referred to as the "ARPA network") is one of the most ambitious computer networks attempted to date, but no one node is in control of the network.
120