{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,6,1]],"date-time":"2022-06-01T19:26:04Z","timestamp":1654111564813},"reference-count":23,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[2001,3,1]],"date-time":"2001-03-01T00:00:00Z","timestamp":983404800000},"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":4521,"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":[[2001,3]]},"DOI":"10.1016\/s0304-3975(99)00300-x","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T16:01:38Z","timestamp":1027612898000},"page":"337-361","source":"Crossref","is-referenced-by-count":12,"title":["Algebraic characterizations of trace and decorated trace equivalences over tree-like structures"],"prefix":"10.1016","volume":"254","author":[{"given":"Xiao","family":"Jun Chen","sequence":"first","affiliation":[]},{"given":"Rocco De","family":"Nicola","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(99)00300-X_BIB1","doi-asserted-by":"crossref","first-page":"198","DOI":"10.1016\/0890-5401(89)90054-0","article-title":"An algebraic characterization of transition system equivalences","volume":"82","author":"Arnold","year":"1989","journal-title":"Inform. and Comput."},{"key":"10.1016\/S0304-3975(99)00300-X_BIB2","doi-asserted-by":"crossref","unstructured":"A. Arnold, A. Dicky, Equivalences and preorders of transition systems, MFCS\u201993, Lecture Notes in Computer Science, vol. 711, 1993, pp. 20\u201331.","DOI":"10.1007\/3-540-57182-5_2"},{"key":"10.1016\/S0304-3975(99)00300-X_BIB3","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1016\/0304-3975(95)00141-7","article-title":"An algebraic characterization of observational equivalence","volume":"156","author":"Arnold","year":"1996","journal-title":"Theoret. Comput. Sci."},{"issue":"6","key":"10.1016\/S0304-3975(99)00300-X_BIB4","doi-asserted-by":"crossref","first-page":"498","DOI":"10.1093\/comjnl\/30.6.498","article-title":"Ready-trace semantics for concrete process algebra with the priority operator","volume":"30","author":"Baeten","year":"1987","journal-title":"The Comput. J."},{"issue":"3","key":"10.1016\/S0304-3975(99)00300-X_BIB5","doi-asserted-by":"crossref","first-page":"560","DOI":"10.1145\/828.833","article-title":"A theory of communicating sequential processes","volume":"31","author":"Brookes","year":"1984","journal-title":"J. ACM"},{"key":"10.1016\/S0304-3975(99)00300-X_BIB6","doi-asserted-by":"crossref","first-page":"210","DOI":"10.1016\/0022-0000(87)90025-0","article-title":"Bisimulations and abstraction homomorphisms","volume":"34","author":"Castellani","year":"1987","journal-title":"J. Comput. System Sci"},{"key":"10.1016\/S0304-3975(99)00300-X_BIB7","unstructured":"I. Castellani, P. Franceschi, U. Montanari, Labelled event structures: A model for observable concurrency, in: D. Bjorner (Ed.), Formal Description of Programming Concepts II, North-Holland, Amsterdam, 1983, pp. 383\u2013400."},{"key":"10.1016\/S0304-3975(99)00300-X_BIB8","doi-asserted-by":"crossref","unstructured":"E.M. Clarke, O. Grumberg, D.E. Long, Model checking and abstraction, in: Symp. on Principles of Programming Languages (POPL 92), ACM, October 1992.","DOI":"10.1145\/143165.143235"},{"key":"10.1016\/S0304-3975(99)00300-X_BIB9","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1007\/BF02915446","article-title":"A distributed operational semantics for CCS based on condition\/event systems","volume":"26","author":"Degano","year":"1988","journal-title":"Acta Informatica"},{"key":"10.1016\/S0304-3975(99)00300-X_BIB10","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1007\/BF00264365","article-title":"Extensional equivalences for transition systems","volume":"24","author":"De Nicola","year":"1987","journal-title":"Acta Informatica"},{"key":"10.1016\/S0304-3975(99)00300-X_BIB11","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1016\/0304-3975(84)90113-0","article-title":"Testing equivalences for processes","volume":"34","author":"De Nicola","year":"1984","journal-title":"Theoret. Comput. Sci."},{"issue":"2","key":"10.1016\/S0304-3975(99)00300-X_BIB12","doi-asserted-by":"crossref","first-page":"458","DOI":"10.1145\/201019.201032","article-title":"Three logics for branching bisimulation","volume":"42","author":"De Nicola","year":"1995","journal-title":"Journal of ACM"},{"key":"10.1016\/S0304-3975(99)00300-X_BIB13","first-page":"278","volume":"vol. 458","author":"van Glabbeek","year":"1990"},{"key":"10.1016\/S0304-3975(99)00300-X_BIB14","first-page":"66","volume":"vol. 715","author":"van Glabbeek","year":"1993"},{"issue":"4","key":"10.1016\/S0304-3975(99)00300-X_BIB15","doi-asserted-by":"crossref","first-page":"896","DOI":"10.1145\/4221.4249","article-title":"Acceptance trees","volume":"32","author":"Hennessy","year":"1985","journal-title":"J. ACM"},{"key":"10.1016\/S0304-3975(99)00300-X_BIB16","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1016\/S0019-9958(85)80025-5","article-title":"The power of the future perfect in program logics","volume":"67","author":"Hennessy","year":"1985","journal-title":"Inform. and Control"},{"key":"10.1016\/S0304-3975(99)00300-X_BIB17","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1016\/0167-6423(81)90005-8","article-title":"A calculus of total correctness for communicating processes","volume":"1","author":"Hoare","year":"1981","journal-title":"Sci. Comput. Programming"},{"key":"10.1016\/S0304-3975(99)00300-X_BIB18","unstructured":"C.A.R. Hoare, Communicating Sequential Processes, Prentice-Hall, Englewood Cliffs, NJ, 1985."},{"key":"10.1016\/S0304-3975(99)00300-X_BIB19","series-title":"Communication and Concurrency","author":"Milner","year":"1989"},{"key":"10.1016\/S0304-3975(99)00300-X_BIB20","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1007\/BF00268075","article-title":"Specification-oriented semantics for communicating processes","volume":"23","author":"Olderog","year":"1986","journal-title":"Acta Informatica"},{"key":"10.1016\/S0304-3975(99)00300-X_BIB21","first-page":"167","volume":"vol. 104","author":"Park","year":"1981"},{"key":"10.1016\/S0304-3975(99)00300-X_BIB22","first-page":"15","volume":"vol. 194","author":"Pnueli","year":"1985"},{"key":"10.1016\/S0304-3975(99)00300-X_BIB23","doi-asserted-by":"crossref","unstructured":"W.C. Rounds, S.D. Brookes, Possible futures, acceptances, refusals and communicating processes, in: Proc. 22nd Annual Symp. on Foundations of Computer Science, IEEE New York, Nashville, USA, 1981, pp. 140\u2013149.","DOI":"10.1109\/SFCS.1981.36"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S030439759900300X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S030439759900300X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,21]],"date-time":"2019-04-21T20:55:25Z","timestamp":1555880125000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S030439759900300X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,3]]},"references-count":23,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2001,3]]}},"alternative-id":["S030439759900300X"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(99)00300-x","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2001,3]]}}}