{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T05:42:37Z","timestamp":1648878157828},"reference-count":17,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1997,6,1]],"date-time":"1997-06-01T00:00:00Z","timestamp":865123200000},"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":5890,"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":[[1997,6]]},"DOI":"10.1016\/s0304-3975(96)00147-8","type":"journal-article","created":{"date-parts":[[2003,4,23]],"date-time":"2003-04-23T23:53:40Z","timestamp":1051142020000},"page":"301-317","source":"Crossref","is-referenced-by-count":6,"title":["On reachability equivalence for BPP-nets"],"prefix":"10.1016","volume":"179","author":[{"given":"Yen","family":"Hsu-Chun","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(96)00147-8_BIB1","article-title":"Decidability and decomposition in process algebras","author":"Christensen","year":"1993"},{"key":"10.1016\/S0304-3975(96)00147-8_BIB2","series-title":"Proc. CONCUR'93","first-page":"143","article-title":"Bisimulation equivalence is decidable for basic parallel processes","volume":"Vol. 715","author":"Christensen","year":"1993"},{"key":"10.1016\/S0304-3975(96)00147-8_BIB3","first-page":"156","article-title":"Decidability issues for infinite-state processes \u2014 a survey","volume":"51","author":"Christensen","year":"1993","journal-title":"Bull. EATCS"},{"key":"10.1016\/S0304-3975(96)00147-8_BIB4","series-title":"Proc. FCT'95","first-page":"221","article-title":"Petri nets, commutative context-free grammars and basic parallel processes","volume":"Vol. 965","author":"Esparza","year":"1995"},{"key":"10.1016\/S0304-3975(96)00147-8_BIB5","first-page":"245","article-title":"Decidability issues for Petri nets \u2014 a survey","volume":"52","author":"Esparza","year":"1993","journal-title":"Bull. EATCS"},{"key":"10.1016\/S0304-3975(96)00147-8_BIB6","series-title":"Proc. CSL'93, 1993 Conf. of European Association for Computer Science Logic","first-page":"165","article-title":"Petri nets and the equivalence problem","volume":"Vol. 832","author":"Hirshfeld","year":"1994"},{"key":"10.1016\/S0304-3975(96)00147-8_BIB7","article-title":"A polynomial time algorithm for deciding bisimulation equivalence of normed basic parallel processes","author":"Hirshfeld","year":"1994","journal-title":"Tech. Report, Dept. of Computer Science, Univ. of Edinburgh"},{"key":"10.1016\/S0304-3975(96)00147-8_BIB8","series-title":"Proc. Int'l Symp. on Theoretical Aspects of Computer Software","first-page":"454","article-title":"Undecidable equivalences for basic parallel processes","volume":"Vol. 789","author":"H\u00fcttel","year":"1994"},{"key":"10.1016\/S0304-3975(96)00147-8_BIB9","first-page":"291","article-title":"The complexity of semilinear sets","volume":"18","author":"Huynh","year":"1982","journal-title":"Inform. Process. Cybernet. (EIK)"},{"key":"10.1016\/S0304-3975(96)00147-8_BIB10","first-page":"21","article-title":"Commutative grammars: the complexity of uniform word problems","volume":"57","author":"Huynh","year":"1983","journal-title":"Inform. Comput."},{"key":"10.1016\/S0304-3975(96)00147-8_BIB11","first-page":"103","article-title":"The complexity of equivalence problems for commutative grammars","volume":"66","author":"Huynh","year":"1985","journal-title":"Inform. Comput."},{"key":"10.1016\/S0304-3975(96)00147-8_BIB12","first-page":"147","article-title":"A simple proof for the \u03a3p2 upper bound of the inequivalence problem for semilinear sets","volume":"22","author":"Huynh","year":"1986","journal-title":"Inform. Process. Cybernet. (EIK)"},{"key":"10.1016\/S0304-3975(96)00147-8_BIB13","series-title":"Petri Net Theory and the Modeling of Systems","author":"Peterson","year":"1981"},{"key":"10.1016\/S0304-3975(96)00147-8_BIB14","article-title":"Petri Nets: An Introduction","volume":"Vol. 4","author":"Reisig","year":"1985"},{"key":"10.1016\/S0304-3975(96)00147-8_BIB15","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\/S0304-3975(96)00147-8_BIB16","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1016\/0304-3975(84)90038-0","article-title":"Normal Petri nets","volume":"31","author":"Yamasaki","year":"1984","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(96)00147-8_BIB17","series-title":"Proc. CONCUR'90","first-page":"278","article-title":"The linear time \u2014 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:S0304397596001478?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397596001478?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,29]],"date-time":"2019-04-29T07:25:30Z","timestamp":1556522730000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397596001478"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,6]]},"references-count":17,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1997,6]]}},"alternative-id":["S0304397596001478"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(96)00147-8","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1997,6]]}}}