{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T00:06:19Z","timestamp":1648685179509},"reference-count":21,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1993,8,1]],"date-time":"1993-08-01T00:00:00Z","timestamp":744163200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Sciences"],"published-print":{"date-parts":[[1993,8]]},"DOI":"10.1016\/0020-0255(93)90031-g","type":"journal-article","created":{"date-parts":[[2003,6,30]],"date-time":"2003-06-30T17:28:37Z","timestamp":1056994117000},"page":"105-121","source":"Crossref","is-referenced-by-count":1,"title":["On deciding trace equivalences for processes"],"prefix":"10.1016","volume":"72","author":[{"given":"Dung T.","family":"Huynh","sequence":"first","affiliation":[]},{"given":"Tian","family":"Lu","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0020-0255(93)90031-G_BIB1","series-title":"Proceedings of PARLE Conference Springer","first-page":"82","article-title":"Decidability of bisimulation equivalence for processes generating context-free languages","author":"Baeten","year":"1987"},{"key":"10.1016\/0020-0255(93)90031-G_BIB2","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1016\/S0019-9958(84)80025-X","article-title":"Process algebra for synchronous communication","volume":"60","author":"Bergstra","year":"1984","journal-title":"Inform. Control"},{"key":"10.1016\/0020-0255(93)90031-G_BIB3","doi-asserted-by":"crossref","first-page":"1134","DOI":"10.1137\/0217073","article-title":"Readies and failures in the algebra of communicating processes","volume":"17","author":"Bergstra","year":"1988","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0020-0255(93)90031-G_BIB4","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. Assoc. Comput. Math."},{"key":"10.1016\/0020-0255(93)90031-G_BIB5","series-title":"Proceedings of the 15th Colloquium on Trees in Algebra and Programming, Springer","first-page":"103","article-title":"A unified approach for showing language containment and equivalence between various types of \u03c9-automata","author":"Clarke","year":"1990"},{"key":"10.1016\/0020-0255(93)90031-G_BIB6","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1016\/S0019-9958(85)80041-3","article-title":"A taxonomy of problems with fast parallel algorithms","volume":"64","author":"Cook","year":"1985","journal-title":"Inform. Control"},{"key":"10.1016\/0020-0255(93)90031-G_BIB7","series-title":"Computers and intractability: A guide to the theory of NP-completeness","author":"Garey","year":"1979"},{"key":"10.1016\/0020-0255(93)90031-G_BIB8","series-title":"Introduction to formal language theory","author":"Harrison","year":"1978"},{"key":"10.1016\/0020-0255(93)90031-G_BIB9","series-title":"Communicating sequential processes","author":"Hoare","year":"1985"},{"key":"10.1016\/0020-0255(93)90031-G_BIB10","series-title":"Current Trends in Concurrency: Overview and Tutorials","first-page":"266","article-title":"Infinitary languages: Basic theory and applications to concurrent systems","author":"Hoogeboom","year":"1986"},{"key":"10.1016\/0020-0255(93)90031-G_BIB11","series-title":"Introduction to automata theory, languages and computation","author":"Hopcroft","year":"1979"},{"key":"10.1016\/0020-0255(93)90031-G_BIB12","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1016\/0304-3975(84)90092-6","article-title":"Deciding the inequivalence of context-free grammars with 1-letter terminal alphabet is \u03a32p-Complete","volume":"33","author":"Huynh","year":"1984","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0020-0255(93)90031-G_BIB13","series-title":"Proc. 3rd IEEE Symp. on Parallel and Distributed Processing","first-page":"738","article-title":"On deciding readiness and failure equivalences for processes","author":"Huynh","year":"1991"},{"key":"10.1016\/0020-0255(93)90031-G_BIB14","article-title":"On some equivalence relations for probabilistic processes","author":"Huynh","year":"1991"},{"key":"10.1016\/0020-0255(93)90031-G_BIB15","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1016\/0890-5401(90)90025-D","article-title":"CCS expressions, finite state processes and three problems of equivalences","volume":"86","author":"Kanellakis","year":"1990","journal-title":"Inform. Comput."},{"key":"10.1016\/0020-0255(93)90031-G_BIB16","series-title":"Communication and concurrency","author":"Milner","year":"1989"},{"key":"10.1016\/0020-0255(93)90031-G_BIB17","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."},{"key":"10.1016\/0020-0255(93)90031-G_BIB18","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\/0020-0255(93)90031-G_BIB19","series-title":"Proceedings of the 29th IEEE Symposium on the Foundations of Computer Science","first-page":"319","article-title":"On the complexity of \u03c9-automata","author":"Safra","year":"1988"},{"key":"10.1016\/0020-0255(93)90031-G_BIB20","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1016\/0304-3975(87)90008-9","article-title":"The complementation problem for B\u00fcchi automata with applications to temporal logic","volume":"49","author":"Sistla","year":"1987","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0020-0255(93)90031-G_BIB21","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0304-3975(76)90061-X","article-title":"The polynomial-time hierarchy","volume":"3","author":"Stockmeyer","year":"1977","journal-title":"Theoret. Comput. Sci."}],"container-title":["Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002002559390031G?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002002559390031G?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,18]],"date-time":"2019-03-18T13:29:02Z","timestamp":1552915742000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/002002559390031G"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,8]]},"references-count":21,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1993,8]]}},"alternative-id":["002002559390031G"],"URL":"https:\/\/doi.org\/10.1016\/0020-0255(93)90031-g","relation":{},"ISSN":["0020-0255"],"issn-type":[{"value":"0020-0255","type":"print"}],"subject":[],"published":{"date-parts":[[1993,8]]}}}