{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,17]],"date-time":"2026-07-17T02:27:15Z","timestamp":1784255235361,"version":"3.55.0"},"reference-count":7,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540558224","type":"print"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0084781","type":"book-chapter","created":{"date-parts":[[2006,11,24]],"date-time":"2006-11-24T13:12:14Z","timestamp":1164373934000},"page":"32-46","source":"Crossref","is-referenced-by-count":74,"title":["The problem of \u201cweak bisimulation up to\u201d"],"prefix":"10.1007","author":[{"given":"Davide","family":"Sangiorgi","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Robin","family":"Milner","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"4_CR1","first-page":"152","volume":"526","author":"S. Arun-Kumar","year":"1991","unstructured":"Arun-Kumar, S., and Hennessy, M., An efficiency preorder for Processes, Proceedings of Theoretical Aspects of Computer Science, Tokyo, (1991), LNCS vol. 526, pp 152\u2013175. To appear in Acta Informatica.","journal-title":"LNCS"},{"key":"4_CR2","unstructured":"Moller, F. The Edinburgh Concurrency Workbench (Version 6.0) Report No. LFCS-TN-34, Dept of Computer Science, University of Edinburgh."},{"key":"4_CR3","unstructured":"van Glabeek, R., and Weijland, W. P., Branching Time and Abstraction in Bisimulation Semantics, in Information Processing '89 (G.X. Ritter ed.), Elsevier Science (1989), pp 613\u2013618."},{"key":"4_CR4","unstructured":"Milner, R., A Calculus of Communicating Systems, Prentice Hall, 1989."},{"key":"4_CR5","unstructured":"Milner, R., Expansions \u2014 notes RM12, handwritten notes, Edinburgh, march 1990."},{"key":"4_CR6","volume-title":"LNCS vol. 104","author":"D.M. Park","year":"1981","unstructured":"Park, D.M., Concurrency on Automata and infinite sequences, in Conf. on Theoretical Computer Science, (P. Deussen ed.) Springer Verlag (1981) Berlin, LNCS vol. 104."},{"key":"4_CR7","unstructured":"Sangiorgi, D., Bisimulations up to context (provisory title), in preparation, Edinburgh."}],"container-title":["Lecture Notes in Computer Science","CONCUR '92"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0084781.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,9]],"date-time":"2020-12-09T22:07:18Z","timestamp":1607551638000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0084781"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540558224"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/bfb0084781","relation":{},"subject":[]}}