{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T06:56:49Z","timestamp":1760079409650,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642022722"},{"type":"electronic","value":"9783642022739"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-02273-9_9","type":"book-chapter","created":{"date-parts":[[2009,6,26]],"date-time":"2009-06-26T14:12:17Z","timestamp":1246025537000},"page":"95-111","source":"Crossref","is-referenced-by-count":13,"title":["Partial Orders, Event Structures and Linear Strategies"],"prefix":"10.1007","author":[{"given":"Claudia","family":"Faggian","sequence":"first","affiliation":[]},{"given":"Mauro","family":"Piccolo","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"2","key":"9_CR1","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1006\/inco.2000.2930","volume":"163","author":"S. Abramsky","year":"2000","unstructured":"Abramsky, S., Malacaria, P., Jagadeesan, R.: Full abstraction for PCF. Inf. and Comp.\u00a0163(2), 409\u2013470 (2000)","journal-title":"Inf. and Comp."},{"key":"9_CR2","doi-asserted-by":"crossref","unstructured":"Abramsky, S., Melli\u00e8s, P.-A.: Concurrent games and full completeness. In: Proc. of LICS, pp. 431\u2013442 (1999)","DOI":"10.1109\/LICS.1999.782638"},{"key":"9_CR3","unstructured":"Curien, P.-L.: Notes on game semantics, http:\/\/www.pps.jussieu.fr\/~curien"},{"key":"9_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/11538363_13","volume-title":"Computer Science Logic","author":"P.-L. Curien","year":"2005","unstructured":"Curien, P.-L., Faggian, C.: L-nets, strategies and proof-nets. In: Ong, L. (ed.) CSL 2005. LNCS, vol.\u00a03634, pp. 167\u2013183. Springer, Heidelberg (2005)"},{"key":"9_CR5","first-page":"376","volume-title":"Proc. of LICS 2005","author":"C. Faggian","year":"2005","unstructured":"Faggian, C., Maurel, F.: Ludics nets, a game model of concurrent interaction. In: Proc. of LICS 2005, pp. 376\u2013385. IEEE Computer Society Press, Los Alamitos (2005)"},{"issue":"4","key":"9_CR6","first-page":"21","volume":"175","author":"C. Faggian","year":"2007","unstructured":"Faggian, C., Piccolo, M.: A graph abstract machine describing event structure composition. ENTCS\u00a0175(4), 21\u201336 (2007)","journal-title":"ENTCS"},{"key":"9_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1007\/978-3-540-73228-0_12","volume-title":"Typed Lambda Calculi and Applications","author":"C. Faggian","year":"2007","unstructured":"Faggian, C., Piccolo, M.: Ludics is a model for the finitary linear pi-calculus. In: Della Rocca, S.R. (ed.) TLCA 2007. LNCS, vol.\u00a04583, pp. 148\u2013162. Springer, Heidelberg (2007)"},{"key":"9_CR8","unstructured":"Faggian, C., Piccolo, M.: Ludics is a model for the linear pi-calculus. Draft (2009)"},{"key":"9_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1007\/978-3-540-24727-2_16","volume-title":"Foundations of Software Science and Computation Structures","author":"D.R. Ghica","year":"2004","unstructured":"Ghica, D.R., Murawski, A.S.: Angelic semantics of fine-grained concurrency. In: Walukiewicz, I. (ed.) FOSSACS 2004. LNCS, vol.\u00a02987, pp. 211\u2013225. Springer, Heidelberg (2004)"},{"key":"9_CR10","first-page":"301","volume":"11","author":"J.-Y. Girard","year":"2001","unstructured":"Girard, J.-Y.: Locus solum: from the rules of logics to the logics of rules. MSCS\u00a011, 301\u2013506 (2001)","journal-title":"MSCS"},{"key":"9_CR11","unstructured":"Harmer, R.: Innocent game semantics, http:\/\/www.pps.jussieu.fr\/~russ"},{"issue":"2","key":"9_CR12","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1006\/inco.2000.2917","volume":"163","author":"J.M.E. Hyland","year":"2000","unstructured":"Hyland, J.M.E., Ong, L.C.-H.: On full abstraction for PCF: I, II, and III. Inf. and Comp.\u00a0163(2), 285\u2013408 (2000)","journal-title":"Inf. and Comp."},{"key":"9_CR13","unstructured":"Hyland, M.: A category of partial orders. Communication at AMS\/SMF Meeting in Lyon (July 2001), http:\/\/www.dpmms.cam.ac.uk\/~martin\/Research\/Slides\/lyon01.pdf"},{"key":"9_CR14","first-page":"257","volume-title":"Proc. of LICS 2002","author":"M. Hyland","year":"2002","unstructured":"Hyland, M., Schalk, A.: Games on graph and sequentially realizable functionals. In: Proc. of LICS 2002, pp. 257\u2013264. IEEE Computer Society Press, Los Alamitos (2002)"},{"key":"9_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/11539452_8","volume-title":"CONCUR 2005 \u2013 Concurrency Theory","author":"J. Laird","year":"2005","unstructured":"Laird, J.: A game semantics of the asynchronous \u03c0-calculus. In: Abadi, M., de Alfaro, L. (eds.) CONCUR 2005. LNCS, vol.\u00a03653, pp. 51\u201365. Springer, Heidelberg (2005)"},{"key":"9_CR16","unstructured":"McCusker, G., Wall, M.: Categorical and game semantics for SCIR. In: Proc. of GALOP, pp. 157\u2013178 (2005)"},{"issue":"2-3","key":"9_CR17","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1016\/j.tcs.2006.01.016","volume":"358","author":"P.-A. Melli\u00e8s","year":"2006","unstructured":"Melli\u00e8s, P.-A.: Asynchronous games 2: The true concurrency of innocence. TCS\u00a0358(2-3), 200\u2013228 (2006)","journal-title":"TCS"},{"key":"9_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1007\/978-3-540-74407-8_27","volume-title":"CONCUR 2007 \u2013 Concurrency Theory","author":"P.-A. Melli\u00e8s","year":"2007","unstructured":"Melli\u00e8s, P.-A., Mimram, S.: Asynchronous games: Innocence without alternation. In: Caires, L., Vasconcelos, V.T. (eds.) CONCUR 2007. LNCS, vol.\u00a04703, pp. 395\u2013411. Springer, Heidelberg (2007)"},{"issue":"1","key":"9_CR19","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/0304-3975(81)90112-2","volume":"13","author":"M. Nielsen","year":"1981","unstructured":"Nielsen, M., Plotkin, G., Winskel, G.: Petri nets, event structures and domains. TCS\u00a013(1), 85\u2013108 (1981)","journal-title":"TCS"},{"key":"9_CR20","volume-title":"The \u03c0-calculus: a theory of mobile processes","author":"D. Sangiorgi","year":"2001","unstructured":"Sangiorgi, D., Walker, D.: The \u03c0-calculus: a theory of mobile processes. Cambridge University Press, Cambridge (2001)"},{"key":"9_CR21","doi-asserted-by":"crossref","unstructured":"Schalk, A., P\u00e9rez, J.J.P.: Concrete data structures as games. ENTCS (2005)","DOI":"10.1016\/j.entcs.2004.06.058"},{"key":"9_CR22","doi-asserted-by":"crossref","unstructured":"Varacca, D., Yoshida, N.: Typed event structures and the \u03c0-calculus. In: Proc, of MFPS. ENTCS, vol.\u00a0158, pp. 373\u2013397 (2006)","DOI":"10.1016\/j.entcs.2006.04.019"},{"key":"9_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1007\/3-540-17906-2_31","volume-title":"Advances in Petri Nets 1986. Proceedings of an Advanced Course, Bad Honnef, 8.-19. September 1986","author":"G. Winskel","year":"1987","unstructured":"Winskel, G.: Event structures. In: Brauer, W., Reisig, W., Rozenberg, G. (eds.) APN 1986. LNCS, vol.\u00a0255, pp. 325\u2013392. Springer, Heidelberg (1987)"},{"key":"9_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1007\/BFb0013026","volume-title":"Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency","author":"G. Winskel","year":"1989","unstructured":"Winskel, G.: An introduction to event structures. In: de Bakker, J.W., de Roever, W.-P., Rozenberg, G. (eds.) Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency. LNCS, vol.\u00a0354, pp. 364\u2013397. Springer, Heidelberg (1989)"},{"key":"9_CR25","first-page":"1","volume-title":"Handbook of Logic in Computer Science","author":"G. Winskel","year":"1995","unstructured":"Winskel, G., Nielsen, M.: Models for concurrency. In: Handbook of Logic in Computer Science, pp. 1\u2013148. Oxford University Press, Oxford (1995)"},{"issue":"2","key":"9_CR26","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1016\/j.ic.2003.08.004","volume":"191","author":"N. Yoshida","year":"2004","unstructured":"Yoshida, N., Berger, M., Honda, K.: Strong normalisation in the PI-calculus. Inf. and Comp.\u00a0191(2), 145\u2013202 (2004)","journal-title":"Inf. and Comp."}],"container-title":["Lecture Notes in Computer Science","Typed Lambda Calculi and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-02273-9_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,10]],"date-time":"2025-02-10T11:57:43Z","timestamp":1739188663000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-02273-9_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642022722","9783642022739"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-02273-9_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}