{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:28:52Z","timestamp":1725542932824},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540373766"},{"type":"electronic","value":"9783540373773"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11817949_26","type":"book-chapter","created":{"date-parts":[[2006,8,2]],"date-time":"2006-08-02T19:59:29Z","timestamp":1154548769000},"page":"390-405","source":"Crossref","is-referenced-by-count":6,"title":["Weak Bisimulation Up to Elaboration"],"prefix":"10.1007","author":[{"given":"Damien","family":"Pous","sequence":"first","affiliation":[]}],"member":"297","reference":[{"issue":"9","key":"26_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":"26_CR2","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1007\/978-1-4471-3078-9_4","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, pp. 55\u201368. Springer, Heidelberg (1995)"},{"key":"26_CR3","unstructured":"Fournet, C.: The Join-Calculus: a Calculus for Distributed Mobile Programming. PhD thesis, Ecole Polytechnique (1998)"},{"key":"26_CR4","doi-asserted-by":"publisher","first-page":"1151","DOI":"10.1016\/B978-044482830-9\/50035-7","volume-title":"Handbook of Process Algebra","author":"J. Groote","year":"2001","unstructured":"Groote, J., Reniers, M.: Algebraic Process Verification. In: Handbook of Process Algebra, pp. 1151\u20131208. Elsevier, Amsterdam (2001)"},{"key":"26_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/11417019_2","volume-title":"Coordination Models and Languages","author":"D. Hirschkoff","year":"2005","unstructured":"Hirschkoff, D., Pous, D., Sangiorgi, D.: A Correct Abstract Machine for Safe Ambients. In: Jacquet, J.-M., Picco, G.P. (eds.) COORDINATION 2005. LNCS, vol.\u00a03454, pp. 17\u201332. Springer, Heidelberg (2005)"},{"issue":"1","key":"26_CR6","doi-asserted-by":"crossref","first-page":"171","DOI":"10.3233\/FI-1992-16206","volume":"16","author":"U. Montanari","year":"1992","unstructured":"Montanari, U., Sassone, V.: Dynamic Congruence vs. Progressing Bisimulation for CCS. Fundamenta Informaticae\u00a016(1), 171\u2013199 (1992)","journal-title":"Fundamenta Informaticae"},{"key":"26_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"730","DOI":"10.1007\/11523468_59","volume-title":"Automata, Languages and Programming","author":"D. Pous","year":"2005","unstructured":"Pous, D.: Up-to Techniques for Weak Bisimulation. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol.\u00a03580, pp. 730\u2013741. Springer, Heidelberg (2005)"},{"key":"26_CR8","doi-asserted-by":"crossref","unstructured":"Pous, D.: Weak Bisimulation up to Elaboration. In: Long version of this paper, with full proofs (2006), Available from: http:\/\/perso.ens-lyon.fr\/damien.pous\/upto","DOI":"10.1007\/11817949_26"},{"key":"26_CR9","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 Mathematical Structures in Computer Science\u00a08, 447\u2013479 (1998)","journal-title":"Journal of Mathematical Structures in Computer Science"},{"key":"26_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1007\/BFb0084781","volume-title":"CONCUR \u201992","author":"D. Sangiorgi","year":"1992","unstructured":"Sangiorgi, D., Milner, R.: The problem of Weak Bisimulation up to. In: Cleaveland, W.R. (ed.) CONCUR 1992. LNCS, vol.\u00a0630, pp. 32\u201346. Springer, Heidelberg (1992)"},{"key":"26_CR11","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)"}],"container-title":["Lecture Notes in Computer Science","CONCUR 2006 \u2013 Concurrency Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11817949_26.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,7,31]],"date-time":"2021-07-31T02:03:34Z","timestamp":1627697014000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11817949_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540373766","9783540373773"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/11817949_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}