{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T10:16:48Z","timestamp":1648721808853},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2011,7,11]],"date-time":"2011-07-11T00:00:00Z","timestamp":1310342400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Front. Comput. Sci. China"],"published-print":{"date-parts":[[2011,12]]},"DOI":"10.1007\/s11704-011-0140-9","type":"journal-article","created":{"date-parts":[[2011,7,10]],"date-time":"2011-07-10T22:38:34Z","timestamp":1310337514000},"page":"454-471","source":"Crossref","is-referenced-by-count":1,"title":["Two-thirds simulation indexes and modal logic characterization"],"prefix":"10.1007","volume":"5","author":[{"given":"Yanfang","family":"Ma","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Min","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yixiang","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Liang","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2011,7,11]]},"reference":[{"key":"140_CR1","volume-title":"Communication Sequential Processes","author":"C. A. R. Hoare","year":"1985","unstructured":"Hoare C A R. Communication Sequential Processes. Englewood Cliffs: Prentice Hall, 1985"},{"issue":"3","key":"140_CR2","doi-asserted-by":"crossref","first-page":"560","DOI":"10.1145\/828.833","volume":"31","author":"S. D. Brookes","year":"1984","unstructured":"Brookes S D, Hoare C A R, Roscoe A W. A theory of communicating sequential processes. Journal of the ACM, 1984, 31(3): 560\u2013599","journal-title":"Journal of the ACM"},{"issue":"1","key":"140_CR3","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1007\/BF00268075","volume":"23","author":"E. R. Olderog","year":"1986","unstructured":"Olderog E R, Hoare C A R. Specification-oriented semantics for communicating processes. Acta Informatica, 1986, 23(1): 9\u201366","journal-title":"Acta Informatica"},{"key":"140_CR4","doi-asserted-by":"crossref","unstructured":"Park D. Concurrency and automata on infinite sequences. In: Proceedings of 5th GI-Conference on Theoretical Computer Science. 1981, 167\u2013183","DOI":"10.1007\/BFb0017309"},{"issue":"1","key":"140_CR5","doi-asserted-by":"crossref","first-page":"232","DOI":"10.1145\/200836.200876","volume":"42","author":"B. Bloom","year":"1995","unstructured":"Bloom B, Istrail S, Meyer A R. Bisimulation can\u2019t be traced. Journal of the ACM, 1995, 42(1): 232\u2013268","journal-title":"Journal of the ACM"},{"key":"140_CR6","first-page":"260","volume":"92","author":"R. Milner","year":"1980","unstructured":"Milner R. A calculus of communicating systems. Lecture Notes in Computer Science, 1980, 92: 260\u2013278","journal-title":"Lecture Notes in Computer Science"},{"issue":"1","key":"140_CR7","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0890-5401(91)90030-6","volume":"94","author":"K. G. Larsen","year":"1991","unstructured":"Larsen K G, Skou A. Bisimulation through probabilistic testing. Journal of Information and Computation, 1991, 94(1): 1\u201328","journal-title":"Journal of Information and Computation"},{"key":"140_CR8","unstructured":"Glabbeek R J. The linear time-branching time spectrum i-the semantics of concrete, sequential processes. http:\/\/theory.stanford.edu\/rvg"},{"key":"140_CR9","volume-title":"Equating bisimulation with refinement","author":"J. F. He","year":"2003","unstructured":"He J F, Hoare T. Equating bisimulation with refinement. Technical report, UNU-IIST, Macau, 2003"},{"key":"140_CR10","unstructured":"Ying M S, Wirshing M. Approximate bisimilarity and its application. Technical report, Institutfur Informatik, Ludwig-Maximilians-Universitat Munchen, 1999"},{"issue":"1\u20132","key":"140_CR11","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0304-3975(01)00124-4","volume":"275","author":"M. S. Ying","year":"2002","unstructured":"Ying M S. Bisimulation indexes and their applications. Theoretical Computer Science, 2002, 275(1\u20132): 1\u201368","journal-title":"Theoretical Computer Science"},{"key":"140_CR12","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":"M. S. Ying","year":"2001","unstructured":"Ying M S. Topology in Process Calculus: Approximate Correctness and Infinite Evolution of Concurrency Programs. New York: Springer-Verlag, 2001"},{"issue":"3","key":"140_CR13","doi-asserted-by":"crossref","first-page":"439","DOI":"10.1016\/0022-0000(84)90023-0","volume":"28","author":"R. Milner","year":"1984","unstructured":"Milner R. A complete inference system for a class of regular behaviours. Journal of Computer and System Sciences, 1984, 28(3): 439\u2013466","journal-title":"Journal of Computer and System Sciences"},{"issue":"1","key":"140_CR14","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1145\/2455.2460","volume":"32","author":"M. Hennessy","year":"1985","unstructured":"Hennessy M, Milner R. Algebraic laws for nondeterminism and concurrency. Journal of the ACM, 1985, 32(1): 137\u2013161","journal-title":"Journal of the ACM"},{"key":"140_CR15","volume-title":"Communication and Concurrency","author":"R. Milner","year":"1989","unstructured":"Milner R. Communication and Concurrency. New York: Prentice Hall, 1989"},{"key":"140_CR16","volume-title":"Communicating and Mobile Systems: the \u03c0-calculus","author":"R. Minler","year":"1999","unstructured":"Minler R. Communicating and Mobile Systems: the \u03c0-calculus. Cambridge: Cambridge University Press, 1999"},{"key":"140_CR17","unstructured":"Plotkin G D. A structural approach to operational semantics. Technical Report DAIMI FN-19, Computer Science Department, Aarhus University, 1981"},{"key":"140_CR18","volume-title":"General Topology","author":"R. Engelking","year":"1977","unstructured":"Engelking R. General Topology. Warszawa: Polish Scientific Publisher, 1977"},{"key":"140_CR19","unstructured":"Giacalone A, Jou C C, Smolka S A. Algebraic reasoning for probabilistic concurrent systems. In: Proceeding of Working Conference on Programming Concepts and Methods. 1990, 443\u2013458"},{"key":"140_CR20","unstructured":"Giacalone A, Jou C C, Smolka S A. Probabilistic in processes: an algebraic\/operational framework. Technical report, Department of Computer Science, SUNY at Stony Brook, 1988"},{"key":"140_CR21","doi-asserted-by":"crossref","unstructured":"Song L, Deng Y X, Cai X. Towards automatic measurement of probabilistic processes. In: Proceedings of the 7th International Conference on Quality Software. 2007, 50\u201359","DOI":"10.1109\/QSIC.2007.4385480"},{"key":"140_CR22","doi-asserted-by":"crossref","unstructured":"Deng Y X, Chothia T, Palamidessi C, Pang J. Metrics for actionlabelled quantitative transition systems. In: Proceedings of the 3rd Workshop on Quantitative Aspects of Programming Languages. 2005, 79\u201396","DOI":"10.1016\/j.entcs.2005.10.033"},{"issue":"1","key":"140_CR23","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1016\/j.datak.2007.06.010","volume":"64","author":"A. K. Alves de Medeiros","year":"2008","unstructured":"Alves de Medeiros A K, van der Aalst W M P, Wejiters A J M M. Quantifying process equivalence based on observed behavior. Data & Knowledge Engineering, 2008, 64(1): 55\u201374","journal-title":"Data & Knowledge Engineering"},{"issue":"1","key":"140_CR24","first-page":"85","volume":"1","author":"J. J. Zhang","year":"2007","unstructured":"Zhang J J, Zhu Z H. A modal characterization of \u03bb-bisimilarity. International Journal of Software Informatics, 2007, 1(1): 85\u201399","journal-title":"International Journal of Software Informatics"}],"container-title":["Frontiers of Computer Science in China"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11704-011-0140-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11704-011-0140-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11704-011-0140-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,12]],"date-time":"2019-06-12T21:57:25Z","timestamp":1560376645000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11704-011-0140-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,7,11]]},"references-count":24,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2011,12]]}},"alternative-id":["140"],"URL":"https:\/\/doi.org\/10.1007\/s11704-011-0140-9","relation":{},"ISSN":["1673-7350","1673-7466"],"issn-type":[{"value":"1673-7350","type":"print"},{"value":"1673-7466","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,7,11]]}}}