{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,19]],"date-time":"2026-02-19T03:21:07Z","timestamp":1771471267504,"version":"3.50.1"},"reference-count":19,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1996,5,1]],"date-time":"1996-05-01T00:00:00Z","timestamp":830908800000},"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":6286,"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":[[1996,5]]},"DOI":"10.1016\/0304-3975(95)00064-x","type":"journal-article","created":{"date-parts":[[2003,4,30]],"date-time":"2003-04-30T21:37:28Z","timestamp":1051738648000},"page":"143-159","source":"Crossref","is-referenced-by-count":92,"title":["A polynomial algorithm for deciding bisimilarity of normed context-free processes"],"prefix":"10.1016","volume":"158","author":[{"given":"Yoram","family":"Hirshfeld","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mark","family":"Jerrum","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Faron","family":"Moller","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"3","key":"10.1016\/0304-3975(95)00064-X_BIB1","doi-asserted-by":"crossref","first-page":"653","DOI":"10.1145\/174130.174141","article-title":"Decidability of bisimulation equivalence for processes generating context-free languages","volume":"40","author":"Baeten","year":"1993","journal-title":"J. ACM"},{"issue":"1","key":"10.1016\/0304-3975(95)00064-X_BIB2","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1016\/0304-3975(85)90088-X","article-title":"Algebra of communicating processes with abstraction","volume":"37","author":"Bergstra","year":"1985","journal-title":"Theoret. Comput. Sci."},{"issue":"4","key":"10.1016\/0304-3975(95)00064-X_BIB3","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1051\/ita\/1990240403391","article-title":"Graphes canoniques des graphes alg\u00e9briques","volume":"24","author":"Caucal","year":"1990","journal-title":"Inform. Th\u00e9ori. Appl. (RAIRO)"},{"issue":"1","key":"10.1016\/0304-3975(95)00064-X_BIB4","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1051\/ita\/1993270100231","article-title":"A fast algorithm to decide on the equivalence of stateless DPDA","volume":"27","author":"Caucal","year":"1993","journal-title":"Inform. Th\u00e9ori. Appl. (RAIRO)"},{"key":"10.1016\/0304-3975(95)00064-X_BIB5","series-title":"Proc. CONCUR 92","first-page":"138","article-title":"Bisimulation equivalence is decidable for all context-free processes","volume":"Vol. 630","author":"Christensen","year":"1992"},{"key":"10.1016\/0304-3975(95)00064-X_BIB6","series-title":"Developmental Systems and Languages","author":"Herman","year":"1975"},{"key":"10.1016\/0304-3975(95)00064-X_BIB7","series-title":"Proc. CONCUR 94","first-page":"48","article-title":"A fast algorithm for deciding bisimilarity of normed context-free processes","volume":"Vol. 836","author":"Hirshfeld","year":"1994"},{"key":"10.1016\/0304-3975(95)00064-X_BIB8","doi-asserted-by":"crossref","DOI":"10.1017\/S0960129500000992","article-title":"A polynomial algorithm for deciding bisimulation equivalence of normed Basic Parallel Processes","author":"Hirshfeld","year":"1994"},{"key":"10.1016\/0304-3975(95)00064-X_BIB9","series-title":"Communicating Sequential Processes","author":"Hoare","year":"1985"},{"key":"10.1016\/0304-3975(95)00064-X_BIB10","series-title":"Introduction to Automata Theory, Languages and Computation","author":"Hopcroft","year":"1979"},{"issue":"2","key":"10.1016\/0304-3975(95)00064-X_BIB11","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1016\/0304-3975(92)00078-6","article-title":"Deciding bisimilarity of normed context-free processes is in \u03a32P","volume":"123","author":"Huynh","year":"1994","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(95)00064-X_BIB12","series-title":"Proc. STACS 94","first-page":"581","article-title":"Decidability questions for bisimilarity of Petri nets and some related problems","volume":"Vol. 775","author":"Jan\u010dar","year":"1994"},{"issue":"2","key":"10.1016\/0304-3975(95)00064-X_BIB13","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1137\/0206024","article-title":"Fast pattern matching in strings","volume":"6","author":"Knuth","year":"1977","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(95)00064-X_BIB14","series-title":"Proc. 7th IEEE Switching and Automata Theory Conf.","first-page":"36","article-title":"Simple deterministic languages","author":"Korenjak","year":"1966"},{"key":"10.1016\/0304-3975(95)00064-X_BIB15","series-title":"Communication and Concurrency","author":"Milner","year":"1989"},{"key":"10.1016\/0304-3975(95)00064-X_BIB16","doi-asserted-by":"crossref","first-page":"357","DOI":"10.1016\/0304-3975(93)90176-T","article-title":"Unique decomposition of processes","volume":"107","author":"Milner","year":"1993","journal-title":"J. Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(95)00064-X_BIB17","series-title":"Proc. 5th G.I. Conf. on Theoretical Computer Science","first-page":"168","article-title":"Concurrency and Automata on Infinite Sequences","volume":"Vol. 104","author":"Park","year":"1981"},{"issue":"1","key":"10.1016\/0304-3975(95)00064-X_BIB18","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."},{"key":"10.1016\/0304-3975(95)00064-X_BIB19","series-title":"proc. CONCUR 90","first-page":"278","article-title":"The linear time-branching time spectrum","volume":"Vol. 458","author":"van Glabbeek","year":"1990"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759500064X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759500064X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,16]],"date-time":"2019-04-16T08:53:08Z","timestamp":1555404788000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/030439759500064X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,5]]},"references-count":19,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1996,5]]}},"alternative-id":["030439759500064X"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(95)00064-x","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1996,5]]}}}