Methodology for the description and validation of communication protocols
Abstract
The models which may be used for the formal description of communication protocols, such as those required for complex computer networks, are analyzed and compared. Two types of models are studied: (1) the abstract automata models including finite state machines, UCLA graphs, Petri nets and formal grammars, and (2) the algorithmic models based on high level programming languages, including sequential languages, such as Pascal, Simula, PL/1, and concurrent languages such as Concurrent Pascal and Chill. Advantages and difficulties are found in both type of models. The evolution of hybrid models is mentionned.
- Publication:
-
NASA STI/Recon Technical Report N
- Pub Date:
- December 1981
- Bibcode:
- 1981STIN...8228534P
- Keywords:
-
- Mathematical Models;
- Network Analysis;
- Pulse Communication;
- Systems Engineering;
- Computer Networks;
- High Level Languages;
- Communications and Radar