A theory of bisimulation for the π-calculus

Acta Informatica

Volumn 33, Issue 1, 1996, Pages 69-97

  Sangiorgi, Davide ^a  

^a INRIA   (France)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0030532165     PISSN: 00015903     EISSN: None     Source Type: Journal    
DOI: 10.1007/s002360050036     Document Type: Article

References (21)

1. Amadio, R.: A uniform presentation CHOCS and π-calculus. Rapport de recherche 1726, INRIA-Lorraine, Nancy, 1992
2. Boreale, M., De Nicola, R.: Testing equivalence for mobile processes. In Cleaveland, R. (ed.) Proc, 3rd CONCUR (Lect. Notes Comput. Sci., Vol. 630, pp. 2-16) Berlin: Springer 1992. To appear in Information and Computation
3. Bergstra, J.A., Klop, J.W.: Algebra for communicating processes with abstraction. Theoretical Computer Science 37(1), 77-121 (1985)
4. Degano, P., Kasangian, S., Vigna, S.: Applications of the calculus of trees to process description languages. Proc. of the CTCS '91 Conf. (Lecture Notes Comput. Sci. Vol. 530, pp. 281-301) Berlin: Springer 1991
5. Engberg, U., Nielsen, M.: A calculus of communicating systems with label-passing. Report DAIMI PB-208, Computer Science Department, University of Aarhus, Denmark 1986
6. Hennessy, M.: A model for the π-calculus. 91/08, Department of Computer Science, University of Sussex, 1991
7. Hennessy, M., Lin, H.: Symbolic bisimulations. Revised Version of Techn. Report TR 1/92, Department of Computer Science, University of Sussex, 1992
8. Leth, L.: Functional programs as reconfigurable networks of communicating processes. Ph.D. Thesis, Imperial College, London University, 1992
9. Levy, J.-J., Thomsen, B., Leth, L., Giacalone, A.: First year report for Esprit Basic Research Action 6454-CONFER. Bullettin of EATCS, 52 (1994)
10. Milner, R.: Calculi for synchrony and asynchrony. Theoretical Computer Science, 25, 269-310 (1983)
11. Milner, R.: Communication and Concurrency. Englewood Cliffs, NJ: Printice Hall 1989
12. Milner, R.: Action structures. Techn. Report ECS-LFCS-92-249, LFCS, Dept. of omp. Sci., Edinburgh Univ., December 1992
13. Milner, R.: Functions as processes. Journal of Mathematical Structures in Computer Science 2(2), 119-141 (1992)
14. Milner, R., Parrow, J., Walker, D.: Modal logics for mobile processes. Proc. 2nd CONCUR (Lect. Notes Comput. Sci., Vol. 527, pp. 45-60) Berlin: Springer 1991
15. Milner, R., Parrow, J., Walker, D.: A calculus of mobile processes (Parts I and II). Information and Computation 100, 1-77 (1992)
16. Montanari, U., Sassone, V.: Dynamic congruence vs. progressing bisimulation for CCS. Fundamenta Informaticae XVI(2), 171-199 (1992)
17. Park, D.M.: Concurrency on automata and infinite sequences. In Deussen, P. (ed.) Conf. on Theoretical Computer Science (Lect. Notes Comput. Sci., Vol. 104) Berlin: Springer 1981
18. Parrow, J., Sangiorgi, D.: Algebraic theories for name-passing calculi. Techn. Report ECS-LFCS-93-262, LFCS, Dept. of Comp. Sci., Edinburgh Univ., 1993. To appear in Information and Computation. Short version in Proc. REX Summer School/Symposium 1993, (Lect. Notes Comput. Sci., Vol. 803) Berlin: Springer
19. Sangiorgi, D.: Expressing mobility in process algebras: First-order and higher-order paradigms. Ph.D. Thesis CST-99-93, Department of Computer Science, University of Edinburgh, 1992
20. Thomsen, B.: Calculi for higher order communicating systems. Ph.D. Thesis, Department of Computing, Imperial College, 1990
21. Wadsworth, C.P.: Semantics and pragmatics of the lambda calculus. Ph.D. Thesis, University of Oxford, 1971