{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T06:55:02Z","timestamp":1725519302388},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540883869"},{"type":"electronic","value":"9783540883876"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-88387-6_30","type":"book-chapter","created":{"date-parts":[[2008,10,10]],"date-time":"2008-10-10T05:42:45Z","timestamp":1223617365000},"page":"347-360","source":"Crossref","is-referenced-by-count":0,"title":["Deciding Bisimilarity of Full BPA Processes Locally"],"prefix":"10.1007","author":[{"given":"Lingyun","family":"Luo","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"30_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.C.M. Baeten","year":"1987","unstructured":"Baeten, J.C.M., Bergstra, J.A., Klop, J.W.: Decidability of bisimulation equivalence for process 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":"30_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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. Springer, Heidelberg (1995)"},{"issue":"4","key":"30_CR3","first-page":"339","volume":"24","author":"D. Caucal","year":"1990","unstructured":"Caucal, D.: Graphes canoniques de graphes alg\u00e9briques. Informatique Th\u00e9orique et Applications(RAIRO)\u00a024(4), 339\u2013352 (1990)","journal-title":"Informatique Th\u00e9orique et Applications(RAIRO)"},{"key":"30_CR4","series-title":"Lecture Notes in Computer Science","volume-title":"CONCUR \u201992","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. Springer, Heidelberg (1992)"},{"key":"30_CR5","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1016\/0020-0190(92)90142-I","volume":"42","author":"J.F. Groote","year":"1991","unstructured":"Groote, J.F.: A short proof of the decidability of bisimulation for normed bpa-processes. Inform. process. lett.\u00a042, 167\u2013171 (1991)","journal-title":"Inform. process. lett."},{"key":"30_CR6","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1016\/0304-3975(95)00064-X","volume":"15","author":"Y. Hirshfeld","year":"1996","unstructured":"Hirshfeld, Y., Jerrum, M., Moller, F.: A polynomial algorithm for deciding bisimulation of normed context-free processes. Theoretical Computer Science\u00a015, 143\u2013159 (1996)","journal-title":"Theoretical Computer Science"},{"key":"30_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1007\/978-3-540-48654-1_5","volume-title":"CONCUR \u201994: Concurrency Theory","author":"Y. Hirshfeld","year":"1994","unstructured":"Hirshfeld, Y., Moller, F.: A Fast Algorithm for Deciding Bisimilarity of Normed Context-Free Processes. In: Jonsson, B., Parrow, J. (eds.) CONCUR 1994. LNCS, vol.\u00a0836, pp. 48\u201363. Springer, Heidelberg (1994)"},{"key":"30_CR8","unstructured":"H\u00fcttel, H., Stirling, C.: Action speaks louder than words: Proving bisimilarity for context-free processes. In: Proceedings on Logic in Computer Science (1991)"},{"issue":"4","key":"30_CR9","doi-asserted-by":"publisher","first-page":"485","DOI":"10.1093\/logcom\/8.4.485","volume":"8","author":"H. H\u00fcttel","year":"1998","unstructured":"H\u00fcttel, H., Stirling, C.: Action speaks louder than words: Proving bisimilarity for context-free processes. Journal of Logic and Computation\u00a08(4), 485\u2013509 (1998)","journal-title":"Journal of Logic and Computation"},{"key":"30_CR10","doi-asserted-by":"publisher","first-page":"439","DOI":"10.1016\/0022-0000(84)90023-0","volume":"28","author":"R. Milner","year":"1984","unstructured":"Milner, R.: A complete inference system for a class of regular behaviours. Journal of Computer ans System Sciences\u00a028, 439\u2013466 (1984)","journal-title":"Journal of Computer ans System Sciences"},{"key":"30_CR11","series-title":"International Series in Computer Science","volume-title":"Communication and Concurrency","author":"R. Milner","year":"1989","unstructured":"Milner, R.: Communication and Concurrency. International Series in Computer Science. Prentice Hall, Englewood Cliffs (1989)"},{"key":"30_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"716","DOI":"10.1007\/3-540-45465-9_61","volume-title":"Proceedings of 29th International Colloquium on Automata, Languages and Programming (ICALP 2002)","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":"30_CR13","first-page":"163","volume":"78","author":"J. Srba","year":"2002","unstructured":"Srba, J.: Roadmap of Infinite Results. Bulletin of the European Association for Theoretical Computer Science, columns: Concurrency\u00a078, 163\u2013175 (2002)","journal-title":"Bulletin of the European Association for Theoretical Computer Science, columns: Concurrency"}],"container-title":["Lecture Notes in Computer Science","Automated Technology for Verification and Analysis"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-88387-6_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,3]],"date-time":"2019-03-03T16:49:28Z","timestamp":1551631768000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-88387-6_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540883869","9783540883876"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-88387-6_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}