Model Checking Mobile Processes

Information and Computation

Volumn 129, Issue 1, 1996, Pages 35-51

  Dam, Mads ^a  

^a SWEDISH INSTITUTE OF COMPUTER SCIENCE   (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0004717076     PISSN: 08905401     EISSN: None     Source Type: Journal    
DOI: 10.1006/inco.1996.0072     Document Type: Article

References (20)

1. Andersen, H., and Winskel, G. (1991), Compositional checking of satisfaction, in "Proceedings, 3rd Workshop on Computer Aided Verification," Lecture Notes in Computer Science, Vol. 575, pp. 24-36, Springer-Verlag, Berlin/New York.
2. Cleaveland, R., Parrow, J., and Steffen, B. (1993), A semantics-based verification tool for the verification of concurrent systems, ACM Trans. Programmming Languages and Systems 15, 36-72.
3. Cleaveland, R., and Steffen, B. (1991), Computing behavioural relations, logically, in "Proceedings, ICALP'91," Lecture Notes in Computer Science, Vol. 510, pp. 127-138, Springer-Verlag, Berlin/New York.
4. Dam, M. (1994), CTL* and ECTL* as fragments of the modal mucalculus, Theoret. Comput. Sci. 126, 77-96.
5. Hennessy, M., and Lin, H. (1992), "Symbolic Bisimulations," Report 1/92, Dept. of Computer Science, Univ. of Sussex.
6. Hennessy, M., and Liu, X. (1993), "A Modal Logic for Message Passing Processes," Report 3/93, Dept. of Computer Science, Univ. of Sussex.
7. Jonsson, B., and Parrow, J. (1993), Deciding bisimulation equivalences for a class of non-finite-state programs, Inform. and Comput. 107, 272-302.
8. Larsen, K. G. (1988), Proof systems for Hennessy-Milner logic with recursion, in "Proceedings, 13th CAAP," Lecture Notes in Computer Science, Vol. 299, pp. 215-230, Springer-Verlag, Berlin/New York.
9. Milner, R. (1989), "Communication and Concurrency," Prentice-Hall, Englewood Cliffs, NJ.
10. Milner, R. (1991), "The Polyadic π-Calculus: A Tutorial," Technical Report ECS-LFCS-91-180, Laboratory for the Foundations of Computer Science, Dept. of Computer Science, Univ. of Edinburgh.
11. Milner, R. (1992), Functions as processes, Math. Structures Comput. Sci. 2, 119-141.
12. Milner, R., Parrow, J., and Walker, D. (1993), Modal logics for mobile processes, Theoret. Comput. Sci. 114, 149-171.
13. Milner, R., Parrow, J., and Walker, D. (1992), A calculus of mobile processes, I and II, Inform. and Comput. 100, 1-40 and 41-77.
14. Orava, F. and Parrow, J. (1992), An algebraic verification of a mobile network, Formal Aspects Comput. 4, 497-543.
15. Park, D. (1976), Finiteness is mu-ineffable, Theoret. Comput. Sci. 3, 173-181
16. Sangiorgi, D. (1993), From π-calculus to higher-order π-calculus - and back, in "Proceedings TAPSOFT'93."
17. Streett, R. S., and Emerson, E. A. (1989), An automata theoretic decision procedure for the propositional mu-calculus, Inform. and Comput. 81, 249-264.
18. Stirling, C. (1987), Modal logics for communicating systems, Theoret. Comput. Sci. 49, 311-347.
19. Stirling, C. (1992), "Modal and Temporal Logics for Processes," Technical Report ECS-LFCS-92-221, Laboratory for the Foundations of Computer Science, Dept. of Computer Science, Univ. of Edinburgh.
20. Stirling, C., and Walker, D. (1991), Local model checking in the modal mu-calculus, Theoret. Comput. Sci. 89, 161-177.