{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,13]],"date-time":"2026-05-13T09:16:11Z","timestamp":1778663771371,"version":"3.51.4"},"reference-count":35,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[2002,3,1]],"date-time":"2002-03-01T00:00:00Z","timestamp":1014940800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":4156,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2002,3]]},"DOI":"10.1016\/s0304-3975(01)00124-4","type":"journal-article","created":{"date-parts":[[2002,10,15]],"date-time":"2002-10-15T13:27:27Z","timestamp":1034688447000},"page":"1-68","source":"Crossref","is-referenced-by-count":38,"title":["Bisimulation indexes and their applications"],"prefix":"10.1016","volume":"275","author":[{"given":"Mingsheng","family":"Ying","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(01)00124-4_BIB1","first-page":"1","article-title":"Domain theory","volume":"Vol. 3","author":"Abramsky","year":"1994"},{"key":"10.1016\/S0304-3975(01)00124-4_BIB2","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1016\/0304-3975(94)90010-8","article-title":"A theory of timed automata","volume":"126","author":"Alur","year":"1994","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(01)00124-4_BIB3","series-title":"Finite Transition Systems","author":"Arnold","year":"1994"},{"key":"10.1016\/S0304-3975(01)00124-4_BIB4","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1016\/0304-3975(80)90045-6","article-title":"Metric interpretations of infinite trees and semantics of nondeterministic recursive programs","volume":"11","author":"Arnold","year":"1980","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(01)00124-4_BIB5","doi-asserted-by":"crossref","first-page":"142","DOI":"10.1007\/BF01898401","article-title":"Real-time process algebra","volume":"3","author":"Baeten","year":"1991","journal-title":"Formal Aspect Comput."},{"key":"10.1016\/S0304-3975(01)00124-4_BIB6","series-title":"Process Algebra","volume":"Vol. 18","author":"Baeten","year":"1990"},{"key":"10.1016\/S0304-3975(01)00124-4_BIB7","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1016\/0304-3975(85)90088-X","article-title":"Algebra of communicating processes with abstraction","volume":"33","author":"Bergstra","year":"1985","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(01)00124-4_BIB8","unstructured":"T. Bolognesi, On timed LOTOS, Technical Report 412, ISO\/TC 97\/SC 21\/WG 1, 1987."},{"key":"10.1016\/S0304-3975(01)00124-4_BIB9","series-title":"Theories and Experiences for Real-Time System Development","first-page":"205","article-title":"A timed full LOTOS with time\/action tree semantics","author":"Bolognesi","year":"1994"},{"key":"10.1016\/S0304-3975(01)00124-4_BIB10","doi-asserted-by":"crossref","first-page":"70","DOI":"10.1016\/S0019-9958(82)91250-5","article-title":"Processes and denotational semantics of concurrency","volume":"59","author":"de Bakker","year":"1982","journal-title":"Information and Control"},{"key":"10.1016\/S0304-3975(01)00124-4_BIB11","series-title":"General topology.","author":"Engelking","year":"1977"},{"key":"10.1016\/S0304-3975(01)00124-4_BIB12","series-title":"Program Verification","author":"Francez","year":"1992"},{"key":"10.1016\/S0304-3975(01)00124-4_BIB13","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1006\/inco.1995.1041","article-title":"A process algebra for timed systems","volume":"117","author":"Hennesy","year":"1995","journal-title":"Information and Computation"},{"key":"10.1016\/S0304-3975(01)00124-4_BIB14","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1016\/0304-3975(90)90016-B","article-title":"Contractions in comparing concurrency semantics","volume":"76","author":"Kok","year":"1990","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(01)00124-4_BIB15","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1006\/inco.1997.2623","article-title":"Time-abstract bisimulation","volume":"134","author":"Larsen","year":"1997","journal-title":"Information and Computation"},{"key":"10.1016\/S0304-3975(01)00124-4_BIB16","series-title":"A calculus of communicating systems","volume":"Vol. 92","author":"Milner","year":"1980"},{"key":"10.1016\/S0304-3975(01)00124-4_BIB17","series-title":"Communication and concurrency","author":"Milner","year":"1989"},{"key":"10.1016\/S0304-3975(01)00124-4_BIB18","series-title":"Concur\u201990, Theory of Concurrency: Unification and Extension","first-page":"401","article-title":"A temporal calculus of communicating systems","volume":"Vol. 458","author":"Moller","year":"1990"},{"key":"10.1016\/S0304-3975(01)00124-4_BIB19","unstructured":"M. Nivat, Infinite words, infinite trees, infinite computations, in: J.W. Bakker, J. van Leeuwen (Eds.), Foundations of Computer Science III, Part 2: Languages, Logic, Semantics, CWI Tracts 109, Amsterdam, 1979."},{"key":"10.1016\/S0304-3975(01)00124-4_BIB20","doi-asserted-by":"crossref","first-page":"224","DOI":"10.1007\/BF01211556","article-title":"TIC","volume":"5","author":"Quemada","year":"1993","journal-title":"Formal Aspect Comput."},{"key":"10.1016\/S0304-3975(01)00124-4_BIB21","series-title":"Theories and Experiences for Real-Time System Development","first-page":"239","article-title":"A timed LOTOS extension","author":"Quemada","year":"1994"},{"key":"10.1016\/S0304-3975(01)00124-4_BIB22","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1016\/0304-3975(88)90030-8","article-title":"A timed model for communicating sequential processes","volume":"58","author":"Reed","year":"1988","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(01)00124-4_BIB23","unstructured":"J.J.M.M. Rutten, Universal coalgebra: a theory of systems, Report CS-R9652, CWI, 1996."},{"key":"10.1016\/S0304-3975(01)00124-4_BIB24","first-page":"1","article-title":"Relators and metric bisimulations, CMCS\u201998","volume":"11","author":"Rutten","year":"1998","journal-title":"Electro. Notes in Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(01)00124-4_BIB25","series-title":"Lectures on a Mathematical Theory of Computation, Monograph PRG-19","author":"Scott","year":"1980"},{"key":"10.1016\/S0304-3975(01)00124-4_BIB26","series-title":"Proc. 21th Internat. Colloq. on Automata, Languages, and Programming, Jerusalem","first-page":"376","article-title":"Generalizing finiteness conditions of labelled transition systems","volume":"Vol. 820","author":"van Breugel","year":"1994"},{"key":"10.1016\/S0304-3975(01)00124-4_BIB27","doi-asserted-by":"crossref","unstructured":"F. van Breugel, A theory of metric labelled transition systems, Report SOCS-95.6, McGill University, Montreal, October 1995; also in: S. Andima, B. Flagg, J. Itzkowitz, Y.R. Kopperman, P. Misra (Eds.), Papers on General Topology and Applications, 11th Summer Conf. at the University of Southern Maine, Annals of the New York Academy of Sciences 806, 1995, pp. 69\u201387.","DOI":"10.1111\/j.1749-6632.1996.tb49160.x"},{"key":"10.1016\/S0304-3975(01)00124-4_BIB28","series-title":"Comparative Metric Semantics of Programming Languages: Nondeterminism and Recursion","author":"van Breugel","year":"1998"},{"key":"10.1016\/S0304-3975(01)00124-4_BIB29","series-title":"Proc. CONCUR\u201990, Amsterdam, Netherlands","first-page":"502","article-title":"Real-time behaviour of asynchronous agents","volume":"Vol. 458","author":"Wang","year":"1990"},{"key":"10.1016\/S0304-3975(01)00124-4_BIB30","unstructured":"Y. Wang, A Calculus of real time systems, Ph.D. Thesis, Chalmers University, 1991."},{"key":"10.1016\/S0304-3975(01)00124-4_BIB31","series-title":"Automata, Languages, and Programming 18","first-page":"217","article-title":"CCS+time=an interleaving model for real time systems","volume":"Vol. 510","author":"Wang","year":"1991"},{"key":"10.1016\/S0304-3975(01)00124-4_BIB32","series-title":"Handbook of Logic in Computer Science, Vol. 4: Semantic Modelling","first-page":"1","article-title":"Models for concurrency","author":"Winskel","year":"1995"},{"key":"10.1016\/S0304-3975(01)00124-4_BIB33","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1016\/S0304-3975(98)00187-X","article-title":"A shorter proof to uniqueness of solutions of equations","volume":"216","author":"Ying","year":"1999","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(01)00124-4_BIB34","doi-asserted-by":"crossref","first-page":"328","DOI":"10.1007\/BF02948735","article-title":"Topology in process calculus (I)","volume":"14","author":"Ying","year":"1999","journal-title":"J. Comput. Sci. Technol."},{"key":"10.1016\/S0304-3975(01)00124-4_BIB35","unstructured":"M.S. Ying, Additive models of probabilistic processes, submitted."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397501001244?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397501001244?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,1,8]],"date-time":"2020-01-08T07:56:06Z","timestamp":1578470166000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397501001244"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,3]]},"references-count":35,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2002,3]]}},"alternative-id":["S0304397501001244"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(01)00124-4","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2002,3]]}}}