{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,13]],"date-time":"2026-05-13T09:12:00Z","timestamp":1778663520419,"version":"3.51.4"},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2013,11,1]],"date-time":"2013-11-01T00:00:00Z","timestamp":1383264000000},"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":[[2013,11]]},"DOI":"10.1007\/s11390-013-1400-y","type":"journal-article","created":{"date-parts":[[2013,11,14]],"date-time":"2013-11-14T05:46:44Z","timestamp":1384408004000},"page":"1097-1105","source":"Crossref","is-referenced-by-count":7,"title":["The Infinite Evolution Mechanism of \u03f5-Bisimilarity"],"prefix":"10.1007","volume":"28","author":[{"given":"Yan-Fang","family":"Ma","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Min","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2013,11,8]]},"reference":[{"key":"1400_CR1","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511624193","volume-title":"Process Algebra","author":"JC Baeten","year":"1990","unstructured":"Baeten J C, Weijland W P. Process Algebra. New York, USA: Cambridge University Press, 1990."},{"issue":"8","key":"1400_CR2","doi-asserted-by":"crossref","first-page":"666","DOI":"10.1145\/359576.359585","volume":"21","author":"CAR Hoare","year":"1978","unstructured":"Hoare C A R. Communicating sequential processes. Communications of the ACM, 1978, 21(8): 666\u2013677.","journal-title":"Communications of the ACM"},{"key":"1400_CR3","volume-title":"Communicating Sequential Processes","author":"CAR Hoare","year":"1985","unstructured":"Hoare C A R. Communicating Sequential Processes. New Jersey, USA: Prentice Hall, 1985."},{"key":"1400_CR4","volume-title":"Communication and Concurrency","author":"R Milner","year":"1989","unstructured":"Milner R. Communication and Concurrency. New Jersey, USA: Prentice-Hall, 1989."},{"key":"1400_CR5","doi-asserted-by":"crossref","unstructured":"Ying M S, Wirshing M. Approximate bisimilarity. In Proc. the 8th International Conference of Algebraic Methodology and Software Technology, May 2000, pp.309-322.","DOI":"10.1007\/3-540-45499-3_23"},{"issue":"1\/2","key":"1400_CR6","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0304-3975(01)00124-4","volume":"275","author":"MS Ying","year":"2002","unstructured":"Ying M S. Bisimulation indexes and their applications. Theoretical Computer Science, 2002, 275(1\/2): 1\u201368.","journal-title":"Theoretical Computer Science"},{"key":"1400_CR7","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4613-0123-3","volume-title":"Topology in Process Calculus: Approximate Correctness and Infinite Evolution of Concurrency Programs","author":"MS Ying","year":"2001","unstructured":"Ying M S. Topology in Process Calculus: Approximate Correctness and Infinite Evolution of Concurrency Programs. New York: Springer-Verlag, 2001."},{"key":"1400_CR8","doi-asserted-by":"crossref","unstructured":"Segala R, Lynch N. Probabilistic simulations for probabilistic processes. In Proc. the 5th International Conference on Concurrency Theory, August 1994, pp.481-496.","DOI":"10.1007\/978-3-540-48654-1_35"},{"key":"1400_CR9","doi-asserted-by":"crossref","unstructured":"Deng Y X, van Glabbeek R, Hennessy M, Morgan C. Testing finitary probabilistic processes. In Proc. the 20th International Conference on Concurrency Theory, September 2009, pp.274-288.","DOI":"10.1007\/978-3-642-04081-8_19"},{"key":"1400_CR10","doi-asserted-by":"crossref","unstructured":"Song L, Deng Y X,Cai X J. Towards automatic measurement of probabilistic processes. In Proc. the 7th International Conference on Quality Software, Oct. 2007, pp.50-59.","DOI":"10.1109\/QSIC.2007.4385480"},{"issue":"1","key":"1400_CR11","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1006\/inco.1995.1123","volume":"121","author":"RJ Glabbeek van","year":"1995","unstructured":"van Glabbeek R J, Smolka S A, Steffen B. Reactive, generative, and stratified models of probabilistic processes. Infromation and Computation, 1995, 121(1): 59\u201380.","journal-title":"Infromation and Computation"},{"issue":"1","key":"1400_CR12","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0890-5401(91)90030-6","volume":"94","author":"KG Larsen","year":"1991","unstructured":"Larsen K G, Skou A. Bisimulation through probabilistic testing. Information and Computation, 1991, 94(1): 1\u201328.","journal-title":"Information and Computation"},{"key":"1400_CR13","doi-asserted-by":"crossref","unstructured":"Larsen K G, Skou A. Compositional verification of probabilistic processes. In Proc. the 3rd International Conference on Concurrency Theory, August 1992, pp.456-471.","DOI":"10.1007\/BFb0084809"},{"key":"1400_CR14","unstructured":"Giacalone A, Jou C C, Smolka S A. Algebraic reasoning for probabilistic concurrent systems. In Proc. IFIP TC2 Working Conference on Programming Concepts and Methods, April 1990, pp.443-458."},{"key":"1400_CR15","doi-asserted-by":"crossref","unstructured":"Smolka S A, Steffen B. Priority as extremal probability. In Proc. Theories of Concurrency: Unification and Extension, August 1990, pp.456-466.","DOI":"10.1007\/BFb0039077"},{"issue":"3","key":"1400_CR16","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1016\/0304-3975(83)90114-7","volume":"25","author":"R Milner","year":"1983","unstructured":"Milner R. Calculi for synchrony and asynchrony. Theoretical Computer Science, 1983, 25(3): 267\u2013310.","journal-title":"Theoretical Computer Science"},{"issue":"1\/2","key":"1400_CR17","doi-asserted-by":"crossref","first-page":"481","DOI":"10.1016\/S0304-3975(01)00294-8","volume":"275","author":"MS Ying","year":"2002","unstructured":"Ying M S. Additive models of probabilistic processes. Theoretical Computer Science, 2002, 275(1\/2): 481\u2013519.","journal-title":"Theoretical Computer Science"},{"key":"1400_CR18","doi-asserted-by":"crossref","unstructured":"Ma Y F, Zhang M, Chen L. The infinite evolution mechanism of \u03f5-bisimulation. In Proc. the 3rd International Conference on Quantitative Logic and Soft Computing, May 2012, pp.252-259.","DOI":"10.1142\/9789814401531_0036"},{"key":"1400_CR19","unstructured":"Engelking R. General Topology. Polish Science, 1977."},{"key":"1400_CR20","unstructured":"Kelly J L. General Topology. Springer-Verlag, 1975."}],"container-title":["Journal of Computer Science and Technology"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11390-013-1400-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11390-013-1400-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11390-013-1400-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,1]],"date-time":"2019-08-01T20:07:42Z","timestamp":1564690062000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11390-013-1400-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,11]]},"references-count":20,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2013,11]]}},"alternative-id":["1400"],"URL":"https:\/\/doi.org\/10.1007\/s11390-013-1400-y","relation":{},"ISSN":["1000-9000","1860-4749"],"issn-type":[{"value":"1000-9000","type":"print"},{"value":"1860-4749","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,11]]}}}