{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,6]],"date-time":"2025-11-06T20:03:27Z","timestamp":1762459407303,"version":"3.41.0"},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319395180"},{"type":"electronic","value":"9783319395197"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-39519-7_2","type":"book-chapter","created":{"date-parts":[[2016,5,24]],"date-time":"2016-05-24T13:18:53Z","timestamp":1464095933000},"page":"18-34","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["A Game Interpretation of Retractable Contracts"],"prefix":"10.1007","author":[{"given":"Franco","family":"Barbanera","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ugo","family":"de\u2019 Liguoro","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,5,24]]},"reference":[{"key":"2_CR1","doi-asserted-by":"crossref","unstructured":"Abramsky, S., Mellies, P.A.: Concurrent games and full completeness. In: Proceedings of the 14th Symposium on Logic in Computer Science, pp. 431\u2013442 (1999)","DOI":"10.1109\/LICS.1999.782638"},{"key":"2_CR2","doi-asserted-by":"crossref","unstructured":"Barbanera, F., van Bakel, S., de\u2019 Liguoro, U.: Orchestrated session compliance. In: Proceedings ICE 2015. EPTCS, vol. 189, pp. 21\u201336 (2015)","DOI":"10.4204\/EPTCS.189.4"},{"issue":"6","key":"2_CR3","doi-asserted-by":"crossref","first-page":"1339","DOI":"10.1017\/S096012951400005X","volume":"25","author":"FRANCO BARBANERA","year":"2014","unstructured":"Barbanera, F., de\u2019 Liguoro, U.: Sub-behaviour relations for session-based client\/server systems. MSCS 25(6), 1339\u20131381 (2015)","journal-title":"Mathematical Structures in Computer Science"},{"key":"2_CR4","doi-asserted-by":"crossref","unstructured":"Barbanera, F., Dezani-Ciancaglini, M., Lanese, I., de\u2019 Liguoro, U.: Retractable contracts. In: PLACES. EPTCS, vol. 203, pp. 61\u201372. Open Publishing Ass. (2015)","DOI":"10.4204\/EPTCS.203.5"},{"issue":"3","key":"2_CR5","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1016\/j.jlamp.2015.05.001","volume":"85","author":"M Bartoletti","year":"2016","unstructured":"Bartoletti, M., Cimoli, T., Pinna, G.M., Zunino, R.: Contracts as games on event structures. J. Logical Algebraic Methods Progr. 85(3), 399\u2013424 (2016)","journal-title":"J. Logical Algebraic Methods Progr."},{"key":"2_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1007\/978-3-319-05032-4_6","volume-title":"Software Engineering and Formal Methods","author":"G Bernardi","year":"2014","unstructured":"Bernardi, G., Hennessy, M.: Compliance and testing preorders differ. In: Counsell, S., N\u00fa\u00f1ez, M. (eds.) SEFM 2013. LNCS, vol. 8368, pp. 69\u201381. Springer, Heidelberg (2014)"},{"issue":"4","key":"2_CR7","doi-asserted-by":"crossref","first-page":"309","DOI":"10.3233\/FI-1998-33401","volume":"33","author":"M Brandt","year":"1998","unstructured":"Brandt, M., Henglein, F.: Coinductive axiomatization of recursive type equality and subtyping. Fundam. Inform. 33(4), 309\u2013338 (1998)","journal-title":"Fundam. Inform."},{"issue":"3","key":"2_CR8","doi-asserted-by":"publisher","first-page":"601","DOI":"10.1017\/S0960129509007658","volume":"19","author":"M Bravetti","year":"2009","unstructured":"Bravetti, M., Zavattaro, G.: A theory of contracts for strong service compliance. Math. Struct. Comput. Sci. 19(3), 601\u2013638 (2009)","journal-title":"Math. Struct. Comput. Sci."},{"issue":"5","key":"2_CR9","doi-asserted-by":"publisher","first-page":"19:1","DOI":"10.1145\/1538917.1538920","volume":"31","author":"G Castagna","year":"2009","unstructured":"Castagna, G., Gesbert, N., Padovani, L.: A theory of contracts for web services. ACM Trans. Prog. Lang. Sys. 31(5), 19:1\u201319:61 (2009)","journal-title":"ACM Trans. Prog. Lang. Sys."},{"issue":"2\/3","key":"2_CR10","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/s00236-005-0177-z","volume":"42","author":"S Gay","year":"2005","unstructured":"Gay, S., Hole, M.: Subtyping for session types in the Pi-Calculus. Acta Informatica 42(2\/3), 191\u2013225 (2005)","journal-title":"Acta Informatica"},{"key":"2_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"212","DOI":"10.1007\/978-3-540-74407-8_15","volume-title":"CONCUR 2007 \u2013 Concurrency Theory","author":"C Laneve","year":"2007","unstructured":"Laneve, C., Padovani, L.: The Must preorder revisited. In: Caires, L., Vasconcelos, V.T. (eds.) CONCUR 2007. LNCS, vol. 4703, pp. 212\u2013225. Springer, Heidelberg (2007)"},{"key":"2_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"548","DOI":"10.1007\/BFb0036936","volume-title":"Automata, Languages and Programming","author":"RD Nicola","year":"1983","unstructured":"Nicola, R.D., Hennessy, M.: Testing equivalence for processes. In: D\u00edaz, J. (ed.) ICALP 1983. LNCS, vol. 154, pp. 548\u2013560. Springer, Heidelberg (1983)"},{"key":"2_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1007\/978-3-642-01918-0_6","volume-title":"Formal Methods for Web Services","author":"L Padovani","year":"2009","unstructured":"Padovani, L.: Contract-based discovery and adaptation of web services. In: Bernardo, M., Padovani, L., Zavattaro, G. (eds.) SFM 2009. LNCS, vol. 5569, pp. 213\u2013260. Springer, Heidelberg (2009)"},{"key":"2_CR14","doi-asserted-by":"publisher","first-page":"3328","DOI":"10.1016\/j.tcs.2010.05.002","volume":"411","author":"L Padovani","year":"2010","unstructured":"Padovani, L.: Contract-based discovery of web services modulo simple orchestrators. Theoret. Comput. Sci. 411, 3328\u20133347 (2010)","journal-title":"Theoret. Comput. Sci."},{"key":"2_CR15","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 Part II","author":"G Winskel","year":"1987","unstructured":"Winskel, G.: Event structures. In: Brauer, W., Reisig, W., Rozenberg, G. (eds.) Advances in Petri Nets 1986, Part II. LNCS, vol. 255, pp. 325\u2013392. Springer, Heidelberg (1987)"}],"container-title":["Lecture Notes in Computer Science","Coordination Models and Languages"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-39519-7_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,3]],"date-time":"2025-06-03T19:11:24Z","timestamp":1748977884000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-39519-7_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319395180","9783319395197"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-39519-7_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"24 May 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}