A game semantics of the asynchronous π-calculus

Lecture Notes in Computer Science

Volumn 3653, Issue , 2005, Pages 51-65

  Laird, Jim ^a  

^a UNIVERSITY OF SUSSEX   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING LANGUAGES; EQUIVALENCE CLASSES; GAME THEORY; HIERARCHICAL SYSTEMS; MATHEMATICAL MODELS;

DENOTATIONAL SEMANTICS; GAME SEMANTICS; TRACE OPERATORS; Π-CALCULUS;

SEMANTICS;

EID: 27244452773     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11539452_8     Document Type: Conference Paper

References (26)

1. S. Abramsky, R. Jagadeesan. Games and full completeness for multiplicative linear logic. Journal of Symbolic Logic, 59:543-574, 1994.
2. S. Abramsky, R. Jagadeesan and P. Malacaria. Full abstraction for PCF. Information and Computation, 163:409-470, 2000.
3. M. Berger, K. Honda, and N. Yoshida. Sequentiality and the π-calculus. In Proceedings of TLCA 2001, volume 2044 of Lecture Notes in Computer Science. Springer-Verlag, 2001.
4. M. Berger, K. Honda, and N. Yoshida. Strong normalization in the π-calculus. In Proceedings of LICS 2001. IEEE Press, 2001.
5. G. Boudol. Asynchrony in the pi-calculus. Technical Report 1702, INRIA, 1992.
6. D. Ghica and G. McCusker. The regular language semantics of second-order Idealised Algol. Theoretical Computer Science (To appear), 2003.
7. D. Ghica and A. Murawski. Angelic semantics of fine-grained concurrency. In Proceedings of FOSSACS '04, number 2987 in LNCS, pages 211-225. Springer, 2004.
8. R. Harmer and G. McCusker. A fully abstract games semantics for finite non-determinism. In Proceedings of the Fourteenth Annual Symposium on Logic in Computer Science, LICS '99. IEEE Computer Society Press, 1998.
9. M. Hennessy. A fully abstract denotational semantics for the π-calculus. Technical Report 041996, University of Sussex (COGS), 2996.
10. K. Honda and M. Tokoro. An object calculus for asynchronous communication. In Proceedings of ECOOP '91, number 512 in LNCS, pages 133-147, 1991.
11. J. M. E. Hyland and C.-H. L. Ong. On full abstraction for PCF: I, II and III. Information and Computation, 163:285-408, 2000.
12. L. J. Jagadeesan and R. Jagadeesan. Causality and true concurrency: A data-flow analysis of the pi-calculus. In Proceedings of AMAST '95, 1995.
13. A. S. A. Jeffrey and J. Rathke. Contextual equivalence for higher-order pi-calculus revisited. Technical Report 0402, University of Sussex (COGS), 2002.
14. A. S. A. Jeffrey and J. Rathke. A fully abstract may-testing semantics for concurrent objects. In Proceedings of LICS '02, pages 101-112, 2002.
15. A. Joyal, R. Street, and D. Verity. Traced monoidal categories. Math. Proc. Camb. Phil. Soc., 119:447 - 468, 1996.
16. J. Laird. A game semantics of ICSP. In Proceedings of MFPS XVII, number 45 in Electronic notes in Theoretical Computer Science. Elsevier, 2001.
17. J. Laird. A categorical semantics of higher-order store. In Proceedings of CTCS '02, number 69 in ENTCS. Elsevier, 2002.
18. J. Laird. A game semantics of local names and good variables. In Proceedings of FOSSACS '04, number 2987 in LNCS, pages 289-303. Springer, 2004.
19. R. de Nicola M. Boreale and R. Pugliese. Trace and testing equivalence on asynchronous processes. Information and Computation, 172(2):139-164, 2002.
20. E. Moggi M. Fiore and D. Sangiorgi. A fully abstract model for the π-calculus. In Proceedings of LICS '96, 2996.
21. th International Colloquium on Automata, Langugages and Programming, 1998.
22. G. McCusker. Games and full abstraction for a functional metalanguage with recursive types. PhD thesis, Imperial College London, 1996. Published by Cambridge University Press.
23. R. Milner. Polyadic π-calculus: a tutorial. In Proceedings of the Marktoberdorf Summer School on Logic and Algebra of Specification, 1992.
24. J. Power and H. Thielecke. Environments in Freyd categories and κ-categories. In Proceedings of ICALP '99, number 1644 in LNCS. Springer, 1999.
25. D. Sangiorgi. Expressing Mobility in Process Algebras: First-Order and Higher-Order Paradigms. PhD thesis, University of Edinburgh, 1993.
26. I. Stark. A fully abstract domain model for the π-calculus. In Proceedings of LICS '96, 1996.