Orava, Fredrik and Parrow, Joachim (1991) An algebraic verification of a mobile network. [SICS Report]
In a mobile communication network some nodes change location, and are therefore connected to different other nodes at different points in time. We show how such a network can be formally defined and verified using the p-calculus, which is a development of CCS (Calculus of Communicating Systems) allowing port names to be sent as parameters in communication events. An example of a mobile network is the Public Land Mobile Network currently being developed by the European Telecommunication Standards Institute. We concentrate on the handover procedures which controls the dynamic topology of the network.
|Item Type:||SICS Report|
|Additional Information:||An early version of part of this material appeared in Proc. Protocol Specification, Testing and Verification X, pages 275-291, North-Holland, 1990.|
|Deposited By:||Vicki Carleson|
|Deposited On:||22 Oct 2009|
|Last Modified:||18 Nov 2009 16:09|
Repository Staff Only: item control page