Communication protocol testing can be done with a test architecture consisting of remote Tester and local Responder processes. By ignoring interaction primitive parameters and additional state variables, it is possible to adapt test sequence generation techniques for finite state machines (FSM) to generate sequences for protocols specified as incomplete finite state machines. / For real protocols, tests can be designed based on the formal specification of the protocol which uses an extended FSM model in specifying the transition types. The transition types are transformed into a simpler form called normal form transitions which can be modelled by a control and a data flow graph. Furthermore, the data flow graph is partitioned to obtain disjoint blocks representing the different functions of the protocol. Tests are designed by considering parameter variations of the input primitives of each data flow function and determining the expected outputs. This methodology gives complete test coverage of all data flow functions and tests for unspecified cases can be designed using the control and data flow graphs. The methodology is applied to two real protocols: Transport protocols Classes 0 and 2.
| Identifer | oai:union.ndltd.org:LACETR/oai:collectionscanada.gc.ca:QMM.71940 |
| Date | January 1984 |
| Creators | Sarikaya, Behcet. |
| Publisher | McGill University |
| Source Sets | Library and Archives Canada ETDs Repository / Centre d'archives des thèses électroniques de Bibliothèque et Archives Canada |
| Language | English |
| Detected Language | English |
| Type | Electronic Thesis or Dissertation |
| Format | application/pdf |
| Coverage | Doctor of Philosophy (School of Computer Science.) |
| Rights | All items in eScholarship@McGill are protected by copyright with all rights reserved unless otherwise indicated. |
| Relation | alephsysno: 000194966, proquestno: AAINK66686, Theses scanned by UMI/ProQuest. |
Page generated in 0.0061 seconds