{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,8]],"date-time":"2026-02-08T19:28:12Z","timestamp":1770578892668,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642392115","type":"print"},{"value":"9783642392122","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-39212-2_23","type":"book-chapter","created":{"date-parts":[[2013,7,2]],"date-time":"2013-07-02T13:09:19Z","timestamp":1372770559000},"page":"238-249","source":"Crossref","is-referenced-by-count":3,"title":["Checking Equality and Regularity for Normed BPA with Silent Moves"],"prefix":"10.1007","author":[{"given":"Yuxi","family":"Fu","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"23_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1007\/3-540-17945-3_5","volume-title":"PARLE Parallel Architectures and Languages Europe","author":"J. Baeten","year":"1987","unstructured":"Baeten, J., Bergstra, J., Klop, J.: Decidability of bisimulation equivalence for processes generating context-free languages. In: de Bakker, J.W., Nijman, A.J., Treleaven, P.C. (eds.) PARLE 1987. LNCS, vol.\u00a0259, pp. 94\u2013113. Springer, Heidelberg (1987)"},{"key":"23_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1007\/3-540-60246-1_148","volume-title":"Mathematical Foundations of Computer Science 1995","author":"O. Burkart","year":"1995","unstructured":"Burkart, O., Caucal, D., Steffen, B.: An elementary bisimulation decision procedure for arbitrary context free processes. In: H\u00e1jek, P., Wiedermann, J. (eds.) MFCS 1995. LNCS, vol.\u00a0969, pp. 423\u2013433. Springer, Heidelberg (1995)"},{"key":"23_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1007\/3-540-61604-7_59","volume-title":"CONCUR 1996: Concurrency Theory","author":"O. Burkart","year":"1996","unstructured":"Burkart, O., Caucal, D., Steffen, B.: Bisimulation collapse and the process taxonomy. In: Sassone, V., Montanari, U. (eds.) CONCUR 1996. LNCS, vol.\u00a01119, pp. 247\u2013262. Springer, Heidelberg (1996)"},{"key":"23_CR4","doi-asserted-by":"publisher","first-page":"638","DOI":"10.1007\/BF03180566","volume":"4","author":"J. Balcazar","year":"1992","unstructured":"Balcazar, J., Gabarro, J., Santha, M.: Deciding bisimilarity is p-complete. Formal Aspects of Computing\u00a04, 638\u2013648 (1992)","journal-title":"Formal Aspects of Computing"},{"key":"23_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"528","DOI":"10.1007\/978-3-642-23217-6_35","volume-title":"CONCUR 2011 \u2013 Concurrency Theory","author":"W. Czerwi\u0144ski","year":"2011","unstructured":"Czerwi\u0144ski, W., Hofman, P., Lasota, S.: Decidability of branching bisimulation on normed commutative context-free processes. In: Katoen, J.-P., K\u00f6nig, B. (eds.) CONCUR 2011. LNCS, vol.\u00a06901, pp. 528\u2013542. Springer, Heidelberg (2011)"},{"key":"23_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"138","DOI":"10.1007\/BFb0084788","volume-title":"CONCUR 1992","author":"S. Christensen","year":"1992","unstructured":"Christensen, S., H\u00fcttel, H., Stirling, C.: Bisimulation equivalence is decidable for all context-free processes. In: Cleaveland, W.R. (ed.) CONCUR 1992. LNCS, vol.\u00a0630, pp. 138\u2013147. Springer, Heidelberg (1992)"},{"key":"23_CR7","doi-asserted-by":"publisher","first-page":"306","DOI":"10.1006\/inco.1995.1069","volume":"118","author":"D. Caucal","year":"1995","unstructured":"Caucal, D., Huynh, D., Tian, L.: Deciding branching bisimilarity of normed context-free processes is in $\\sigma^p_2$ . Information and Computation\u00a0118, 306\u2013315 (1995)","journal-title":"Information and Computation"},{"key":"23_CR8","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1016\/S1571-0661(05)80674-7","volume":"5","author":"Y. Hirshfeld","year":"1996","unstructured":"Hirshfeld, Y.: Bisimulation trees and the decidability of weak bisimulations. Electronic Notes in Theoretical Computer Science\u00a05, 2\u201313 (1996)","journal-title":"Electronic Notes in Theoretical Computer Science"},{"issue":"1-2","key":"23_CR9","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1016\/0304-3975(95)00064-X","volume":"158","author":"Y. Hirshfeld","year":"1996","unstructured":"Hirshfeld, Y., Jerrum, M., Moller, F.: A polynomial algorithm for deciding bisimilarity of normed context free processes. Theoretical Computer Science\u00a0158(1-2), 143\u2013159 (1996)","journal-title":"Theoretical Computer Science"},{"key":"23_CR10","unstructured":"H\u00fcttel, H., Stirling, C.: Actions speak louder than words: Proving bisimilarity for context-free processes. In: LICS 1991, pp. 376\u2013386 (1991)"},{"key":"23_CR11","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1016\/0304-3975(92)00078-6","volume":"123","author":"T. Huynh","year":"1994","unstructured":"Huynh, T., Tian, L.: Deciding bisimilarity of normed context free processes is in $\\sigma_{2}^{p}$ . Theoretical Computer Science\u00a0123, 83\u2013197 (1994)","journal-title":"Theoretical Computer Science"},{"key":"23_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1007\/3-540-55179-4_2","volume-title":"Computer Aided Verification","author":"H. H\u00fcttel","year":"1992","unstructured":"H\u00fcttel, H.: Silence is golden: Branching bisimilarity is decidable for context free processes. In: Larsen, K.G., Skou, A. (eds.) CAV 1991. LNCS, vol.\u00a0575, pp. 2\u201312. Springer, Heidelberg (1992)"},{"key":"23_CR13","doi-asserted-by":"crossref","unstructured":"Jan\u010dar, P.: Bisimilarity on basic process algebra is in 2-exptime (2012)","DOI":"10.2168\/LMCS-9(1:10)2013"},{"key":"23_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"478","DOI":"10.1007\/3-540-61440-0_152","volume-title":"Automata, Languages and Programming","author":"P. Jan\u010dar","year":"1996","unstructured":"Jan\u010dar, P., Esparza, J.: Deciding finiteness of petri nets up to bisimulation. In: Meyer auf der Heide, F., Monien, B. (eds.) ICALP 1996. LNCS, vol.\u00a01099, pp. 478\u2013489. Springer, Heidelberg (1996)"},{"key":"23_CR15","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1016\/j.ipl.2012.12.004","volume":"113","author":"S. Kiefer","year":"2013","unstructured":"Kiefer, S.: BPA bisimilarity is exptime-hard. Information Processing Letters\u00a0113, 101\u2013106 (2013)","journal-title":"Information Processing Letters"},{"key":"23_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1007\/BFb0037420","volume-title":"SOFSEM 1996: Theory and Practice of Informatics","author":"A. Ku\u010dera","year":"1996","unstructured":"Ku\u010dera, A.: Regularity is decidable for normed BPA and normed BPP processes in polynomial time. In: Kr\u00e1l, J., Bartosek, M., Jeffery, K. (eds.) SOFSEM 1996. LNCS, vol.\u00a01175, pp. 377\u2013384. Springer, Heidelberg (1996)"},{"key":"23_CR17","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1006\/inco.1999.2826","volume":"156","author":"R. Mayr","year":"2000","unstructured":"Mayr, R.: Process rewrite systems. Information and Computation\u00a0156, 264\u2013286 (2000)","journal-title":"Information and Computation"},{"key":"23_CR18","doi-asserted-by":"crossref","unstructured":"Mayr, R.: Weak bisimilarity and regularity of BPA is exptime-hard. In: EXPRESS 2003 (2003)","DOI":"10.1016\/j.entcs.2004.04.026"},{"key":"23_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"716","DOI":"10.1007\/3-540-45465-9_61","volume-title":"Automata, Languages and Programming","author":"J. Srba","year":"2002","unstructured":"Srba, J.: Strong bisimilarity and regularity of basic process algebra is pspace-hard. In: Widmayer, P., Triguero, F., Morales, R., Hennessy, M., Eidenbenz, S., Conejo, R. (eds.) ICALP 2002. LNCS, vol.\u00a02380, pp. 716\u2013727. Springer, Heidelberg (2002)"},{"key":"23_CR20","doi-asserted-by":"publisher","first-page":"567","DOI":"10.1017\/S0960129503003992","volume":"13","author":"J. Srba","year":"2003","unstructured":"Srba, J.: Complexity of weak bisimilarity and regularity for BPA and BPP. Mathematical Structures in Computer Science\u00a013, 567\u2013587 (2003)","journal-title":"Mathematical Structures in Computer Science"},{"key":"23_CR21","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1016\/S1571-0661(05)80259-2","volume":"18","author":"J. St\u0159\u00edbrn\u00e1","year":"1998","unstructured":"St\u0159\u00edbrn\u00e1, J.: Hardness results for weak bisimilarity of simple process algebras. Electronic Notes in Theoretical Computer Science\u00a018, 179\u2013190 (1998)","journal-title":"Electronic Notes in Theoretical Computer Science"},{"key":"23_CR22","unstructured":"van Glabbeek, R., Weijland, W.: Branching time and abstraction in bisimulation semantics. In: Information Processing 1989, pp. 613\u2013618. North-Holland (1989)"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages, and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-39212-2_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,2,27]],"date-time":"2022-02-27T01:16:16Z","timestamp":1645924576000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-39212-2_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642392115","9783642392122"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-39212-2_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013]]}}}