Recoverability of Communication Protocols—Implications of a Theoretical Study

Philip M. Merlin, David Farber

Research output: Contribution to journalArticle

569 Citations (Scopus)

Abstract

A study is presented which permits the formal analysis and synthesis of recoverable computer communication protocols. This study is based on a formal representation of processes by a model of computation, the Petri nets (PN‘s). The PN model is generalized to include a representation of the possible failures, and then, the concept of “recoverability” is formally defined. A set of necessary and sufficient conditions which a process must satisfy in order to be recoverable is derived. In the PN model, the processes that satisfy these conditions are shown to have some practical limitations. A new model, the time-Petri net (TPN), is introduced to remove these limitations. This new model allows the introduction of constraints in the execution times of its part. As shown in this paper, the TPN appears to be a suitable model for the study of practical recoverable processes. Several practical communication protocols are formally designed and analyzed using this new model, and some interesting properties of these protocols are formally derived.

Original languageEnglish
Pages (from-to)1036-1043
Number of pages8
JournalIEEE Transactions on Communications
Volume24
Issue number9
DOIs
Publication statusPublished - 1976 Jan 1
Externally publishedYes

Fingerprint

Petri nets
Communication
Network protocols

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Computer Networks and Communications

Cite this

Recoverability of Communication Protocols—Implications of a Theoretical Study. / Merlin, Philip M.; Farber, David.

In: IEEE Transactions on Communications, Vol. 24, No. 9, 01.01.1976, p. 1036-1043.

Research output: Contribution to journalArticle

@article{70da9577c35c477a84dfc350d7d6436a,
title = "Recoverability of Communication Protocols—Implications of a Theoretical Study",
abstract = "A study is presented which permits the formal analysis and synthesis of recoverable computer communication protocols. This study is based on a formal representation of processes by a model of computation, the Petri nets (PN‘s). The PN model is generalized to include a representation of the possible failures, and then, the concept of “recoverability” is formally defined. A set of necessary and sufficient conditions which a process must satisfy in order to be recoverable is derived. In the PN model, the processes that satisfy these conditions are shown to have some practical limitations. A new model, the time-Petri net (TPN), is introduced to remove these limitations. This new model allows the introduction of constraints in the execution times of its part. As shown in this paper, the TPN appears to be a suitable model for the study of practical recoverable processes. Several practical communication protocols are formally designed and analyzed using this new model, and some interesting properties of these protocols are formally derived.",
author = "Merlin, {Philip M.} and David Farber",
year = "1976",
month = "1",
day = "1",
doi = "10.1109/TCOM.1976.1093424",
language = "English",
volume = "24",
pages = "1036--1043",
journal = "IEEE Transactions on Communications",
issn = "0096-1965",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "9",

}

TY - JOUR

T1 - Recoverability of Communication Protocols—Implications of a Theoretical Study

AU - Merlin, Philip M.

AU - Farber, David

PY - 1976/1/1

Y1 - 1976/1/1

N2 - A study is presented which permits the formal analysis and synthesis of recoverable computer communication protocols. This study is based on a formal representation of processes by a model of computation, the Petri nets (PN‘s). The PN model is generalized to include a representation of the possible failures, and then, the concept of “recoverability” is formally defined. A set of necessary and sufficient conditions which a process must satisfy in order to be recoverable is derived. In the PN model, the processes that satisfy these conditions are shown to have some practical limitations. A new model, the time-Petri net (TPN), is introduced to remove these limitations. This new model allows the introduction of constraints in the execution times of its part. As shown in this paper, the TPN appears to be a suitable model for the study of practical recoverable processes. Several practical communication protocols are formally designed and analyzed using this new model, and some interesting properties of these protocols are formally derived.

AB - A study is presented which permits the formal analysis and synthesis of recoverable computer communication protocols. This study is based on a formal representation of processes by a model of computation, the Petri nets (PN‘s). The PN model is generalized to include a representation of the possible failures, and then, the concept of “recoverability” is formally defined. A set of necessary and sufficient conditions which a process must satisfy in order to be recoverable is derived. In the PN model, the processes that satisfy these conditions are shown to have some practical limitations. A new model, the time-Petri net (TPN), is introduced to remove these limitations. This new model allows the introduction of constraints in the execution times of its part. As shown in this paper, the TPN appears to be a suitable model for the study of practical recoverable processes. Several practical communication protocols are formally designed and analyzed using this new model, and some interesting properties of these protocols are formally derived.

UR - http://www.scopus.com/inward/record.url?scp=0017001923&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0017001923&partnerID=8YFLogxK

U2 - 10.1109/TCOM.1976.1093424

DO - 10.1109/TCOM.1976.1093424

M3 - Article

AN - SCOPUS:0017001923

VL - 24

SP - 1036

EP - 1043

JO - IEEE Transactions on Communications

JF - IEEE Transactions on Communications

SN - 0096-1965

IS - 9

ER -