Change search
ReferencesLink to record
Permanent link

Direct link
An algebraic verification of a mobile network
Number of Authors: 2
1991 (English)Report (Refereed)
Abstract [en]

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.

Place, publisher, year, edition, pages
Kista, Sweden: Swedish Institute of Computer Science , 1991, 1. , 35 p.
Series
SICS Research Report, ISSN 0283-3638 ; R91:02
National Category
Computer and Information Science
Identifiers
URN: urn:nbn:se:ri:diva-22173OAI: oai:DiVA.org:ri-22173DiVA: diva2:1041716
Note
An early version of part of this material appeared in Proc. Protocol Specification, Testing and Verification X, pages 275-291, North-Holland, 1990.Available from: 2016-10-31 Created: 2016-10-31

Open Access in DiVA

fulltext(3599 kB)3 downloads
File information
File name FULLTEXT01.pdfFile size 3599 kBChecksum SHA-512
e530d48350db7a827399bdee33445a740ef1954e1ced540d19a36f8187efb446f55439f3cd9fb54f2de35c569e3b706eedcbdaa1bd2b9dea4e7fbe53d84887e5
Type fulltextMimetype application/pdf

Computer and Information Science

Search outside of DiVA

GoogleGoogle Scholar
Total: 3 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

ReferencesLink to record
Permanent link

Direct link