{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,9]],"date-time":"2026-05-09T04:32:26Z","timestamp":1778301146009,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540418641","type":"print"},{"value":"9783540453154","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-45315-6_25","type":"book-chapter","created":{"date-parts":[[2007,12,3]],"date-time":"2007-12-03T01:28:39Z","timestamp":1196645319000},"page":"379-393","source":"Crossref","is-referenced-by-count":8,"title":["Decidability of Weak Bisimilarity for a Subset of Basic Parallel Processes"],"prefix":"10.1007","author":[{"given":"Colin","family":"Stirling","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,3,23]]},"reference":[{"key":"25_CR1","doi-asserted-by":"crossref","first-page":"653","DOI":"10.1145\/174130.174141","volume":"40","author":"J. Baeten","year":"1993","unstructured":"Baeten, J., Bergstra, J. and Klop, J. (1993). Decidability of bisimulation equivalence for processes generating context-free languages. Journal of Association for computing Machinery, 40, 653\u2013682.","journal-title":"Journal of Association for computing Machinery"},{"key":"25_CR2","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"194","DOI":"10.1007\/3-540-61440-0_128","volume-title":"On infinite transition graphs having a decidable monadic theory","author":"D. Caucal","year":"1996","unstructured":"Caucal, D. (1996). On infinite transition graphs having a decidable monadic theory. Lecture Notes in Computer Science, 1099, 194\u2013205."},{"key":"25_CR3","unstructured":"Christensen, S. (1993). Decidability and Decomposition in Process Algebras. Ph.D thesis University of Edinburgh, Tech Report ECS-LFCS-93-278."},{"key":"25_CR4","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1007\/3-540-57208-2_11","volume-title":"Bisimulation equivalence is decidable for all basic parallel processes","author":"S. Christensen","year":"1993","unstructured":"Christensen, S., Hirshfeld, Y. and Moller, F. (1993). Bisimulation equivalence is decidable for all basic parallel processes. Lecture Notes in Computer Science, 715, 143\u2013157."},{"key":"25_CR5","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1006\/inco.1995.1129","volume":"121","author":"S. Christensen","year":"1995","unstructured":"Christensen, S., Huttel, H., and Stirling, C. (1995). Bisimulation equivalence is decidable for all context-free processes. Information and Computation, 121, 143\u2013148.","journal-title":"Information and Computation"},{"key":"25_CR6","first-page":"23","volume":"30","author":"J. Esparza","year":"1997","unstructured":"Esparza, J. (1997). Petri nets, commutative context-free grammars, and basic parallel processes. Fundamenta Informaticae, 30, 23\u201341.","journal-title":"Fundamenta Informaticae"},{"key":"25_CR7","unstructured":"Hirshfeld, Y. (1996). Bisimulation trees and the decidability of weak bisimilarity. Electronic Notes in Theoretical Computer Science, 5."},{"key":"25_CR8","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1017\/S0960129500000992","volume":"6","author":"Y. Hirshfeld","year":"1996","unstructured":"Hirshfeld, Y., Jerrum, M. and Moller, F. (1996). A polynomial-time algorithm for deciding equivalence of normed basic parallel processes. Journal of Mathematical Structures in Computer Science, 6, 251\u2013259.","journal-title":"Journal of Mathematical Structures in Computer Science"},{"key":"25_CR9","series-title":"Lect Notes Comput Sci","first-page":"2","volume-title":"Silence is golden: branching bisimilarity is decidable for context-free processes","author":"H. Huttel","year":"1991","unstructured":"Huttel, H. (1991). Silence is golden: branching bisimilarity is decidable for context-free processes. Lecture Notes in Computer Science, 575, 2\u201312."},{"key":"25_CR10","doi-asserted-by":"crossref","unstructured":"Huttel, H., and Stirling, C. (1991). Actions speak louder than words: proving bisimilarity for context free processes. Proceedings 6th Annual Symposium on Logic in Computer Science, IEEE Computer Science Press, 376\u2013386.","DOI":"10.1109\/LICS.1991.151661"},{"key":"25_CR11","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1016\/0304-3975(95)00037-W","volume":"148","author":"P. Jan\u010dar","year":"1995","unstructured":"Jan\u010dar, P. (1995). Undecidability of bisimilarity for Petri nets and some related problems. Theoretical Computer Science, 148, 281\u2013301.","journal-title":"Theoretical Computer Science"},{"key":"25_CR12","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"200","DOI":"10.1007\/BFb0055053","volume-title":"Deciding bisimulation-like equivalences with finite-state processes","author":"P. Jan\u010dar","year":"1998","unstructured":"Jan\u010dar, P., Ku\u010dera, A. and Mayr, R. (1998). Deciding bisimulation-like equivalences with finite-state processes. Lecture Notes in Computer Science, 1443, 200\u2013211."},{"key":"25_CR13","unstructured":"Milner, R. (1989) Communication and Concurrency. Prentice-Hall."},{"key":"25_CR14","first-page":"120","volume":"98","author":"G. S\u00e9nizergues","year":"1998","unstructured":"S\u00e9nizergues, G. (1998). Decidability of bisimulation equivalence for equational graphs of finite out-degree. Procs. IEEE FOCS\u201998, 120\u2013129.","journal-title":"Procs. IEEE FOCS\u2019"},{"key":"25_CR15","unstructured":"St\u0159\u00edbrn\u00e1, J. (1999). Decidability and complexity of equivalences for simple process algebras. Ph.D thesis, University of Edinburgh, Tech. Report ECS-LFCS-99-408."},{"key":"25_CR16","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1016\/S0304-3975(97)00216-8","volume":"195","author":"C. Stirling","year":"1998","unstructured":"Stirling, C. (1998). Decidability of bisimulation equivalence for normed pushdown processes. Theoretical Computer Science, 195, 113\u2013131.","journal-title":"Theoretical Computer Science"}],"container-title":["Lecture Notes in Computer Science","Foundations of Software Science and Computation Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45315-6_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,26]],"date-time":"2019-02-26T00:37:57Z","timestamp":1551141477000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45315-6_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540418641","9783540453154"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/3-540-45315-6_25","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2001]]}}}