Abstract
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.
Research supported by ESPRIT BRA Grants 6454: CONFER and 7166: CONCUR2.
Chapter PDF
Similar content being viewed by others
Keywords
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.
References
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.
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.
J-C. Fernandez. Aldébaran: A tool for verification of communicating processes. Technical Report RTC 14, IMAG, Grenoble, 1989.
J-C. Fernandez and L. Mounier. “On-the-fly” verification of behavioural equivalences and preorders. In Proceedings of CAV'91. 1991.
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.
H. Garavel and J. Sifakis. Compilation and verification of LOTOS specifications. In Proceedings of Protocol Specification, Testing, and Verification X, 1990.
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.
M. Hennessy and H. Lin. Symbolic bisimulations. Research Report TR1/92. University of Sussex, 1992.
E. Madelaine. Verification tools from the CONCUR project. Bulletin of the European Association of Theoretical Computer Science 47, pp110–126, June 1992.
R. Milner. Communication and Concurrency. Prentice-Hall, 1989.
R. Milner. The polyadic π-calculus: a tutorial. Research Report ECS-LFCS-91-180. University of Edinburgh, October 1991.
R. Milner. Action Structures for the π-Calculus. Research Report ECS-LFCS-93-264. University of Edinburgh, May 1993.
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.
F. Orava and J. Parrow. An algebraic verification of a mobile network. Formal Aspects of Computing, 4:497–543, 1992.
J. Parrow. Interaction Diagrams. Swedish Institute of Computer Science Research Report R93:06, 1993. (To appear in Proceedings of REX'93, Springer-Verlag.)
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.
P.H.J. van Eijk, C.A. Vissers and M. Diaz (eds). The Formal Description Technique LOTOS. North-Holland, 1989.
B. Victor. Forthcoming licentiate thesis, Uppsala University, 1994.
Author information
Authors and Affiliations
Editor information
Additional information
Dedicated to Ellen on the occasion of her birth.
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Victor, B., Moller, F. (1994). The mobility workbench — A tool for the π-Calculus. In: Dill, D.L. (eds) Computer Aided Verification. CAV 1994. Lecture Notes in Computer Science, vol 818. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58179-0_73
Download citation
DOI: https://doi.org/10.1007/3-540-58179-0_73
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-58179-6
Online ISBN: 978-3-540-48469-1
eBook Packages: Springer Book Archive