{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,16]],"date-time":"2026-04-16T05:24:03Z","timestamp":1776317043624,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540766360","type":"print"},{"value":"9783540766377","type":"electronic"}],"license":[{"start":{"date-parts":[[2007,1,1]],"date-time":"2007-01-01T00:00:00Z","timestamp":1167609600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007]]},"DOI":"10.1007\/978-3-540-76637-7_24","type":"book-chapter","created":{"date-parts":[[2007,11,20]],"date-time":"2007-11-20T02:47:52Z","timestamp":1195526872000},"page":"351-366","source":"Crossref","is-referenced-by-count":29,"title":["Complete Lattices and Up-To Techniques"],"prefix":"10.1007","author":[{"given":"Damien","family":"Pous","sequence":"first","affiliation":[]}],"member":"297","reference":[{"issue":"9","key":"24_CR1","doi-asserted-by":"publisher","first-page":"737","DOI":"10.1007\/BF01191894","volume":"29","author":"S. Arun-Kumar","year":"1992","unstructured":"Arun-Kumar, S., Hennessy, M.: An efficiency preorder for processes. Acta Informatica\u00a029(9), 737\u2013760 (1992)","journal-title":"Acta Informatica"},{"key":"24_CR2","volume-title":"Proc. Struct. in Concurrency Theory","author":"S. Arun-Kumar","year":"1995","unstructured":"Arun-Kumar, S., Natarajan, V.: Conformance: A precongruence close to bisimilarity. In: Proc. Struct. in Concurrency Theory, Springer, London (1995)"},{"key":"24_CR3","volume-title":"Introduction to Lattices and Order","author":"B. Davey","year":"1990","unstructured":"Davey, B., Priestley, H.: Introduction to Lattices and Order. Cambridge University Press, Cambridge (1990)"},{"issue":"1\u20132","key":"24_CR4","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1016\/S0304-3975(96)00154-5","volume":"179","author":"H. Doornbos","year":"1997","unstructured":"Doornbos, H., Backhouse, R., van der Woude, J.: A calculational approach to mathematical induction. Theoretical Computer Science\u00a0179(1\u20132), 103\u2013135 (1997)","journal-title":"Theoretical Computer Science"},{"key":"24_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"348","DOI":"10.1007\/3-540-44929-9_26","volume-title":"Theoretical Computer Science: Exploring New Frontiers of Theoretical Informatics","author":"C. Fournet","year":"2000","unstructured":"Fournet, C., L\u00e9vy, J.-J., Schmitt, A.: An asynchronous, distributed implementation of mobile ambients. In: Watanabe, O., Hagiya, M., Ito, T., van Leeuwen, J., Mosses, P.D. (eds.) TCS 2000. LNCS, vol.\u00a01872, pp. 348\u2013364. Springer, Heidelberg (2000)"},{"issue":"1","key":"24_CR6","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1016\/j.jlap.2004.01.006","volume":"63","author":"C. Fournet","year":"2005","unstructured":"Fournet, C., Gonthier, G.: A hierarchy of equivalences for asynchronous calculi. Journal of Logic and Algebraic Programming\u00a063(1), 131\u2013173 (2005)","journal-title":"Journal of Logic and Algebraic Programming"},{"issue":"5","key":"24_CR7","doi-asserted-by":"publisher","first-page":"651","DOI":"10.1017\/S0960129504004281","volume":"14","author":"M. Hennessy","year":"2004","unstructured":"Hennessy, M., Rathke, J.: Typed behavioural equivalences for processes in the presence of subtyping. Math. Struct. in Computer Science\u00a014(5), 651\u2013684 (2004)","journal-title":"Math. Struct. in Computer Science"},{"issue":"2","key":"24_CR8","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.: Kohei Honda and Nobuka Yoshida. Theoretical Computer Science\u00a0151(2), 437\u2013486 (1995)","journal-title":"Theoretical Computer Science"},{"key":"24_CR9","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1006\/inco.1996.0008","volume":"124","author":"D.J. Howe","year":"1996","unstructured":"Howe, D.J.: Proving congruence of bisimulation in functional programming languages. Information and Computation\u00a0124, 103\u2013112 (1996)","journal-title":"Information and Computation"},{"key":"24_CR10","volume-title":"Higher Order Operational Techniques in Semantics","author":"S.B. Lassen","year":"1998","unstructured":"Lassen, S.B.: Relational reasoning about contexts. In: Gordon, A.D., Pitts, A.M. (eds.) Higher Order Operational Techniques in Semantics, Cambridge University Press, Cambridge (1998)"},{"key":"24_CR11","volume-title":"Communication and Concurrency","author":"R. Milner","year":"1989","unstructured":"Milner, R.: Communication and Concurrency. Prentice-Hall, Englewood Cliffs (1989)"},{"key":"24_CR12","series-title":"Lecture Notes in Computer Science","volume-title":"Proc. TGC 2006","author":"D. Pous","year":"2007","unstructured":"Pous, D.: On bisimulation proofs for the analysis of distributed abstract machines. In: Montanari, U., Sannella, D. (eds.) Proc. TGC 2006. LNCS, vol.\u00a04661, Springer, Heidelberg (2007)"},{"key":"24_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"390","DOI":"10.1007\/11817949_26","volume-title":"CONCUR 2006 \u2013 Concurrency Theory","author":"D. Pous","year":"2006","unstructured":"Pous, D.: Weak bisimulation up to elaboration. In: Baier, C., Hermanns, H. (eds.) CONCUR 2006. LNCS, vol.\u00a04137, pp. 390\u2013405. Springer, Heidelberg (2006)"},{"key":"24_CR14","series-title":"Lecture Notes in Computer Science","volume-title":"Automata, Languages and Programming","author":"D. Pous","year":"2005","unstructured":"Pous, D.: New up-to techniques for weak bisimulation. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol.\u00a03580, Springer, Heidelberg (2005)"},{"key":"24_CR15","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1017\/S0960129598002527","volume":"8","author":"D. Sangiorgi","year":"1998","unstructured":"Sangiorgi, D.: On the bisimulation proof method. Journal of Math. Struct. in Computer Science\u00a08, 447\u2013479 (1998)","journal-title":"Journal of Math. Struct. in Computer Science"},{"key":"24_CR16","unstructured":"Sangiorgi, D.: Personal communication (2006)"},{"key":"24_CR17","first-page":"293","volume-title":"LICS 2007","author":"D. Sangiorgi","year":"2007","unstructured":"Sangiorgi, D., Kobayashi, N., Sumii, E.: Environmental bisimulations for higher-order languages. In: LICS 2007, pp. 293\u2013302. IEEE Computer Society Press, Los Alamitos (2007)"},{"key":"24_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1007\/BFb0084781","volume-title":"CONCUR 1992","author":"D. Sangiorgi","year":"1992","unstructured":"Sangiorgi, D., Milner, R.: The problem of \u201cweak bisimulation up to. In: Cleaveland, W.R. (ed.) CONCUR 1992. LNCS, vol.\u00a0630, pp. 32\u201346. Springer, Heidelberg (1992)"},{"key":"24_CR19","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)"},{"issue":"2","key":"24_CR20","doi-asserted-by":"crossref","first-page":"285","DOI":"10.2140\/pjm.1955.5.285","volume":"5","author":"A. Tarski","year":"1955","unstructured":"Tarski, A.: A lattice-theoretical fixpoint theorem and its applications. Pacific Journal of Mathematics\u00a05(2), 285\u2013309 (1955)","journal-title":"Pacific Journal of Mathematics"}],"container-title":["Lecture Notes in Computer Science","Programming Languages and Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-76637-7_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T11:02:01Z","timestamp":1558263721000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-76637-7_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540766360","9783540766377"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-76637-7_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007]]}}}