### Abstract

Many of the problems in designing communications protocols, which involve asynchronous parallel processes, are due to the difficulty in recognizing all of the possible orderings in which the significant events can occur and the possible execution sequences which arise from these orderings. The modeling technique examined in this paper is derived from the UCLA Graph Model of Computation and experience with the development of ARPANET. One especially attractive aspect of this modeling technique is the existence of a computer program for testing for the property of proper termination. Proper termination indicates that the process modeled by the graph is in a certain sense well behaved; for example it has no deadlocks. These developments suggest that communications protocols can be modeled by the UCLA Graph Model in a useful and revealing way.

Original language | English |
---|---|

Pages | 66-77 |

Number of pages | 12 |

Publication status | Published - 1976 Jan 1 |

Externally published | Yes |

Event | Proc of the Tex Conf on Comput Syst, 5th - Austin, TX, USA Duration: 1976 Oct 18 → 1976 Oct 19 |

### Conference

Conference | Proc of the Tex Conf on Comput Syst, 5th |
---|---|

City | Austin, TX, USA |

Period | 76/10/18 → 76/10/19 |

### Fingerprint

### ASJC Scopus subject areas

- Engineering(all)

### Cite this

*GRAPH MODELING OF COMPUTER COMMUNICATIONS PROTOCOL.*. 66-77. Paper presented at Proc of the Tex Conf on Comput Syst, 5th, Austin, TX, USA, .

**GRAPH MODELING OF COMPUTER COMMUNICATIONS PROTOCOL.** / Postel, Jonathan B.; Farber, David.

Research output: Contribution to conference › Paper

}

TY - CONF

T1 - GRAPH MODELING OF COMPUTER COMMUNICATIONS PROTOCOL.

AU - Postel, Jonathan B.

AU - Farber, David

PY - 1976/1/1

Y1 - 1976/1/1

N2 - Many of the problems in designing communications protocols, which involve asynchronous parallel processes, are due to the difficulty in recognizing all of the possible orderings in which the significant events can occur and the possible execution sequences which arise from these orderings. The modeling technique examined in this paper is derived from the UCLA Graph Model of Computation and experience with the development of ARPANET. One especially attractive aspect of this modeling technique is the existence of a computer program for testing for the property of proper termination. Proper termination indicates that the process modeled by the graph is in a certain sense well behaved; for example it has no deadlocks. These developments suggest that communications protocols can be modeled by the UCLA Graph Model in a useful and revealing way.

AB - Many of the problems in designing communications protocols, which involve asynchronous parallel processes, are due to the difficulty in recognizing all of the possible orderings in which the significant events can occur and the possible execution sequences which arise from these orderings. The modeling technique examined in this paper is derived from the UCLA Graph Model of Computation and experience with the development of ARPANET. One especially attractive aspect of this modeling technique is the existence of a computer program for testing for the property of proper termination. Proper termination indicates that the process modeled by the graph is in a certain sense well behaved; for example it has no deadlocks. These developments suggest that communications protocols can be modeled by the UCLA Graph Model in a useful and revealing way.

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

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

M3 - Paper

AN - SCOPUS:0017240815

SP - 66

EP - 77

ER -