An algebraic verification of a mobile network
- 1 November 1992
- journal article
- research article
- Published by Association for Computing Machinery (ACM) in Formal Aspects of Computing
- Vol. 4 (6) , 497-543
- https://doi.org/10.1007/bf01211473
Abstract
In a mobile communication network some nodes change locations, and are therefore connected to different other nodes at different points in time. We show how some important aspects of such a network can be formally defined and verified using the π -calculus, which is a development of CCS (Calculus of Communicating Systems) allowing port names to be sent as parameters in communication events. As an example of a mobile network we consider the Public Land Mobile Network currently being developed by the European Telecommunication Standards Institute and concentrate on the handover procedure which controls the dynamic topology of the network.Keywords
This publication has 5 references indexed in Scilit:
- Specification and Validation of a Simple Overtaking Protocol using LOTOSPublished by Elsevier ,1992
- Modelling Dynamic Communication Structures in LOTOSPublished by Elsevier ,1992
- Modal logics for mobile processesPublished by Springer Nature ,1991
- Applications of Process AlgebraPublished by Cambridge University Press (CUP) ,1990
- Verifying a protocol using relativized bisimulationLecture Notes in Computer Science, 1987