论文信息 - The Mobility Workbench | a Tool for the -calculus

The Mobility Workbench | a Tool for the -calculus |

In this paper we describe the rst 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. Dedicated to Ellen on the occasion of her birth.

Faron Mollerz | Faron Mollerz

[1] Robin Milner,et al. The Polyadic π-Calculus: a Tutorial , 1993 .

[2] Joachim Parrow. Interaction Diagrams , 1995, Nord. J. Comput..

[3] Matthew Hennessy,et al. Symbolic Bisimulations , 1995, Theor. Comput. Sci..

[4] Joseph Sifakis,et al. Compilation and verification of LOTOS specifications , 1990, PSTV.

[5] Joseph,et al. Compilation and Veriication of Lotos Speciications , 1990 .

[6] Jean-Claude Fernandez. Ald Ebaran: a Tool for Veriication of Communicating Processes , 1989 .

[7] E. Madelaine. Verification Tools from the CONCUR project , 1992 .

[8] Robin Milner,et al. Communication and concurrency , 1989, PHI Series in computer science.

[9] Mads Dam. Model Checking Mobile Processes , 1993, CONCUR.

[10] Laurent Mounier,et al. "On the Fly" Verification of Behavioural Equivalences and Preorders , 1991, CAV.

[11] de Ng Dick Bruijn,et al. Lambda calculus notation with nameless dummies, a tool for automatic formula manipulation, with application to the Church-Rosser theorem , 1972 .

[12] Simon J. Gay,et al. A sort inference algorithm for the polyadic π-calculus , 1993, POPL '93.