The mobility workbench - A tool for the π-Calculus

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 818 LNCS, Issue , 1994, Pages 428-440

  Victor, Björn ^a,b   Moller, Faron ^c  

^a UPPSALA UNIVERSITY   (Sweden)

^b SWEDISH INSTITUTE OF COMPUTER SCIENCE   (Sweden)

^c UNIVERSITY OF EDINBURGH   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER AIDED ANALYSIS;

AUTOMATED ANALYSIS; AUTOMATED TOOLS; BISIMULATION EQUIVALENCES; CONNECTIVITY STRUCTURES; MOBILE CONCURRENT SYSTEMS; MOBILE TELEPHONES; MOBILITY WORKBENCH; PROTOTYPE VERSIONS;

CALCULATIONS;

EID: 85006239926     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-58179-0_73     Document Type: Conference Paper

References (18)

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.
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.
3. J-C. Fernandez. Aldébaran: A tool for verification of communicating processes. Technical Report RTC 14, IMAG, Grenoble, 1989.
4. J-C. Fernandez and L. Mounier. “On-the-fly” verification of behavioural equivalences and preorders. In Proceedings of CAV’91. 1991.
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.
6. H. Garavel and J. Sifakis. Compilation and verification of LOTOS specifications. In Proceedings of Protocol Specification, Testing, and Verification X, 1990.
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.
8. M. Hennessy and H. Lin. Symbolic bisimulations. Research Report TR1/92. University of Sussex, 1992.
9. E. Madelaine. Verification tools from the CONCUR project. Bulletin of the European Association of Theoretical Computer Science 47, pp110-126, June 1992.
10. R. Milner. Communication and Concurrency. Prentice-Hall, 1989.
11. R. Milner. The polyadic π-calculus: a tutorial. Research Report ECS-LFCS-91-180. University of Edinburgh, October 1991.
12. R. Milner. Action Structures for the π-Calculus. Research Report ECS-LFCS-93-264. University of Edinburgh, May 1993.
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.
14. F. Orava and J. Parrow. An algebraic verification of a mobile network. Formal Aspects of Computing, 4:497-543, 1992.
15. J. Parrow. Interaction Diagrams. Swedish Institute of Computer Science Research Report R93:06, 1993. (To appear in Proceedings of REX’93, Springer-Verlag.)
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.
17. P.H.J. van Eijk, C.A. Vissers and M. Diaz (eds). The Formal Description Technique LOTOS. North-Holland, 1989.
18. B. Victor. Forthcoming licentiate thesis, Uppsala University, 1994.