{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,10]],"date-time":"2026-11-10T21:43:42Z","timestamp":1794347022908,"version":"4.9.0"},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540713883","type":"print"},{"value":"9783540713890","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-71389-0_22","type":"book-chapter","created":{"date-parts":[[2007,7,1]],"date-time":"2007-07-01T16:22:53Z","timestamp":1183306973000},"page":"302-316","source":"Crossref","is-referenced-by-count":16,"title":["Semantic Barbs and Biorthogonality"],"prefix":"10.1007","author":[{"given":"Julian","family":"Rathke","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Vladimiro","family":"Sassone","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Pawe\u0142","family":"Soboci\u0144ski","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"22_CR1","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1017\/S0960129500003054","volume":"10","author":"M. Abadi","year":"2000","unstructured":"Abadi, M.: $\\scriptstyle\\top\\top$ -closed relations and admissibility. Mathematical Structures in Computer Science\u00a010, 313\u2013320 (2000)","journal-title":"Mathematical Structures in Computer Science"},{"issue":"2","key":"22_CR2","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1016\/S0304-3975(97)00223-5","volume":"195","author":"R.M. Amadio","year":"1998","unstructured":"Amadio, R.M., Castellani, I., Sangiorgi, D.: On bisimulations for the asynchronous pi-calculus. Theoretical Computer Science\u00a0195(2), 291\u2013324 (1998)","journal-title":"Theoretical Computer Science"},{"key":"22_CR3","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1016\/0304-3975(92)90185-I","volume":"96","author":"G. Berry","year":"1992","unstructured":"Berry, G., Boudol, G.: The chemical abstract machine. Theoretical Computer Science\u00a096, 217\u2013248 (1992)","journal-title":"Theoretical Computer Science"},{"key":"22_CR4","series-title":"Lecture Notes in Bioinformatics","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1007\/978-3-540-25974-9_24","volume-title":"Computational Methods in Systems Biology","author":"L. Cardelli","year":"2005","unstructured":"Cardelli, L.: Brane calculi: Interactions of biological membranes. In: Danos, V., Schachter, V. (eds.) CMSB 2004. LNCS (LNBI), vol.\u00a03082, pp. 257\u2013280. Springer, Heidelberg (2005)"},{"key":"22_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0053547","volume-title":"Foundations of Software Science and Computation Structures","author":"L. Cardelli","year":"1998","unstructured":"Cardelli, L., Gordon, A.D.: Mobile Ambients. In: Nivat, M. (ed.) ETAPS 1998 and FOSSACS 1998. LNCS, vol.\u00a01378, Springer, Heidelberg (1998)"},{"key":"22_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"292","DOI":"10.1007\/3-540-44622-2_19","volume-title":"Computer Science Logic","author":"V. Danos","year":"2000","unstructured":"Danos, V., Krivine, J.-L.: Disjunctive tautologies as synchronisation schemes. In: Clote, P.G., Schwichtenberg, H. (eds.) CSL 2000. LNCS, vol.\u00a01862, pp. 292\u2013301. Springer, Heidelberg (2000)"},{"key":"22_CR7","first-page":"372","volume-title":"Proceedings of Symposium on Principles of Programming Languages, POPL\u201996","author":"C. Fournet","year":"1996","unstructured":"Fournet, C., Gonthier, G.: The reflexive chemical abstract machine and the join-calculus. In: Proceedings of Symposium on Principles of Programming Languages, POPL\u201996, pp. 372\u2013385. ACM Press, New York (1996)"},{"key":"22_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0304-3975(87)90045-4","volume":"50","author":"J.-Y. Girard","year":"1987","unstructured":"Girard, J.-Y.: Linear logic. Theoretical Computer Science\u00a050, 1\u2013101 (1987)","journal-title":"Theoretical Computer Science"},{"key":"22_CR9","volume-title":"Communicating Sequential Processes","author":"C.A.R. Hoare","year":"1985","unstructured":"Hoare, C.A.R.: Communicating Sequential Processes. Prentice-Hall, Englewood Cliffs (1985)"},{"issue":"2","key":"22_CR10","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1016\/0304-3975(95)00074-7","volume":"151","author":"K. Honda","year":"1995","unstructured":"Honda, K., Yoshida, N.: On reduction-based process semantics. Theoretical Computer Science\u00a0151(2), 437\u2013486 (1995)","journal-title":"Theoretical Computer Science"},{"key":"22_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1007\/3-540-44618-4_19","volume-title":"CONCUR 2000 - Concurrency Theory","author":"J. Leifer","year":"2000","unstructured":"Leifer, J., Milner, R.: Deriving bisimulation congruences for reactive systems. In: Palamidessi, C. (ed.) CONCUR 2000. LNCS, vol.\u00a01877, pp. 243\u2013258. Springer, Heidelberg (2000)"},{"key":"22_CR12","first-page":"82","volume-title":"Logic in Computer Science LICS \u201905","author":"P.-A. Melli\u00e8s","year":"2005","unstructured":"Melli\u00e8s, P.-A., Vouillon, J.: Recursive polymorphic types and parametricity in an operational framework. In: Logic in Computer Science LICS \u201905, pp. 82\u201391. IEEE Computer Society Press, Los Alamitos (2005)"},{"key":"22_CR13","volume-title":"Communication and Concurrency","author":"R. Milner","year":"1989","unstructured":"Milner, R.: Communication and Concurrency. Prentice-Hall, Englewood Cliffs (1989)"},{"key":"22_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"685","DOI":"10.1007\/3-540-55719-9_114","volume-title":"Automata, Languages and Programming","author":"R. Milner","year":"1992","unstructured":"Milner, R., Sangiorgi, D.: Barbed bisimulation. In: Kuich, W. (ed.) Automata, Languages and Programming. LNCS, vol.\u00a0623, pp. 685\u2013695. Springer, Heidelberg (1992)"},{"key":"22_CR15","doi-asserted-by":"crossref","first-page":"171","DOI":"10.3233\/FI-1992-16206","volume":"XVI","author":"U. Montanari","year":"1992","unstructured":"Montanari, U., Sassone, V.: Dynamic congruence vs. progressing bisimulation for CCS. Fundamenta Informaticae\u00a0XVI, 171\u2013199 (1992)","journal-title":"Fundamenta Informaticae"},{"key":"22_CR16","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1017\/S0960129500003066","volume":"10","author":"A.M. Pitts","year":"2000","unstructured":"Pitts, A.M.: Parametric polymorphism and operational equivalence. Mathematical Structures in Computer Science\u00a010, 321\u2013359 (2000)","journal-title":"Mathematical Structures in Computer Science"},{"key":"22_CR17","doi-asserted-by":"crossref","unstructured":"Plotkin, G.D.: A structural approach to operational semantics. Technical Report DAIMI FN-19, Aarhus University (1981), Reprinted in Journal of Logic and Algebraic Programming 60-61, 17\u2013139 (2004)","DOI":"10.1016\/j.jlap.2004.05.001"},{"key":"22_CR18","series-title":"London Mathematical Society Student Texts","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9781139163699","volume-title":"Undergraduate Algebraic Geometry","author":"M. Reid","year":"1988","unstructured":"Reid, M.: Undergraduate Algebraic Geometry. London Mathematical Society Student Texts, vol.\u00a012. Cambridge University Press, Cambridge (1988)"},{"key":"22_CR19","volume-title":"IEEE Workshop on Internet Programming Languages","author":"J. Vitek","year":"1998","unstructured":"Vitek, J., Castagna, G.: A calculus of secure mobile computations. In: IEEE Workshop on Internet Programming Languages, IEEE Computer Society Press, Los Alamitos (1998)"},{"key":"22_CR20","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1007\/978-94-009-7798-3_15","volume-title":"Ordered Sets","author":"R. Wille","year":"1982","unstructured":"Wille, R.: Restructuring lattice theory: an approach based on hierarchies of concepts. In: Rival, I. (ed.) Ordered Sets, pp. 445\u2013470. Reidel, Dordrecht (1982)"}],"container-title":["Lecture Notes in Computer Science","Foundations of Software Science and Computational Structures"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-71389-0_22.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,8,16]],"date-time":"2021-08-16T06:41:19Z","timestamp":1629096079000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-71389-0_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540713883","9783540713890"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-71389-0_22","relation":{"is-part-of":[{"id-type":"doi","id":"https:\/\/doi.org\/10.1007\/978-3-540-71389-0","asserted-by":"object"}]},"subject":[]}}