{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,9]],"date-time":"2026-02-09T00:15:59Z","timestamp":1770596159560,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540602460","type":"print"},{"value":"9783540447689","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/3-540-60246-1_148","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T17:56:22Z","timestamp":1330278982000},"page":"423-433","source":"Crossref","is-referenced-by-count":39,"title":["An elementary bisimulation decision procedure for arbitrary context-free processes"],"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":"40_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. Full version appeared as: Technical Report CS-R8632, CWI, Sep. 1987.","DOI":"10.1007\/3-540-17945-3_5"},{"key":"40_CR2","volume-title":"Technical Report AIB-94-28","author":"O. Burkart","year":"1994","unstructured":"O. Burkart, D. Caucal, and S. Steffen. An Elementary Bisimulation Decision Procedure for Arbitrary Context-Free Processes. Technical Report AIB-94-28, RWTH Aachen, 1994."},{"key":"40_CR3","doi-asserted-by":"crossref","unstructured":"J.C.M. Baeten and W.P. Weijland. Process Algebra, volume 18 of Cambridge Tracts in TCS. Cambridge University Press, 1990.","DOI":"10.1017\/CBO9780511624193"},{"key":"40_CR4","doi-asserted-by":"crossref","unstructured":"D. Caucal. A Fast Algorithm to Decide on Simple Grammars Equivalence. In Int. Symposium on Optimal Algorithms, LNCS 401, pages 66\u201385. Springer, 1989.","DOI":"10.1007\/3-540-51859-2_8"},{"issue":"4","key":"40_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. A preliminary, version appeared as: Rapport de Recherche 872, INRIA, July 1988.","journal-title":"RAIRO"},{"key":"40_CR6","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":"40_CR7","doi-asserted-by":"crossref","unstructured":"R.J. van Glabbeek. The Linear Time \u2014 Branching Time Spectrum. In CONCUR 90, LNCS 458, pages 278\u2013297. Springer, 1990.","DOI":"10.1007\/BFb0039066"},{"key":"40_CR8","unstructured":"J.F. Groote. A Short Proof of the Decidability of Bisimulation for Normed BPA-Processes. Technical Report CS-R9151, CWI, Dec 1991."},{"key":"40_CR9","volume-title":"Technical Report ECS-LFCS-94-286","author":"Y. Hirshfeld","year":"1994","unstructured":"Y. Hirshfeld, M. Jerrum, and F. Moller. A Polynomial Algorithm for Deciding Bisimilarity of Normed Context-Free Processes. Technical Report ECS-LFCS-94-286, LFCS, Edinburgh, March 1994. To be presented at FOCS '94."},{"key":"40_CR10","first-page":"48","volume":"836","author":"Y. Hirshfeld","year":"1994","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, 1994.","journal-title":"CONCUR '94, LNCS"},{"key":"40_CR11","doi-asserted-by":"crossref","unstructured":"C.A.R. Hoare. Communicating Sequential Processes. Prentice-Hall, 1985.","DOI":"10.1007\/978-3-642-82921-5_4"},{"key":"40_CR12","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":"40_CR13","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/0304-3975(92)00078-6","volume":"123","author":"D.T. Huynh","year":"1994","unstructured":"D.T. Huynh and L. Tian. Deciding Bisimilarity of Normed Context-Free Processes is in Deciding Bisimilarity of Normed Context-Free Processes is in \u03c3 2 p . Theoretical Computer Science, 123:183\u2013197, 1994.","journal-title":"Theoretical Computer Science"},{"key":"40_CR14","unstructured":"R. Milner. Communication and Concurrency. Prentice-Hall, 1989."},{"key":"40_CR15","doi-asserted-by":"crossref","unstructured":"D. Park. Concurrency and Automata on Infinite Sequences. In 5th GI Conference, LNCS 104, pages 167\u2013183. Springer, 1981.","DOI":"10.1007\/BFb0017309"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 1995"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-60246-1_148.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T22:56:26Z","timestamp":1742597786000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-60246-1_148"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540602460","9783540447689"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/3-540-60246-1_148","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1995]]}}}