A fully abstract model for the π-calculus

Information and Computation

Volumn 179, Issue 1, 2002, Pages 76-117

  Fiore, M P ^a   Moggi, E ^b   Sangiorgi, D ^c  

^a UNIVERSITY OF CAMBRIDGE   (United Kingdom)

^b UNIVERSITY OF GENOA   (Italy)

^c INRIA   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; COMPUTER SIMULATION; FORMAL LANGUAGES; SEMANTICS; SET THEORY; SYNTACTICS; THEOREM PROVING;

DENOTATIONAL SEMANTICS; DOMAIN THEORETIC MODEL; FREE ALGEBRA; FULLY ABSTRACT MODEL; METALANGUAGE; MONADS; PI-CALCULUS;

MATHEMATICAL MODELS;

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

References (35)

1. Abramsky, S (1991). A domain equation for bisimulation, Inform. and Comput. 92, 161-218.
2. Abramsky, S., Jagadeesan, R., and Malacaria, P. (1994), Full abstraction for PCF (extended abstract), in "Proceedings, Theoretical Aspects of Computer Software. International Symposium TACS'94" (M. Hagiya and J. C. Mitchell, Eds.), Lecture Notes in Computer Science, Vol. 789, Springer-Verlag, Berlin/New York.
3. Abramsky, S., and Jung, A. (1994), Domain theory, in "Handbook of Logic in Computer Science," Oxford Univ. Press, London.
4. Aceto, L., and Ingólfsdóttir, A. (1996), CPO models for compact GSOS languages, Inform. and Comput. 129(2), 107-141.
5. Anderson, S. O., and Power, A. J. (1997), A representable approach to finite nondeterminism. Theoret. Comput. Sci. 177(1), 3-25.
6. Baeten, J., and Weijland, W. (1990), "Process Algebra," Cambridge Tracts in Theoretical Computer Science, Cambridge Univ. Press. Cambridge, UK.
7. Boreale, M., and De Nicola, R. (1996), A symbolic semantics for the π-calculus, Inform. and Comput. 126, 34-52.
8. Bolognesi, T., and Brinksma, E. (1989), Introduction to the ISO specification language LOTOS, in "The Formal Description Technique LOTOS" (P. H. J. van Eijk, C. A. Vissers, and M. Diaz, Eds.), North Holland, Amsterdam.
9. Cattani, G. L., Stark, I., and Winskel, G. (1997), Presheaf models for the π-calculus, in "7th International Conference on Category Theory and Computer Science," Lecture Notes in Computer Science, Vol. 1290, Springer-Verlag, Berlin/New York.
10. Cenciarelli, P., and Moggi, E. (1993), A syntactic approach to modularity in denotational semantics, in "Proceedings, CTCS-5 (Category Theory and Computer Science Fifth Biennial Meeting)," pp. 9-12. CWI.
11. Fiore, M. P. (1996), "Axiomatic Domain Theory in Categories of Partial Maps," Distinguished Dissertations in Computer Science, Cambridge University Press, Cambridge, UK.
12. Fiore, M. P., Cattani, G. L., and Winskel, G. (1999), Weak bisimulation and open maps, in "Fourteenth LICS Conf.," IEEE Comput. Soc. Press, New York.
13. Hennessy, M. (1981), A term model for synchronous processes, Inform. and Control 51(1), 58-75.
14. Hennessy, M. (1994), A fully abstract denotational model for higher-order processes, Inform. and Comput. 112(1), 55-95.
15. Hennessy, M. (1996), "A Fully Abstract Denotational Semantics for the Pi-Calculus," Computer Science Technical Report 1996:04, School of Cognitive and Computing Sciences, University of Sussex.
16. Hennessy, M., and Plotkin, G. (1979), Full abstraction for a simple parallel programming language, in "Proceedings, 8th Symposium on Mathematical Foundations of Computer Science" (J. Becvar, Ed.), Lecture Notes in Computer Science. Vol. 74, Springer-Verlag, Berlin/New York.
17. Hennessy, M., and Plotkin, G. (1980), A term model for CCS, in "Proceedings, 9th Symposium on Mathematical Foundations of Computer Science" (P. Dembinski, Ed.), Lecture Notes in Computer Science, Vol. 88, Springer-Verlag, Berlin/New York.
18. Hyland, J. M. E., and Ong, C.-H. L. (1995), Pi-calculus, dialogue games and PCF, in "Proceedings, 7th Annual ACM Conference on Functional Programming Languages and Computer Architecture," Assoc. Comput. Mach., New York.
19. Jeffrey, A. (1995), A fully abstract semantics for a concurrent functional language with monadic types, in "Proceedings, 10th Annual IEEE Symposium on Logic in Computer Science," pp. 255-264, IEEE Comput. Soc. Press, New York.
20. Lambek, J., and Scott, P. J. (1986), "Introduction to Higher Order Categorical Logic," Cambridge University Press, Cambridge, UK.
21. Milner, R., Parrow, J., and Walker, D. (1992), A calculus of mobile processes, I and II, Inform. and Comput. 100(1), 1-77.
22. Milner, R. (1993), "The Polyadic π-Calculus: A Tutorial," Technical Report ECS-LFCS-91-180, LFCS, University of Edinburgh, 1991. (Also in "Logic and Algebra of Specification" (F. L. Bauer, W. Brauer, and H. Schwichtenberg, Eds.). Springer-Verlag, Berlin/New York.)
23. Moggi, E. (1991), Notions of computation and monads, Inform. and Comput. 93(1), 55-92.
24. Oles, F. J. (1985), Type algebras, functor categories and block structure, in "Algebraic Methods in Semantics" (M. Nivat and J. C. Reynolds, Eds.)
25. Parrow, J., and Sangiorgi, D. (1995), Algebraic theories for name-passing calculi, Inform. and Comput. 120(2), 174-197.
26. Pitts, A. M., and Stark, I. D. B. (1993), Observable properties of higher order functions that dynamically create local names, or: What's new? in "Proceedings, MFCS'93" (A. M. Borzyszkowski and S. Sokolowski, Eds.) Lecture Notes in Computer Science, Vol. 711, Springer-Verlag, Berlin/New York.
27. Rutten, J. (1992), Processes as terms: Non-well-founded models for bisimulation. Mathematical Structures in Computer Science 2, 257-275.
28. Sangiorgi, D. (1992), "Expressing Mobility in Process Algebras: First-Order and Higher-Order Paradigms," Ph.D. thesis, Department of Computer Science, University of Edinburgh.
29. Sangiorgi, D. (1998), On the bisimulation proof method, Mathematical Structures in Computer Science 8(5), 447-479.
30. Sangiorgi, D. (1996), A theory of bisimulation for the π-calculus, Acta Informatica 33, 69-97.
31. Sangiorgi, D. (1996), π-Calculus, internal mobility and agent-passing calculi, Theoret. Comput. Sci. 167(2), 235-274.
32. Sangiorgi, D., and Walker, D. (Forthcoming), "The π-Calculus: A Theory of Mobile Processes," Cambridge University Press, Cambridge, UK.
33. Smyth, M., and Plotkin, G. (1982), The category-theoretic solution of recursive domain equations, SIAM J. Comput. 11(4), 761-783.
34. Stark, I. (1996), A fully abstract domain model for the π-calculus, in "Eleventh LICS Conf." IEEE Comput. Soc. Press, New York.
35. Thomsen, B. (1990), "Calculi for Higher Order Communicating Systems," Ph.D. thesis, Department of Computing, Imperial College.