{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,5]],"date-time":"2026-02-05T06:26:44Z","timestamp":1770272804038,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540583295","type":"print"},{"value":"9783540486541","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1994]]},"DOI":"10.1007\/978-3-540-48654-1_5","type":"book-chapter","created":{"date-parts":[[2016,5,10]],"date-time":"2016-05-10T13:34:34Z","timestamp":1462887274000},"page":"48-63","source":"Crossref","is-referenced-by-count":10,"title":["A Fast Algorithm for Deciding Bisimilarity of Normed Context-Free Processes"],"prefix":"10.1007","author":[{"given":"Yoram","family":"Hirshfeld","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Faron","family":"Moller","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"5_CR1","volume-title":"Lecture Notes in Computer Science","author":"JC Baeten","year":"1987","unstructured":"J.C.M. Baeten, J.A. Bergstra and J.W. Klop. Decidability of bisimulation equivalence for processes generating context-free languages. In Proceedings of PARLE\u201987, J.W. de Bakker, A.J. Nijman and P.C. Treleaven (eds), Lecture Notes in Computer Science 259, pp93\u2013114. Springer-Verlag, 1987."},{"issue":"4","key":"5_CR2","first-page":"339","volume":"24","author":"D Caucal","year":"1990","unstructured":"D. Caucal. Graphes canoniques des graphes alg\u00e9briques. Informatique Th\u00e9orique et Applications (RAIRO) 24 (4), pp 339\u2013352, 1990.","journal-title":"Informatique Th\u00e9orique et Applications (RAIRO)"},{"key":"5_CR3","volume-title":"Lecture Notes in Computer Science","author":"S Christensen","year":"1992","unstructured":"S. Christensen, H. H\u00fcttel and C. Stirling. Bisimulation equivalence is decidable for all context-free processes. In Proceedings of CONCUR\u201992, W.R. Cleaveland (ed), Lecture Notes in Computer Science 630, pp138\u2013147. Springer-Verlag, 1992."},{"key":"5_CR4","doi-asserted-by":"crossref","unstructured":"R.J. van Glabbeek. The linear time-branching time spectrum. In Proceedings of CONCUR\u201990, J. Baeten and J.W. Klop (eds), Lecture Notes in Computer Science 458, pp278\u2013297. Springer-Verlag, 1990.","DOI":"10.1007\/BFb0039066"},{"key":"5_CR5","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1016\/0020-0190(92)90142-I","volume":"42","author":"JF Groote","year":"1991","unstructured":"J.F. Groote. A short proof of the decidability of bisimulation for normed BPA processes. Information Processing Letters 42, pp 167\u2013171, 1991.","journal-title":"Information Processing Letters"},{"key":"5_CR6","volume-title":"Information and Computation","author":"JF Groote","year":"1994","unstructured":"J.F. Groote and H. H\u00fcttel. Undecidable equivalences for basic process algebra. Information and Computation, 1994."},{"key":"5_CR7","doi-asserted-by":"crossref","unstructured":"Y. Hirshfeld, M. Jerrum and F. Moller. A polynomial algorithm for deciding bisimilarity of normed context-free processes. Department of Computer Science Research Report ECS-LFCS-94\u2013286. University of Edinburgh, 1994.","DOI":"10.1007\/978-3-540-48654-1_5"},{"key":"5_CR8","unstructured":"J.E. Hoperoft and J.D. Ullman. Introduction to Automata Theory, Languages, and Computation. Addison Wesley, 1979."},{"key":"5_CR9","first-page":"376","volume-title":"Proceedings of LICS91, IEEE Computer Society Press","author":"H H\u00fcttel","year":"1991","unstructured":"H. H\u00fcttel and C. Stirling. Actions speak louder than words: proving bisimilarity for context-free processes. In Proceedings of LICS\u201991, IEEE Computer Society Press, pp 376\u2013386, 1991."},{"key":"5_CR10","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/0304-3975(92)00078-6","volume":"123","author":"DT Huynh","year":"1994","unstructured":"D.T. Huynh and L. Tian. Deciding bisimilarity of normed context-free processes is in \u03a32 P. Journal of Theoretical Computer Science 123, pp 183\u2013197, 1994.","journal-title":"Journal of Theoretical Computer Science"},{"key":"5_CR11","unstructured":"R. Milner. Communication and Concurrency. Prentice Hall, 1989."},{"key":"5_CR12","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1016\/0304-3975(93)90176-T","volume":"107","author":"R Milner","year":"1993","unstructured":"R. Milner and F. Moller. Unique decomposition of processes. Journal of Theoretical Computer Science 107, pp 357\u2013363, 1993.","journal-title":"Journal of Theoretical Computer Science"},{"key":"5_CR13","unstructured":"D.M.R. Park. Concurrency and Automata on Infinite Sequences. Lecture Notes in Computer Science 104, pp168\u2013183. Springer Verlag, 1981."}],"container-title":["Lecture Notes in Computer Science","CONCUR '94: Concurrency Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-48654-1_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,21]],"date-time":"2022-06-21T02:04:08Z","timestamp":1655777048000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-48654-1_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994]]},"ISBN":["9783540583295","9783540486541"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-48654-1_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1994]]}}}