The mobility workbench — A tool for the π-Calculus

  • Björn Victor
  • Faron Moller
Model Checking 2
Part of the Lecture Notes in Computer Science book series (LNCS, volume 818)


In this paper we describe the first prototype version of the Mobility Work-bench (MWB), an automated tool for manipulating and analyzing mobile concurrent systems (those with evolving connectivity structures) described in the π-calculus. The main feature of this version of the MWB is checking open bisimulation equivalences. We illustrate the MWB with an example automated analysis of a handover protocol for a mobile telephone system.


Model Check Label Transition System Mobile Process Handover Procedure Mobile Switching Centre 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


  1. [1]
    N.G. de Bruijn. Lambda Calculus Notation with Nameless Dummies, a Tool for Automatic Formula Manipulation, with Application to the Church-Rosser Theorem. Indagationes Mathematicae, 34:381–392. North-Holland, 1972.Google Scholar
  2. [2]
    M. Dam. Model Checking Mobile Processes. In Proceedings of CONCUR'93. Lecture Notes in Computer Science 715. E. Best (ed). pp22–36. Springer-Verlag, 1993.Google Scholar
  3. [3]
    J-C. Fernandez. Aldébaran: A tool for verification of communicating processes. Technical Report RTC 14, IMAG, Grenoble, 1989.Google Scholar
  4. [4]
    J-C. Fernandez and L. Mounier. “On-the-fly” verification of behavioural equivalences and preorders. In Proceedings of CAV'91. 1991.Google Scholar
  5. [5]
    L.-å. Fredlund and F. Orava. Modelling Dynamic Communication Structures in LOTOS. In Proceedings of FORTE'91, K.R. Parker and G.A. Rose (eds). pp185–200. North-Holland, 1992.Google Scholar
  6. [6]
    H. Garavel and J. Sifakis. Compilation and verification of LOTOS specifications. In Proceedings of Protocol Specification, Testing, and Verification X, 1990.Google Scholar
  7. [7]
    S.J. Gay. A Sort Inference Algorithm for the Polyadic π-Calculus. In Proceedings of 20th ACM Symp. on Principles of Programming Languages, ACM Press, 1993.Google Scholar
  8. [8]
    M. Hennessy and H. Lin. Symbolic bisimulations. Research Report TR1/92. University of Sussex, 1992.Google Scholar
  9. [9]
    E. Madelaine. Verification tools from the CONCUR project. Bulletin of the European Association of Theoretical Computer Science 47, pp110–126, June 1992.Google Scholar
  10. [10]
    R. Milner. Communication and Concurrency. Prentice-Hall, 1989.Google Scholar
  11. [11]
    R. Milner. The polyadic π-calculus: a tutorial. Research Report ECS-LFCS-91-180. University of Edinburgh, October 1991.Google Scholar
  12. [12]
    R. Milner. Action Structures for the π-Calculus. Research Report ECS-LFCS-93-264. University of Edinburgh, May 1993.Google Scholar
  13. [13]
    R. Milner, J. Parrow and D. Walker. A calculus of mobile processes (Parts I and II). Journal of Information and Computation, 100:1–77, September 1992.CrossRefGoogle Scholar
  14. [14]
    F. Orava and J. Parrow. An algebraic verification of a mobile network. Formal Aspects of Computing, 4:497–543, 1992.CrossRefGoogle Scholar
  15. [15]
    J. Parrow. Interaction Diagrams. Swedish Institute of Computer Science Research Report R93:06, 1993. (To appear in Proceedings of REX'93, Springer-Verlag.)Google Scholar
  16. [16]
    D. Sangiorgi. A theory of bisimulation for the π-calculus. In Proceedings of CONCUR'93. Lecture Notes in Computer Science 715. E. Best (ed). pp127–142. Springer-Verlag, 1993.Google Scholar
  17. [17]
    P.H.J. van Eijk, C.A. Vissers and M. Diaz (eds). The Formal Description Technique LOTOS. North-Holland, 1989.Google Scholar
  18. [18]
    B. Victor. Forthcoming licentiate thesis, Uppsala University, 1994.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1994

Authors and Affiliations

  • Björn Victor
    • 1
    • 2
  • Faron Moller
    • 3
  1. 1.Dept of Computer SystemsUppsala UniversityUppsalaSweden
  2. 2.Swedish Institute for Computer ScienceSweden
  3. 3.Dept of Computer ScienceUniversity of EdinburghEdinburgh

Personalised recommendations