{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:24:29Z","timestamp":1761611069042},"reference-count":36,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[2001,5,1]],"date-time":"2001-05-01T00:00:00Z","timestamp":988675200000},"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":4460,"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":[[2001,5]]},"DOI":"10.1016\/s0304-3975(00)00027-x","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T18:03:32Z","timestamp":1027620212000},"page":"409-433","source":"Crossref","is-referenced-by-count":30,"title":["Deciding bisimulation-like equivalences with finite-state processes"],"prefix":"10.1016","volume":"258","author":[{"given":"Petr","family":"Jan\u010dar","sequence":"first","affiliation":[]},{"given":"Anton\u0131\u0301n","family":"Ku\u010dera","sequence":"additional","affiliation":[]},{"given":"Richard","family":"Mayr","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(00)00027-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. Assoc. Comput. Mach."},{"key":"10.1016\/S0304-3975(00)00027-X_BIB2","volume":"Vol. 18","author":"Baeten","year":"1990"},{"key":"10.1016\/S0304-3975(00)00027-X_BIB3","first-page":"135","volume":"Vol. 1243","author":"Bouajjani","year":"1997"},{"key":"10.1016\/S0304-3975(00)00027-X_BIB4","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1016\/0304-3975(92)90278-N","article-title":"On the regular structure of prefix rewriting","volume":"106","author":"Caucal","year":"1992","journal-title":"Theoret. Comput. Sci."},{"issue":"3","key":"10.1016\/S0304-3975(00)00027-X_BIB5","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1007\/s002360050159","article-title":"Comparing expressibility of normed BPA and normed BPP processes","volume":"36","author":"\u010cern\u00e1","year":"1999","journal-title":"Acta Inform."},{"key":"10.1016\/S0304-3975(00)00027-X_BIB6","first-page":"143","volume":"Vol. 715","author":"Christensen","year":"1993"},{"key":"10.1016\/S0304-3975(00)00027-X_BIB7","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1006\/inco.1995.1129","article-title":"Bisimulation equivalence is decidable for all context-free processes","volume":"121","author":"Christensen","year":"1995","journal-title":"Inform. and Comput."},{"key":"10.1016\/S0304-3975(00)00027-X_BIB8","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1007\/s002360050074","article-title":"Decidability of model checking for infinite-state concurrent systems","volume":"34","author":"Esparza","year":"1997","journal-title":"Acta Inform."},{"key":"10.1016\/S0304-3975(00)00027-X_BIB9","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1016\/0304-3975(90)90006-4","article-title":"Decidability of a temporal logic problem for Petri nets","volume":"74","author":"Jan\u010dar","year":"1990","journal-title":"Theoret. Comput. Sci."},{"issue":"2","key":"10.1016\/S0304-3975(00)00027-X_BIB10","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1016\/0304-3975(95)00037-W","article-title":"Undecidability of bisimilarity for Petri nets and some related problems","volume":"148","author":"Jan\u010dar","year":"1995","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(00)00027-X_BIB11","first-page":"478","volume":"Vol. 1099","author":"Jan\u010dar","year":"1996"},{"key":"10.1016\/S0304-3975(00)00027-X_BIB12","doi-asserted-by":"crossref","unstructured":"P. Jan\u010dar, A. Ku\u010dera, Bisimilarity of processes with finite-state systems, Electronic Notes in Theoretical Computer Science, Vol. 9, 1997.","DOI":"10.1016\/S1571-0661(05)80428-1"},{"key":"10.1016\/S0304-3975(00)00027-X_BIB13","first-page":"348","volume":"Vol. 962","author":"Jan\u010dar","year":"1995"},{"key":"10.1016\/S0304-3975(00)00027-X_BIB14","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1016\/S0304-3975(98)00201-1","article-title":"Effective decomposability of sequential behaviours","volume":"242","author":"Ku\u010dera","year":"2000","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(00)00027-X_BIB15","first-page":"503","volume":"Vol. 1644","author":"Ku\u010dera","year":"1999"},{"key":"10.1016\/S0304-3975(00)00027-X_BIB16","first-page":"368","volume":"Vol, 1664","author":"Ku\u010dera","year":"1999"},{"key":"10.1016\/S0304-3975(00)00027-X_BIB17","first-page":"50","volume":"Vol. 1466","author":"Lugiez","year":"1998"},{"key":"10.1016\/S0304-3975(00)00027-X_BIB18","first-page":"88","volume":"Vol. 1180","author":"Mayr","year":"1996"},{"key":"10.1016\/S0304-3975(00)00027-X_BIB19","first-page":"332","volume":"Vol. 1243","author":"Mayr","year":"1997"},{"key":"10.1016\/S0304-3975(00)00027-X_BIB20","unstructured":"R. Mayr, Decidability and complexity of model checking problems for infinite-state systems, Ph.D. Thesis, TU-M\u00fcnchen, 1998."},{"key":"10.1016\/S0304-3975(00)00027-X_BIB21","doi-asserted-by":"crossref","unstructured":"R. Mayr, Strict lower bounds for model checking BPA, Electronic Notes in Theoretical Computer Science, Vol. 18 (1998).","DOI":"10.1016\/S1571-0661(05)80256-7"},{"key":"10.1016\/S0304-3975(00)00027-X_BIB22","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1016\/S0304-3975(00)00101-8","article-title":"Decidability of model checking with the temporal logic EF","volume":"256","author":"Mayr","year":"2001","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(00)00027-X_BIB23","doi-asserted-by":"crossref","first-page":"264","DOI":"10.1006\/inco.1999.2826","article-title":"Process rewrite systems","volume":"156","author":"Mayr","year":"2000","journal-title":"Inform. and Comput."},{"key":"10.1016\/S0304-3975(00)00027-X_BIB24","series-title":"Communication and Concurrency","author":"Milner","year":"1989"},{"key":"10.1016\/S0304-3975(00)00027-X_BIB25","series-title":"Computation: Finite and Infinite Machines","author":"Minsky","year":"1967"},{"key":"10.1016\/S0304-3975(00)00027-X_BIB26","first-page":"195","volume":"Vol. 1119","author":"Moller","year":"1996"},{"issue":"1","key":"10.1016\/S0304-3975(00)00027-X_BIB27","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1016\/0304-3975(85)90087-8","article-title":"The theory of ends, pushdown automata, and second order logic","volume":"37","author":"Muller","year":"1985","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(00)00027-X_BIB28","first-page":"167","volume":"Vol. 104","author":"Park","year":"1981"},{"key":"10.1016\/S0304-3975(00)00027-X_BIB29","series-title":"Petri Nets \u2013 An Introduction","author":"Reisig","year":"1985"},{"key":"10.1016\/S0304-3975(00)00027-X_BIB30","first-page":"283","article-title":"Decomposable regular languages and the shuffle operator","volume":"67","author":"Schnoebelen","year":"1999","journal-title":"EATCS Bull."},{"issue":"1","key":"10.1016\/S0304-3975(00)00027-X_BIB31","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1006\/inco.1994.1028","article-title":"Characteristic formulae for processes with divergence","volume":"110","author":"Steffen","year":"1994","journal-title":"Inform. Comput."},{"key":"10.1016\/S0304-3975(00)00027-X_BIB32","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1016\/S0304-3975(97)00216-8","article-title":"Decidability of bisimulation equivalence for normed pushdown processes","volume":"195","author":"Stirling","year":"1998","journal-title":"Theoret. Comput. Sci."},{"issue":"3","key":"10.1016\/S0304-3975(00)00027-X_BIB33","doi-asserted-by":"crossref","first-page":"555","DOI":"10.1145\/233551.233556","article-title":"Branching time and abstraction in bisimulation semantics","volume":"43","author":"van Glabbeek","year":"1996","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/S0304-3975(00)00027-X_BIB34","first-page":"62","volume":"Vol. 1102","author":"Walukiewicz","year":"1996"},{"key":"10.1016\/S0304-3975(00)00027-X_BIB35","first-page":"142","volume":"Vol. 1450","author":"Stirling","year":"1998"},{"key":"10.1016\/S0304-3975(00)00027-X_BIB36","first-page":"559","volume":"Vol. 668","author":"Thomas","year":"1993"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S030439750000027X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S030439750000027X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,1,28]],"date-time":"2020-01-28T14:23:16Z","timestamp":1580221396000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S030439750000027X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,5]]},"references-count":36,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2001,5]]}},"alternative-id":["S030439750000027X"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(00)00027-x","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2001,5]]}}}