{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T20:57:40Z","timestamp":1725742660909},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642401831"},{"type":"electronic","value":"9783642401848"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-40184-8_6","type":"book-chapter","created":{"date-parts":[[2013,7,22]],"date-time":"2013-07-22T21:50:56Z","timestamp":1374529856000},"page":"61-75","source":"Crossref","is-referenced-by-count":5,"title":["Mutually Testing Processes"],"prefix":"10.1007","author":[{"given":"Giovanni","family":"Bernardi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Matthew","family":"Hennessy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"6_CR1","doi-asserted-by":"crossref","unstructured":"Barbanera, F., de\u2019Liguoro, U.: Two notions of sub-behaviour for session-based client\/server systems. In: Kutsia, T., Schreiner, W., Fern\u00e1ndez, M. (eds.) PPDP, pp. 155\u2013164. ACM (2010)","DOI":"10.1145\/1836089.1836109"},{"key":"6_CR2","unstructured":"Bernardi, G.: Behavioural Equivalences for Web Services. PhD thesis, Trinity College Dublin (2013), https:\/\/www.scss.tcd.ie\/~bernargi"},{"key":"6_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1007\/978-3-642-14458-5_5","volume-title":"Web Services and Formal Methods","author":"M. Bugliesi","year":"2010","unstructured":"Bugliesi, M., Macedonio, D., Pino, L., Rossi, S.: Compliance preorders for web services. In: Laneve, C., Su, J. (eds.) WS-FM 2009. LNCS, vol.\u00a06194, pp. 76\u201391. Springer, Heidelberg (2010)"},{"key":"6_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1007\/978-3-642-01918-0_7","volume-title":"Formal Methods for Web Services","author":"M. Bravetti","year":"2009","unstructured":"Bravetti, M., Zavattaro, G.: Contract-based discovery and composition of web services. In: Bernardo, M., Padovani, L., Zavattaro, G. (eds.) SFM 2009. LNCS, vol.\u00a05569, pp. 261\u2013295. Springer, Heidelberg (2009)"},{"key":"6_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1007\/11841197_10","volume-title":"Web Services and Formal Methods","author":"S. Carpineti","year":"2006","unstructured":"Carpineti, S., Castagna, G., Laneve, C., Padovani, L.: A formal account of contracts for web services. In: Bravetti, M., N\u00fa\u00f1ez, M., Zavattaro, G. (eds.) WS-FM 2006. LNCS, vol.\u00a04184, pp. 148\u2013162. Springer, Heidelberg (2006)"},{"issue":"5","key":"6_CR6","doi-asserted-by":"crossref","first-page":"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. Program. Lang. Syst.\u00a031(5), 1\u201361 (2009); Supersedes the article in POPL 2008 (2008)","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"6_CR7","doi-asserted-by":"crossref","unstructured":"De Nicola, R., Hennessy, M.: CCS without tau\u2019s. In: Ehrig, H., Kowalski, R.A., Levi, G., Montanari, U. (eds.) GI 1973. LNCS, vol.\u00a0249, pp. 138\u2013152. Springer, Heidelberg (1973)","DOI":"10.1007\/3-540-17660-8_53"},{"key":"6_CR8","volume-title":"Algebraic Theory of Processes","author":"M. Hennessy","year":"1988","unstructured":"Hennessy, M.: Algebraic Theory of Processes. The MIT Press, Cambridge (1988)"},{"key":"6_CR9","doi-asserted-by":"crossref","unstructured":"Hoare, C.A.R.: Communicating sequential processes. Prentice-Hall (1985)","DOI":"10.1007\/978-3-642-82921-5_4"},{"key":"6_CR10","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.\u00a04703, pp. 212\u2013225. Springer, Heidelberg (2007)"},{"key":"6_CR11","unstructured":"Milner, R.: Communication and Concurrency. Prentice-Hall (1989)"},{"issue":"3-5","key":"6_CR12","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1016\/j.jlap.2009.12.001","volume":"79","author":"A.J. Mooij","year":"2010","unstructured":"Mooij, A.J., Stahl, C., Voorhoeve, M.: Relating fair testing and accordance for service replaceability. J. Log. Algebr. Program.\u00a079(3-5), 233\u2013244 (2010)","journal-title":"J. Log. Algebr. Program."},{"issue":"1-2","key":"6_CR13","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1016\/0304-3975(84)90113-0","volume":"34","author":"R. Nicola De","year":"1984","unstructured":"De Nicola, R., Hennessy, M.C.B.: Testing equivalences for processes. Theoretical Computer Science\u00a034(1-2), 83\u2013133 (1984)","journal-title":"Theoretical Computer Science"},{"issue":"37","key":"6_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. Theor. Comput. Sci.\u00a0411(37), 3328\u20133347 (2010)","journal-title":"Theor. Comput. Sci."},{"key":"6_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/978-3-642-21464-6_9","volume-title":"Coordination Models and Languages","author":"L. Padovani","year":"2011","unstructured":"Padovani, L.: Fair Subtyping for Multi-Party Session Types. In: De Meuter, W., Roman, G.-C. (eds.) COORDINATION 2011. LNCS, vol.\u00a06721, pp. 127\u2013141. Springer, Heidelberg (2011)"},{"issue":"2","key":"6_CR16","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1016\/j.ic.2006.06.002","volume":"205","author":"A. Rensink","year":"2007","unstructured":"Rensink, A., Vogler, W.: Fair testing. Information and Computation\u00a0205(2), 125\u2013198 (2007)","journal-title":"Information and Computation"}],"container-title":["Lecture Notes in Computer Science","CONCUR 2013 \u2013 Concurrency Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-40184-8_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,3,1]],"date-time":"2022-03-01T18:10:37Z","timestamp":1646158237000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-40184-8_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642401831","9783642401848"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-40184-8_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}