{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:24:32Z","timestamp":1761611072356},"reference-count":5,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1992,5,1]],"date-time":"1992-05-01T00:00:00Z","timestamp":704678400000},"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 Processing Letters"],"published-print":{"date-parts":[[1992,5]]},"DOI":"10.1016\/0020-0190(92)90142-i","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:38:59Z","timestamp":1027654739000},"page":"167-171","source":"Crossref","is-referenced-by-count":29,"title":["A short proof of the decidability of bisimulation for normed bpa-processes"],"prefix":"10.1016","volume":"42","author":[{"given":"Jan Friso","family":"Groote","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(92)90142-I_BIB1","first-page":"94","article-title":"Decidability of bisimulation equivalence for processes generating context-free languages","volume":"259","author":"Baeten","year":"1987"},{"issue":"4","key":"10.1016\/0020-0190(92)90142-I_BIB2","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1051\/ita\/1990240403391","article-title":"Graphes canoniques de graphes alg\u00e9briques","volume":"24","author":"Caucal","year":"1990","journal-title":"Theoret. Inform. and Appl."},{"key":"10.1016\/0020-0190(92)90142-I_BIB3","series-title":"Proc. 6th Ann. Symp. on Logic in Computer Science","first-page":"376","article-title":"Actions speak louder than words: Proving bisimilarity for context-free processes","author":"H\u00fcttel","year":"1991"},{"key":"10.1016\/0020-0190(92)90142-I_BIB4","series-title":"Tech. Rept. UTDCS-1-92","article-title":"Deciding bisimilarity of normed context-free processes is in \u2211p2","author":"Huynh","year":"1992"},{"key":"10.1016\/0020-0190(92)90142-I_BIB5","first-page":"167","article-title":"Concurrency and automata on infinite sequences","volume":"104","author":"Park","year":"1981"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909290142I?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909290142I?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T08:27:20Z","timestamp":1555144040000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/002001909290142I"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,5]]},"references-count":5,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1992,5]]}},"alternative-id":["002001909290142I"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(92)90142-i","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1992,5]]}}}