{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T07:44:47Z","timestamp":1767339887632,"version":"build-2065373602"},"reference-count":30,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[1999,1,1]],"date-time":"1999-01-01T00:00:00Z","timestamp":915148800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1999,1,1]],"date-time":"1999-01-01T00:00:00Z","timestamp":915148800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2013,7,29]],"date-time":"2013-07-29T00:00:00Z","timestamp":1375056000000},"content-version":"vor","delay-in-days":5323,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/3.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Electronic Notes in Theoretical Computer Science"],"published-print":{"date-parts":[[1999]]},"DOI":"10.1016\/s1571-0661(05)80297-x","type":"journal-article","created":{"date-parts":[[2005,5,25]],"date-time":"2005-05-25T08:37:08Z","timestamp":1117010228000},"page":"85-106","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":9,"special_numbering":"C","title":["Decidability of Plain and Hereditary History-Preserving Bisimilarity for BPP"],"prefix":"10.1016","volume":"27","author":[{"given":"Sibylle","family":"Fr\u00f6schle","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S1571-0661(05)80297-X_BIB1","first-page":"319","article-title":"History preserving, causal and mixed-ordering equivalence over stable event structures","volume":"17","author":"Aceto","year":"1992","journal-title":"Fund. Inform."},{"key":"10.1016\/S1571-0661(05)80297-X_BIB2","doi-asserted-by":"crossref","first-page":"369","DOI":"10.3233\/FI-1992-17406","article-title":"Relating distributed, temporal and causal observations of simple processes","volume":"17","author":"Aceto","year":"1992","journal-title":"Fundamenta Informaticae"},{"key":"10.1016\/S1571-0661(05)80297-X_BIB3","series-title":"Technical report, Polish Academy of Sciences, Gdansk","article-title":"Hereditary history preserving bisimulation or what is the power of the future perfect in program logics","author":"Bednarczyk","year":"1991"},{"key":"10.1016\/S1571-0661(05)80297-X_BIB4","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1007\/BF01178506","article-title":"Concurrent bisimulations in Petri nets","volume":"28","author":"Best","year":"1991","journal-title":"Acta Inform."},{"key":"10.1016\/S1571-0661(05)80297-X_BIB5","article-title":"\u201cBisimulations for Concurrency,\u201d Ph.D.","author":"Castellani","year":"1988","journal-title":"thesis, University of Edinburgh"},{"key":"10.1016\/S1571-0661(05)80297-X_BIB6","doi-asserted-by":"crossref","first-page":"887","DOI":"10.1145\/76359.76369","article-title":"Distributed bisimulations","volume":"36","author":"Castellani","year":"1989","journal-title":"Journal of the ACM"},{"key":"10.1016\/S1571-0661(05)80297-X_BIB7","series-title":"CONCUR'92 (Stony Brook, NY, 1992)","first-page":"148","article-title":"Distributed bisimularity is decidable for a class of infinite state-space systems","author":"Christensen","year":"1992"},{"key":"10.1016\/S1571-0661(05)80297-X_BIB8","article-title":"\u201cDecidability and Decomposition in Process Algebras,\u201d Ph.D.","author":"Christensen","year":"1993","journal-title":"thesis, University of Edinburgh"},{"key":"10.1016\/S1571-0661(05)80297-X_BIB9","series-title":"CONCUR '93 (Hildesheim 1993)","first-page":"143","article-title":"Bisimulation equivalence is decidable for basic parallel processes","author":"Christensen","year":"1993"},{"key":"10.1016\/S1571-0661(05)80297-X_BIB10","doi-asserted-by":"crossref","first-page":"438","DOI":"10.1007\/BFb0013030","article-title":"Partial orderings descriptions and observations of nondeterministic concurrent processes","volume":"354","author":"Degano","year":"1989","journal-title":"Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, LNCS"},{"key":"10.1016\/S1571-0661(05)80297-X_BIB11","doi-asserted-by":"crossref","first-page":"575","DOI":"10.1007\/BF01463946","article-title":"Branching processes of Petri nets","volume":"28","author":"Engelfriet","year":"1991","journal-title":"Acta Inform"},{"key":"10.1016\/S1571-0661(05)80297-X_BIB12","first-page":"13","article-title":"Petri nets, commutative context-free grammars, and basic parallel processes","volume":"31","author":"Esparza","year":"1997","journal-title":"Fund. Inform."},{"key":"10.1016\/S1571-0661(05)80297-X_BIB13","doi-asserted-by":"crossref","unstructured":"Esparza, J. and A. Kiehn, On the model checking problem for branching time logics and basic parallel processesin: Proceedings of Computer Aided Verification (CAV '95), 7th International Conference, Springer, Berlin, 1995 pp. 353-366.","DOI":"10.1007\/3-540-60045-0_62"},{"year":"1998","series-title":"On the decidability problem of strong history-preserving bisimulation, progress Report","author":"Fr\u00f6schle","key":"10.1016\/S1571-0661(05)80297-X_BIB14"},{"year":"1999","series-title":"On plain and hereditary history-preserving bisimulation, to appear at MFCS'99","author":"Fr\u00f6schle","key":"10.1016\/S1571-0661(05)80297-X_BIB15"},{"key":"10.1016\/S1571-0661(05)80297-X_BIB16","series-title":"CONCUR' 90 (Amsterdam, 1990)","first-page":"2","article-title":"SCONE: a simple calculus of netsin:","author":"Gorrieri","year":"1990"},{"key":"10.1016\/S1571-0661(05)80297-X_BIB17","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1016\/0304-3975(95)00132-8","article-title":"Deciding true concurrency equivalences on safe, finite nets","volume":"154","author":"Jategaonkar","year":"1996","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S1571-0661(05)80297-X_BIB18","doi-asserted-by":"crossref","first-page":"164","DOI":"10.1006\/inco.1996.0057","article-title":"Bisimulation from open maps","volume":"127","author":"Joyal","year":"1996","journal-title":"Inform. and Comput."},{"key":"10.1016\/S1571-0661(05)80297-X_BIB19","series-title":"Research Series RS-99-19, BRICS, Department of Computer Science, University of Aarhus","article-title":"Hereditary history preserving bisimilarity is undecidable","author":"Jurdzi\u0144ski","year":"1999"},{"key":"10.1016\/S1571-0661(05)80297-X_BIB20","series-title":"Research Series RS-99-1, BRICS, Department of Computer Science, University of Aarhus","article-title":"Hereditary history preserving simulation is undecidable","author":"Jurdzi\u0144ski","year":"1999"},{"year":"1999","series-title":"A note on distributed bisimulations","author":"Kiehn","key":"10.1016\/S1571-0661(05)80297-X_BIB21"},{"key":"10.1016\/S1571-0661(05)80297-X_BIB22","series-title":"in: CONCUR '94: concurrency theory (Uppsala, 1994)","first-page":"18","article-title":"On the decidability of non-interleaving process equivalences","author":"Kiehn","year":"1994"},{"key":"10.1016\/S1571-0661(05)80297-X_BIB23","series-title":"CONCUR '96: concurrency theory (Pisa)","first-page":"195","article-title":"Infinite results","author":"Moller","year":"1996"},{"key":"10.1016\/S1571-0661(05)80297-X_BIB24","series-title":"STACS 97 (L\u00fcbeck)","first-page":"413","article-title":"Minimal transition systems for history-preserving bisimulation","author":"Montanari","year":"1997"},{"key":"10.1016\/S1571-0661(05)80297-X_BIB25","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1016\/0304-3975(81)90112-2","article-title":"Petri nets, event structures and domains. I","volume":"13","author":"Nielsen","year":"1981","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S1571-0661(05)80297-X_BIB26","first-page":"357","article-title":"Behavior structures and nets","volume":"11","author":"Rabinovich","year":"1988","journal-title":"Fund. Inform."},{"key":"10.1016\/S1571-0661(05)80297-X_BIB27","series-title":"in: Application and theory of Petri nets 1996 (Osaka, 1996)","first-page":"460","article-title":"Behavioural equivalence for infinite systems\u2014partially decidable","author":"Sunesen","year":"1996"},{"key":"10.1016\/S1571-0661(05)80297-X_BIB28","first-page":"237","article-title":"Equivalence notions for concurrent systems and refinement of actions (extended abstract)","volume":"379","author":"van Glabbeek","year":"1989"},{"key":"10.1016\/S1571-0661(05)80297-X_BIB29","first-page":"495","article-title":"Deciding history preserving bisimilarity","volume":"510","author":"Vogler","year":"1991"},{"key":"10.1016\/S1571-0661(05)80297-X_BIB30","doi-asserted-by":"crossref","first-page":"38","DOI":"10.1006\/inco.1995.1050","article-title":"Generalized OM-bisimulation","volume":"118","author":"Vogler","year":"1995","journal-title":"Inform. and Comput."}],"container-title":["Electronic Notes in Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S157106610580297X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S157106610580297X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:07:43Z","timestamp":1761610063000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S157106610580297X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"references-count":30,"alternative-id":["S157106610580297X"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0661(05)80297-x","relation":{},"ISSN":["1571-0661"],"issn-type":[{"type":"print","value":"1571-0661"}],"subject":[],"published":{"date-parts":[[1999]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Decidability of Plain and Hereditary History-Preserving Bisimilarity for BPP","name":"articletitle","label":"Article Title"},{"value":"Electronic Notes in Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/S1571-0661(05)80297-X","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1999 Elsevier B.V.","name":"copyright","label":"Copyright"}]}}