Ludics nets, a game model of concurrent interaction

Proceedings - Symposium on Logic in Computer Science

Volumn , Issue , 2005, Pages 376-385

  Faggian, Claudia ^a   Maurel, Francois ^b  

^a UNIVERSITY OF PADOVA   (Italy)

^b PPS ^*  (France)

Author keywords

[No Author keywords available]

Indexed keywords

CONCURRENCY CONTROL; PARALLEL PROCESSING SYSTEMS; SEMANTICS;

CONCURRENT INTERACTION; GAME MODEL; GAMES SEMANTICS; PARALLELISM;

GAME THEORY;

EID: 26844519575     PISSN: 10436871     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (14)

1. S. Abramsky and P.-A. Mellies. Concurrent games and full completeness. In Proceedings LICS 99. IEEE Computer Society Press, 1999.
2. J.-M. Andreoli. Focussing proof-net construction as a middleware paradigm. In Proceedings of Conference on Automated Deduction (CADE), 2002.
3. P.-L. Curien and C. Faggian. L-nets, strategies and proof-nets. Submitted, available at www.math.unipd.it/claudia.
4. C. Faggian. Travelling on designs: ludics dynamics. In CSL 02, volume 2471 of LNCS. Springer Verlag, 2002.
5. C. Faggian. Ludics and interactive observability: the geometry of tests. Theoretical Computer Science, to appear.
6. C. Faggian and M. Hyland. Designs, disputes and strategies. In CSL 02, volume 2471 of LNCS. Springer Verlag, 2002.
7. J.-Y. Girard. Linear logic. Theoretical Computer Science, 50:1-102, 1987.
8. J.-Y. Girard. Proof-nets: the parallel syntax for proof-theory. In Ursini and Agliano, editors, Logic and Algebra. Marcel Dekker, New York, 1996.
9. J.-Y. Girard. Locus solum. Mathematical Structures in Computer Science, 11:301-506, 2001.
10. R. Harmer and G. McCusker. A fully abstract game semantics for finite nondeterminism. In Proceedings LICS 99. IEEE Computer Society Press, 1999.
11. M. Hyland and A. Schalk. Games on graphs and sequentially realizable functionals. In Proceedings LICS 02, pages 257-264. IEEE Computer Society Press, 2002.
12. O. Laurent and L. Tortora-de Falco. Slicing polarized additive normalization. In T. Ehrhard, J.-Y. Girard, P. Ruet, and P. Scott, editors, Linear Logic in Computer Science, volume 316 of LMSLNS. Cambridge University Press, Nov. 2004.
13. P.-A. Mellies. Asynchronous games 2: The true concurrency of innocence. In CONCUR 04, volume 3170 of LNCS. Springer Verlag, 2004.
14. M. Nielsen, G. Plotkin, and G. Winskel. Event structures and domains 1. Theoretical Computer Science, 13:85-108, 1981.