{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,8,12]],"date-time":"2022-08-12T02:28:17Z","timestamp":1660271297720},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2004,5,1]],"date-time":"2004-05-01T00:00:00Z","timestamp":1083369600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J. Comput. Sci. & Technol."],"published-print":{"date-parts":[[2004,5]]},"DOI":"10.1007\/bf02944905","type":"journal-article","created":{"date-parts":[[2008,9,7]],"date-time":"2008-09-07T12:15:00Z","timestamp":1220789700000},"page":"352-363","source":"Crossref","is-referenced-by-count":4,"title":["Towards a theory of bisimulation for the higher-order process calculi"],"prefix":"10.1007","volume":"19","author":[{"given":"Yong-Jian","family":"Li","sequence":"first","affiliation":[]},{"given":"Xin-Xin","family":"Liu","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"BF02944905_CR1","doi-asserted-by":"crossref","unstructured":"Milner R. Caculus of communicating systems.LNCS 92, Springer Verlag, 1980.","DOI":"10.1007\/3-540-10235-3"},{"key":"BF02944905_CR2","unstructured":"Park D. Concurrency and automata on infinite sequences.LNCS 104, Springer Verlag, 1981."},{"key":"BF02944905_CR3","unstructured":"Milner R. Communication and Concurrency. Prentice Hall, 1989."},{"issue":"1","key":"BF02944905_CR4","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0890-5401(92)90008-4","volume":"100","author":"R Milner","year":"1992","unstructured":"Milner R, Parrow J, Walker D. A calculus of mobile processes. (Parts I and II).Information and Computation, 1992, 100(1): 1\u201340.","journal-title":"Information and Computation"},{"key":"BF02944905_CR5","volume-title":"Expressing mobility in process algebras: First-order and higher-order paradigms","author":"D Sangiorgi","year":"1992","unstructured":"Sangiorgi D. Expressing mobility in process algebras: First-order and higher-order paradigms, [Dissertation]. University of Edinburgh, Edinburgh, U.K., 1992."},{"key":"BF02944905_CR6","doi-asserted-by":"crossref","unstructured":"Thomsen B. Calculus for high order communicating systems [Dissertation]. Department of Computing, Imperial College, 1990.","DOI":"10.1145\/75277.75290"},{"key":"BF02944905_CR7","doi-asserted-by":"crossref","unstructured":"Astesiano E, Giovini A. Generalized bisimulation in relational specifications. LNCS 294, Springer-Verlage, pp. 207\u2013266.","DOI":"10.1007\/BFb0035846"},{"key":"BF02944905_CR8","series-title":"LNCS","first-page":"149","volume-title":"Towards a lambda calculus for concurrent and communicating systems","author":"G Boudol","year":"1989","unstructured":"Boudol G. Towards a lambda calculus for concurrent and communicating systems.LNCS 351, Springer-Verlag, Barcelona, Spain, March 13\u201317, 1989, pp. 149\u2013161."},{"key":"BF02944905_CR9","series-title":"LNCS","first-page":"269","volume-title":"Proc. Concur'98","author":"Peter Sewell","year":"1998","unstructured":"Peter Sewell. From rewrite rules to bisimulation congruences. InProc. Concur'98, LNCS 1466, Springer Verlag, Nice, France, 1998, pp. 269\u2013284."},{"key":"BF02944905_CR10","unstructured":"Milner R. The polyadic \u03c0-calculus: A tutorial. InProc. the International Summer School on Logic and Algebra of Specification, 1991."},{"key":"BF02944905_CR11","unstructured":"Sangiorgi D, Walker D.The \u03c0-Calculus: A Theory of Mobile Processes. Cambridge University Press, 2001, pp. 42\u201343."},{"issue":"2","key":"BF02944905_CR12","doi-asserted-by":"crossref","first-page":"437","DOI":"10.1016\/0304-3975(95)00074-7","volume":"152","author":"Kohei Honda","year":"1995","unstructured":"Kohei Honda, Nobuko Yoshida. On reduction-based process semantics.Theoretical Computer Science, 1995, 152(2): 437\u2013486.","journal-title":"Theoretical Computer Science"},{"key":"BF02944905_CR13","series-title":"LNCS","first-page":"844","volume-title":"Proc. International Colloquium on Algorithms, Language and Programming","author":"C Fournet","year":"1998","unstructured":"Fournet C, Gonthier G. A hierarchy of equivalence for asynchronous calculi. In:Proc. International Colloquium on Algorithms, Language and Programming, LNCS 1443, Springer-Verlag, Aalborg, Denmark, July 13\u201317, 1998, pp. 844\u2013855."},{"issue":"2","key":"BF02944905_CR14","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1006\/inco.1996.0096","volume":"131","author":"D Sangiorgi","year":"1996","unstructured":"Sangiorgi D. Bisimulation for higher-order process calculi.Information and Computation, 1996, 131(2): 141\u2013178.","journal-title":"Information and Computation"},{"key":"BF02944905_CR15","unstructured":"Liu Xinxin, Li Yongjian. Bisimulation for higher-order \u03c0-calculus. InProc. the Third Asian Workshop on Programming Language and Systems (Aplas'03), 2002."},{"key":"BF02944905_CR16","first-page":"311","volume-title":"Proc. Logic in Computer Science","author":"Alan Jeffery","year":"2000","unstructured":"Alan Jeffery, Julian Rathke. A theory of bisimulation for a fragment of concurrent CML with local names. InProc. Logic in Computer Science, IEEE CS Press, Santa Barbara, California, June 26\u201328, 2000, pp. 311\u2013321."},{"key":"BF02944905_CR17","first-page":"140","volume-title":"Proc. Foundations of Software Science and Computation Structures (FossaCs), ETAPS'98,LNCS 1378","author":"Luca Cardelli","year":"1998","unstructured":"Luca Cardelli, Andrew D Gordon. Mobile ambients. In:Proc. Foundations of Software Science and Computation Structures (FossaCs), ETAPS'98,LNCS 1378, Pertugal, Springer-Verlag, 1998 pp. 140\u2013155."},{"key":"BF02944905_CR18","doi-asserted-by":"crossref","unstructured":"Cedric Fournet, Georeges Gonthier. The reflexive cham and the join-calculus. InProc. the 23rd Annual ACM Symposium on Principles of Programming Languages, 1996, pp. 372\u2013385.","DOI":"10.1145\/237721.237805"}],"container-title":["Journal of Computer Science and Technology"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02944905.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02944905\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02944905","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,21]],"date-time":"2019-05-21T16:15:24Z","timestamp":1558455324000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02944905"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,5]]},"references-count":18,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2004,5]]}},"alternative-id":["BF02944905"],"URL":"https:\/\/doi.org\/10.1007\/bf02944905","relation":{},"ISSN":["1000-9000","1860-4749"],"issn-type":[{"value":"1000-9000","type":"print"},{"value":"1860-4749","type":"electronic"}],"subject":[],"published":{"date-parts":[[2004,5]]}}}