{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:26:34Z","timestamp":1761611194092,"version":"3.32.0"},"reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540558224"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0084788","type":"book-chapter","created":{"date-parts":[[2006,11,24]],"date-time":"2006-11-24T13:12:14Z","timestamp":1164373934000},"page":"138-147","source":"Crossref","is-referenced-by-count":36,"title":["Bisimulation equivalence is decidable for all context-free processes"],"prefix":"10.1007","author":[{"given":"S\u00f8ren","family":"Christensen","sequence":"first","affiliation":[]},{"given":"Hans","family":"H\u00fcttel","sequence":"additional","affiliation":[]},{"given":"Colin","family":"Stirling","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"11_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. Technical Report CS-R8632, CWI, September 1987.","DOI":"10.1007\/3-540-17945-3_5"},{"key":"11_CR2","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/S0019-9958(84)80025-X","volume":"60","author":"J.A. Bergstra","year":"1984","unstructured":"J.A. Bergstra and J.W. Klop. Process algebra for synchronous communication. Information and Control, 60:109\u2013137, 1984.","journal-title":"Information and Control"},{"key":"11_CR3","doi-asserted-by":"crossref","unstructured":"J.A. Bergstra and J.W. Klop. Process theory based on bisimulation semantics. In J.W. de Bakker, W.P de Roever, and G. Rozenberg, editors, LNCS 354, pages 50\u2013122. Springer-Verlag, 1988.","DOI":"10.1007\/BFb0013021"},{"key":"11_CR4","unstructured":"O. Burkart and B. Steffen. Model checking for context-free processes. In these proceedings."},{"key":"11_CR5","doi-asserted-by":"crossref","unstructured":"D. Caucal. D\u00e9cidabilit\u00e9 de l'egalit\u00e9 des langages alg\u00e9briques infinitaires simples. In Proceedings of STACS 86, LNCS 210, pages 37\u201348. Springer-Verlag, 1986.","DOI":"10.1007\/3-540-16078-7_63"},{"key":"11_CR6","unstructured":"D. Caucal. Graphes canoniques de graphes alg\u00e9briques. Rapport de Recherche 872, INRIA, Juillet 1988."},{"issue":"4","key":"11_CR7","first-page":"339","volume":"24","author":"D. Caucal","year":"1990","unstructured":"D. Caucal. Graphes canoniques de graphes alg\u00e9briques. Informatique th\u00e9orique et Applications (RAIRO), 24(4):339\u2013352, 1990.","journal-title":"Informatique th\u00e9orique et Applications (RAIRO)"},{"key":"11_CR8","unstructured":"S. Christensen. Distributed bisimularity is decidable for a class of infinite statespace systems. In these proceedings."},{"key":"11_CR9","doi-asserted-by":"crossref","unstructured":"J. F. Groote. A short proof of the decidability of bisimulation for normed BPA-processes. Tech. Report Utrecht University 1992.","DOI":"10.1016\/0020-0190(92)90142-I"},{"key":"11_CR10","unstructured":"J.F. Groote and H. H\u00fcttel. Undecidable equivalences for basic process algebra. Technical Report ECS-LFCS-91-169, Department of Computer Science, University of Edinburgh, August 1991."},{"key":"11_CR11","unstructured":"C.A.R. Hoare. Communicating Sequential Processes. Prentice-Hall, 1988."},{"key":"11_CR12","unstructured":"J. Hopcroft and J.D. Ullman. Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, 1979."},{"key":"11_CR13","unstructured":"H. H\u00fcttel. Decidability, Behavioural Equivalences and Infinite Transition Graphs. PhD thesis, University of Edinburgh, December 1991."},{"key":"11_CR14","doi-asserted-by":"crossref","unstructured":"H. H\u00fcttel and C. Stirling. Actions speak louder than words: Proving bisimilarity for context-free processes. In Proceedings of 6th Annual Symposium on Logic in Computer Science (LICS 91), pages 376\u2013386. IEEE Computer Society Press, 1991.","DOI":"10.1109\/LICS.1991.151661"},{"key":"11_CR15","volume-title":"Technical Report UTDCS-31-90","author":"D. T. Huynh","year":"1990","unstructured":"Dung T. Huynh and Lu Tian. On deciding readiness and failure equivalences for processes. Technical Report UTDCS-31-90, University of Texas at Dallas, September 1990."},{"key":"11_CR16","doi-asserted-by":"publisher","first-page":"439","DOI":"10.1016\/0022-0000(84)90023-0","volume":"28","author":"R. Milner","year":"1984","unstructured":"R. Milner. A complete inference system for a class of regular behaviours. Journal of Computer and System Sciences, 28:439\u2013466, 1984.","journal-title":"Journal of Computer and System Sciences"},{"key":"11_CR17","unstructured":"R. Milner. Communication and Concurrency. Prentice-Hall International, 1989."},{"key":"11_CR18","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1016\/0304-3975(85)90087-8","volume":"37","author":"D. Muller","year":"1985","unstructured":"D. Muller and P. Schupp. The theory of ends, pushdown automata, and second-order logic. Theoretical Computer Science, 37:51\u201375, 1985.","journal-title":"Theoretical Computer Science"}],"container-title":["Lecture Notes in Computer Science","CONCUR '92"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0084788.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,12]],"date-time":"2025-01-12T03:55:38Z","timestamp":1736654138000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0084788"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540558224"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/bfb0084788","relation":{},"subject":[]}}