{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,21]],"date-time":"2025-01-21T05:27:26Z","timestamp":1737437246097,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540752905"},{"type":"electronic","value":"9783540752929"}],"license":[{"start":{"date-parts":[[2007,1,1]],"date-time":"2007-01-01T00:00:00Z","timestamp":1167609600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007]]},"DOI":"10.1007\/978-3-540-75292-9_23","type":"book-chapter","created":{"date-parts":[[2007,9,11]],"date-time":"2007-09-11T10:43:07Z","timestamp":1189507387000},"page":"337-350","source":"Crossref","is-referenced-by-count":1,"title":["Deciding Weak Bisimilarity of Normed Context-Free Processes Using Tableau"],"prefix":"10.1007","author":[{"given":"Xinxin","family":"Liu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Haiyan","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"23_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1007\/3-540-61604-7_56","volume-title":"CONCUR \u201996: Concurrency Theory","author":"F. Moller","year":"1996","unstructured":"Moller, F.: Infinite results. In: Sassone, V., Montanari, U. (eds.) CONCUR 1996. LNCS, vol.\u00a01119, pp. 195\u2013216. Springer, Heidelberg (1996)"},{"issue":"34","key":"23_CR2","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/s002360050074","volume":"97","author":"J. Esparza","year":"1997","unstructured":"Esparza, J.: Decidability of model checking for infinite-state concurrent systems. Acta Informatica\u00a097(34), 85\u2013107 (1997)","journal-title":"Acta Informatica"},{"key":"23_CR3","doi-asserted-by":"crossref","unstructured":"burkart, O., Esparza, J.: More infinite results. Electronic Notes in Theoretical computer Science 5 (1997)","DOI":"10.1016\/S1571-0661(05)80680-2"},{"issue":"40","key":"23_CR4","doi-asserted-by":"crossref","first-page":"653","DOI":"10.1145\/174130.174141","volume":"93","author":"J.C.M. Baeten","year":"1993","unstructured":"Baeten, J.C.M., Bergstra, J.A., Klop, J.W.: Decidability of bisimulation equivalence for processes generating context-free languages. Journal of the Association for Computing Machinery\u00a093(40), 653\u2013682 (1993)","journal-title":"Journal of the Association for Computing Machinery"},{"issue":"121","key":"23_CR5","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1006\/inco.1995.1129","volume":"95","author":"S. Christensen","year":"1995","unstructured":"Christensen, S., H\u00fcttel, H., Stirling, C.: Bisimulation equivalence is decidable for all context-free processes. Information and Computation\u00a095(121), 143\u2013148 (1995)","journal-title":"Information and Computation"},{"key":"23_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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_CR7","series-title":"Formal Models and Semantics","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1142\/9789812562494_0054","volume-title":"Current Trends in Theoretical Computer Science, The Challenge of the New Century","author":"J. Srba","year":"2004","unstructured":"Srba, J.: Roadmap of Infinite Results. In: Current Trends in Theoretical Computer Science, The Challenge of the New Century. Formal Models and Semantics, vol.\u00a02, pp. 337\u2013350. World Scientific Publishing Co., Singapore (2004)"},{"key":"23_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1007\/3-540-60249-6_54","volume-title":"Fundamentals of Computation Theory","author":"J. Esparza","year":"1995","unstructured":"Esparza, J.: Petri nets,commutative context-free grammars, and basic parallel processes. In: Reichel, H. (ed.) FCT 1995. LNCS, vol.\u00a0965, pp. 221\u2013232. Springer, Heidelberg (1995)"},{"key":"23_CR9","doi-asserted-by":"crossref","unstructured":"Hirshfeld, Y.: Bisimulation trees and the decidability of weak bisimulations. In: INFINITY 1996. Proceedings of the 1st International Workshop on Verification of Infinite State Systems, Germany, vol.\u00a05 (1996)","DOI":"10.1016\/S1571-0661(05)80674-7"},{"key":"23_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1007\/3-540-61604-7_57","volume-title":"CONCUR \u201996: Concurrency Theory","author":"C. Stirling","year":"1996","unstructured":"Stirling, C.: Decidability of bisimulation equivalence for normed pushdown processes. In: Sassone, V., Montanari, U. (eds.) CONCUR 1996. LNCS, vol.\u00a01119, pp. 217\u2013232. Springer, Heidelberg (1996)"},{"key":"23_CR11","doi-asserted-by":"crossref","unstructured":"H\u00fcttel, H., Stirling, C.: Actions speak louder than words. Proving bisimilarity for context-free processes. In: LICS 1991. Proceedings of 6th Annual symposium on Logic in Computer Science, Amsterdam, pp. 376\u2013386 (1991)","DOI":"10.1109\/LICS.1991.151661"},{"key":"23_CR12","series-title":"Lecture Notes in Computer Science","first-page":"2","volume-title":"Computer Aided Verification","author":"H.. Hans","year":"1992","unstructured":"Hans, 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","unstructured":"Mayr, R.: Weak bisimulation and regularity of BPA is EXPTIME-hard. In: EXPRESS\u201903. Proceedings of the 10th International Workshop on Expressiveness in Concurrency, France, pp. 143\u2013160 (2003)"},{"key":"23_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-10235-3","volume-title":"A Calculus of Communication Systems","author":"R. Milner","year":"1980","unstructured":"Milner, R.: A Calculus of Communication Systems. LNCS, vol.\u00a092. Springer, Heidelberg (1980)"},{"key":"23_CR15","volume-title":"Communication and Concurrency","author":"R. Milner","year":"1989","unstructured":"Milner, R.: Communication and Concurrency. Prentice-Hall International, Englewood Cliffs (1989)"},{"key":"23_CR16","doi-asserted-by":"crossref","unstructured":"Bergstra, J.A., Klop, J.W.: Process theory based on bisimulation semantics. In: Proceedings of REX Workshop, Amsterdam, The Netherlands, pp. 50\u2013122 (1988)","DOI":"10.1007\/BFb0013021"},{"issue":"4","key":"23_CR17","first-page":"339","volume":"90-24","author":"D. Caucal","year":"1990","unstructured":"Caucal, D.: Graphes canoniques de graphes alg\u00e9briques. Informatique th\u00e9orique et Applications (RAIRO)\u00a090-24(4), 339\u2013352 (1990)","journal-title":"Informatique th\u00e9orique et Applications (RAIRO)"},{"key":"23_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"412","DOI":"10.1007\/3-540-48523-6_38","volume-title":"Automata, Languages and Programming","author":"Y. Hirshfeld","year":"1999","unstructured":"Hirshfeld, Y., Jerrum, M., Moller, F.: Bisimulation equivalence is decidable for normed process algebra. In: Wiedermann, J., van Emde Boas, P., Nielsen, M. (eds.) ICALP 1999. LNCS, vol.\u00a01644, pp. 412\u2013421. Springer, Heidelberg (1999)"}],"container-title":["Lecture Notes in Computer Science","Theoretical Aspects of Computing \u2013 ICTAC 2007"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-75292-9_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,20]],"date-time":"2025-01-20T23:14:08Z","timestamp":1737414848000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-75292-9_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540752905","9783540752929"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-75292-9_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2007]]}}}