Skip to main content
SpringerLink
Log in

An algebraic verification of a mobile network

  • Published:
Formal Aspects of Computing

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. G. Bruns and S. Anderson. The formalization and analysis of a communications protocol. Technical report, University of Edinburgh, Dept. of Computer Science, 1990.

  2. J.C.M. Baeten, editor.Applications of Process Algebra. Cambridge University Press, 1990.

  3. J. Bergstra and J. Klop. Verification of an alternating bit protocol by means of process algebra. Technical report, Centrum voor Wiskunde en Informatica, 1984.

  4. G. Boudol, R. de Simone, and D. Vergamini. Experiment with AUTO and AUTOGRAPH on a simple case of sliding window protocol. Technical Report 870, INRIA, 1988.

  5. CCITT.CCITT Recommendation I400 (Q920), I441 (Q921), 1985.

  6. P. Ernberg, L. Fredlund, and B. Jonsson. Specification and validation of a simple overtaking protocol in LOTOS. InProc. 4 th International Conference on formal Description Techniques, 1991.

  7. U. Engberg and M. Nielsen. A calculus of communicating systems with label-passing. Technical Report DAIMI PB-208, Comp. Sc. Department, Univ. of Aarhus, Denmark, 1986.

    Google Scholar 

  8. ETSI/GSM.GSM Recommendation 04.08, Mobile Radio Interface Layer 3 Specification, 1989.

  9. P.H.J. van Eijk, C.A. Vissers, and M. Diaz, editors.The Formal Description Technique LOTOS. North-Holland, 1989.

  10. L. Fredlund and F. Orava. Modeling dynamic communication structures in LOTOS. InProc. 4 th International Conference on Formal Description Techniques, 1991.

  11. C. Koomen. Algebraic specification and verification of protocols.Science of Computer Programming, 5(1):1–36, 1985.

    Google Scholar 

  12. K. Larsen and R. Milner. A complete protocol verification using relativized bisimulation. InProceedings of the 14:th Colloquium on Automata, Languages and Programming, 1987. Springer Verlag Lecture Notes in Computer Science 267.

  13. R. Milner.Communication and Concurrency. Prentice Hall, 1989.

  14. R. Milner, J. Parrow, and D. Walker. A calculus of mobile processes, part I. Technical Report ECS-LFCS-89-85, Department of Computer Science, University of Edinburgh, 1989. Accepted for publication inInformation and Computation.

  15. R. Milner, J. Parrow, and D. Walker. A calculus of mobile processes, part II. Technical Report ECS-LFCS-89-86, Department of Computer Science, University of Edinburgh, 1989. Accepted for publication inInformation and Computation.

  16. R. Milner, J. Parrow, and D. Walker. Modal logics for mobile processes. Technical Report R91:03, SICS, 1991. Accepted for publication inTheoretical Computer Science.

  17. A. Nazari. Formell beskrivning av kommunikationssystem med dynamisk topologi (in Swedish). Technical report, Dept. of Computer Systems, Uppsala University, 1989. MSc Thesis.

  18. J. Parrow. Verifying a CSMA/CD-protocol with CCS. InProtocol Specification, Testing, and Verification VIII, pages 373–384, 1988. North-Holland.

  19. S.A. Smolka, A.J. Frank, and S.K. Debray. Testing protocol robustness the CCS way. InProtocol Specification, Testing, and Verification IV (1984), pages 93–108, 1985. North-Holland.

Download references

Author information

Authors and Affiliations

  1. Swedish Institute of Computer Science, Box 1263, S-16428, Kista, Sweden

    Fredrik Orava & Joachim Parrow

  2. Department of Computer Systems, Uppsala University, Sweden

    Joachim Parrow

Authors
  1. Fredrik Orava
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Joachim Parrow
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Fredrik Orava.

Additional information

An early version of part of this material appeared inProtocol Specification, Testing, and Verification X, pages 275–291, North-Holland 1990.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Orava, F., Parrow, J. An algebraic verification of a mobile network. Formal Aspects of Computing 4, 497–543 (1992). https://doi.org/10.1007/BF01211473

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01211473

Keywords

Search

Navigation