This thesis verifies the Capability Exchange Signalling (CES) protocol, a control protocol for multimedia communications developed by the International Telecommunication Union. Using the CES protocol as a vehicle, the thesis also proposes and investigates the idea of exploiting structural regularities of state spaces to obtain symbolic representations of state spaces and their associated deterministic Finite State Automata (FSA) that represent service (or protocol) languages. This is an important step towards parametric verification of the CES protocol, because the symbolic representations can be analysed for arbitrary values of parameters. It also provides valuable experience for parametric verification of other protocols having integer parameters (such as channel capacities). / Thesis (PhDComputerSystemsEng)--University of South Australia, 2006.
| Identifer | oai:union.ndltd.org:ADTP/267229 |
| Creators | Liu, Lin. |
| Source Sets | Australiasian Digital Theses Program |
| Language | English |
| Detected Language | English |
| Rights | copyright under review |
Page generated in 0.0014 seconds