{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:28:20Z","timestamp":1761611300284,"version":"3.40.2"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540616047"},{"type":"electronic","value":"9783540706250"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/3-540-61604-7_59","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T22:02:46Z","timestamp":1330293766000},"page":"247-262","source":"Crossref","is-referenced-by-count":29,"title":["Bisimulation collapse and the process taxonomy"],"prefix":"10.1007","author":[{"given":"Olaf","family":"Burkart","sequence":"first","affiliation":[]},{"given":"Didier","family":"Caucal","sequence":"additional","affiliation":[]},{"given":"Bernhard","family":"Steffen","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,2]]},"reference":[{"key":"16_CR1","doi-asserted-by":"crossref","unstructured":"J.C.M. Baeten, J.A. Bergstra, and J.W. Klop. Decidability of Bisimulation Equivalence for Processes Generating Context-Free Languages. In PARLE '87, LNCS 259, pages 94\u2013113. Springer, 1987.","DOI":"10.1007\/3-540-17945-3_5"},{"key":"16_CR2","doi-asserted-by":"crossref","unstructured":"O. Burkart, D. Caucal, and B. Steffen. An Elementary Bisimulation Decision Procedure for Arbitrary Context-Free Processes. In MFCS '95, LNCS 969, pages 423\u2013433. Springer, 1995.","DOI":"10.1007\/3-540-60246-1_148"},{"key":"16_CR3","doi-asserted-by":"crossref","unstructured":"D.J.B. Bosscher and W.O.D. Griffioen. Regularity for a Large Class of Context-Free Processes is Decidable. Will be presented at ICALP '96, 1996.","DOI":"10.1007\/3-540-61440-0_127"},{"key":"16_CR4","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1007\/BF01969548","volume":"6","author":"R. B\u00fcchi","year":"1964","unstructured":"R. B\u00fcchi. Regular Canonical Systems. Archiv f\u00fcr Mathematische Logik und Grundlagenforschung, 6:91\u2013111, 1964.","journal-title":"Archiv f\u00fcr Mathematische Logik und Grundlagenforschung"},{"issue":"4","key":"16_CR5","first-page":"339","volume":"24","author":"D. Caucal","year":"1990","unstructured":"D. Caucal. Graphes Canoniques de Graphes Alg\u00e9briques. RAIRO, 24(4):339\u2013352, 1990.","journal-title":"RAIRO"},{"key":"16_CR6","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1016\/0304-3975(92)90278-N","volume":"106","author":"D. Caucal","year":"1992","unstructured":"D. Caucal. On the Regular Structure of Prefix Rewriting. Theoretical Computer Science, 106:61\u201386, 1992.","journal-title":"Theoretical Computer Science"},{"key":"16_CR7","doi-asserted-by":"crossref","unstructured":"S. Christensen, Y. Hirshfeld, and F. Moller. Bisimulation Equivalence is Decidable for all Basic Parallel Processes. In CONCUR '93, LNCS 715, pages 143\u2013157. Springer, 1993.","DOI":"10.1007\/3-540-57208-2_11"},{"key":"16_CR8","doi-asserted-by":"crossref","unstructured":"S. Christensen, Y. Hirshfeld, and F. Moller. Decomposability, Decidability and Axiomatisability for Bisimulation Equivalence on Basic Parallel Processes. In LICS '93. IEEE Computer Society Press, 1993.","DOI":"10.1007\/3-540-57208-2_11"},{"key":"16_CR9","unstructured":"S. Christensen. Decidability and Decomposition in Process Algebras. PhD thesis, The University of Edinburgh, Department of Computer Science, 1993."},{"key":"16_CR10","doi-asserted-by":"crossref","unstructured":"S. Christensen, H. H\u00fcttel, and C. Stirling. Bisimulation Equivalence is Decidable for all Context-Free Processes. In CONCUR '92, LNCS 630, pages 138\u2013147. Springer, 1992.","DOI":"10.1007\/BFb0084788"},{"key":"16_CR11","doi-asserted-by":"crossref","unstructured":"D. Caucal and R. Monfort. On the Transition Graphs of Automata and Grammars. In Graph-Theoretic Concepts in Computer Science, LNCS 484, pages 311\u2013337. Springer, 1990.","DOI":"10.1007\/3-540-53832-1_51"},{"key":"16_CR12","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1016\/0020-0190(92)90142-I","volume":"42","author":"J.F. Groote","year":"1991","unstructured":"J.F. Groote. A Short Proof of the Decidability of Bisimulation for Normed BPA-Processes. Information Processing Letters, 42:167\u2013171, 1991.","journal-title":"Information Processing Letters"},{"key":"16_CR13","doi-asserted-by":"crossref","unstructured":"Y. Hirshfeld, M. Jerrum, and F. Moller. A Polynomial Algorithm for Deciding Bisimilarity of Normed Context-Free Processes. In FOCS '94, pages 623\u2013631. IEEE Computer Society Press, 1994.","DOI":"10.1007\/978-3-540-48654-1_5"},{"key":"16_CR14","doi-asserted-by":"crossref","unstructured":"Y. Hirshfeld and F. Moller. A Fast Algorithm for Deciding Bisimilarity of Normed Context-Free Processes. In CONCUR '94, LNCS 836, pages 48\u201363. Springer, 1994.","DOI":"10.1007\/978-3-540-48654-1_5"},{"key":"16_CR15","doi-asserted-by":"crossref","unstructured":"H. H\u00fcttel and C. Stirling. Actions Speak Louder than Words: Proving Bisimilarity for Context-Free Processes. In LICS '91, pages 376\u2013386. IEEE Computer Society Press, 1991.","DOI":"10.1109\/LICS.1991.151661"},{"key":"16_CR16","doi-asserted-by":"crossref","unstructured":"P. Jan\u010dar and J. Esparza. Deciding Finiteness of Petri Nets up to Bisimulation. Will be presented at ICALP '96, 1996.","DOI":"10.1007\/3-540-61440-0_152"},{"key":"16_CR17","doi-asserted-by":"crossref","unstructured":"P. Jan\u010dar and F. Moller. Checking Regular Properties of Petri Nets. In CONCUR '95, LNCS 995, pages 348\u2013362. Springer, 1995.","DOI":"10.1007\/3-540-60218-6_26"},{"key":"16_CR18","doi-asserted-by":"crossref","unstructured":"S. Mauw and H. Mulder. Regularity of BPA-Systems is Decidable. In CONCUR '94, LNCS 836, pages 34\u201347. Springer, 1994.","DOI":"10.1007\/978-3-540-48654-1_4"},{"key":"16_CR19","doi-asserted-by":"crossref","unstructured":"C. Stirling. Decidability of Bisimulation Equivalence for Normed Pushdown Processes. Will be presented at CONCUR '96, 1996.","DOI":"10.1007\/3-540-61604-7_57"}],"container-title":["Lecture Notes in Computer Science","CONCUR '96: Concurrency Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-61604-7_59.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T23:22:20Z","timestamp":1742599340000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-61604-7_59"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540616047","9783540706250"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/3-540-61604-7_59","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1996]]}}}