{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:28:20Z","timestamp":1761611300201},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540616047"},{"type":"electronic","value":"9783540706250"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/3-540-61604-7_57","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T22:02:50Z","timestamp":1330293770000},"page":"217-232","source":"Crossref","is-referenced-by-count":20,"title":["Decidability of bisimulation equivalence for normed pushdown processes"],"prefix":"10.1007","author":[{"given":"Colin","family":"Stirling","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,2]]},"reference":[{"key":"14_CR1","doi-asserted-by":"crossref","first-page":"94","DOI":"10.1007\/3-540-17945-3_5","volume":"259","author":"J. Baeten","year":"1987","unstructured":"Baeten, J., Bergstra, J., and Klop, J. (1987). Decidability of bisimulation equivalence for processes generating context-free languages. Lecture Notes in Computer Science, 259, 94\u2013113.","journal-title":"Lecture Notes in Computer Science"},{"key":"14_CR2","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 of Computing Machinery, 40, 653\u2013682.","journal-title":"Journal of Association of Computing Machinery"},{"key":"14_CR3","first-page":"89","volume":"2","author":"O. Burkart","year":"1995","unstructured":"Burkart, O., and Steffen, B. (1995). Composition, decomposition, and model checking of pushdown processes. Nordic Journal of Computing, 2, 89\u2013125.","journal-title":"Nordic Journal of Computing"},{"key":"14_CR4","volume-title":"Tech. Report 94-28","author":"O. Burkart","year":"1994","unstructured":"Burkart, O., Caucal, D., and Steffen, B. (1994). An elementary decision procedure for arbitrary context-free processes. Tech. Report 94-28, RWTH Aachen."},{"key":"14_CR5","first-page":"339","volume":"24","author":"D. Caucal","year":"1990","unstructured":"Caucal, D. (1990). Graphes canoniques de graphes alg\u00e9briques. Informatique Th\u00e9orique et Applications (RAIRO), 24, 339\u2013352.","journal-title":"Informatique Th\u00e9orique et Applications (RAIRO)"},{"key":"14_CR6","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1016\/0304-3975(92)90278-N","volume":"106","author":"D. Caucal","year":"1992","unstructured":"Caucal, D. (1992). On the regular structure of prefix rewriting. Theoretical Computer Science, 106, 61\u201386.","journal-title":"Theoretical Computer Science"},{"key":"14_CR7","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1007\/3-540-53832-1_51","volume":"484","author":"D. Caucal","year":"1990","unstructured":"Caucal, D., and Monfort, R. (1990). On the transition graphs of automata and grammars. Lecture Notes in Computer Science, 484, 311\u2013337.","journal-title":"Lecture Notes in Computer Science"},{"key":"14_CR8","doi-asserted-by":"crossref","unstructured":"Christensen, S., Hirshfeld, Y., and Moller, F. (1993). Decomposability, decidability and axiomatisability for bisimulation equivalence on basic parallel processes. Proceedings 8th Annual Symposium on Logic in Computer Science, IEEE Computer Science Press.","DOI":"10.1109\/LICS.1993.287569"},{"key":"14_CR9","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1007\/3-540-57208-2_11","volume":"715","author":"S. Christensen","year":"1993","unstructured":"Christensen, S., Hirshfeld, Y., and Moller, F. (1993). Bisimulation is decidable for basic parallel processes. Lecture Notes in Computer Science, 715, 143\u2013157.","journal-title":"Lecture Notes in Computer Science"},{"key":"14_CR10","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1006\/inco.1995.1129","volume":"121","author":"S. Christensen","year":"1995","unstructured":"Christensen, S., H\u00fcttel, 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":"14_CR11","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1016\/0020-0190(92)90142-I","volume":"42","author":"J. Groote","year":"1992","unstructured":"Groote, J. (1992). A short proof of the decidability of bisimulation for normed BPA processes. Information Processing Letters, 42, 167\u2013171.","journal-title":"Information Processing Letters"},{"key":"14_CR12","doi-asserted-by":"crossref","unstructured":"Groote, J., and H\u00fcttel, H. (1994). Undecidable equivalences for basic process algebra. Information and Computation.","DOI":"10.1006\/inco.1994.1101"},{"key":"14_CR13","unstructured":"Hirshfeld, Y. (1994). Deciding equivalences in simple process algebras. Tech. Report ECS-LFCS-94-294, Edinburgh University."},{"key":"14_CR14","doi-asserted-by":"crossref","unstructured":"Hirshfeld, Y., Jerrum, M., and Moller, F. (1994). A polynomial algorithm for deciding bisimilarity of normed context-free processes. Procs. IEEE 35th Annual Symposium on Foundations of Computer Science, 623\u2013631.","DOI":"10.1109\/SFCS.1994.365729"},{"key":"14_CR15","unstructured":"Hopcroft, J., and Ullman, J. (1979). Introduction to Automata Theory, Languages, and Computation, Addison-Wesley."},{"key":"14_CR16","unstructured":"H\u00fcttel, H. (1993). Undecidable equivalences for basic parallel processes. Tech. Report ECS-LFCS-93-276, Edinburgh University."},{"key":"14_CR17","doi-asserted-by":"crossref","unstructured":"H\u00fcttel, 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":"14_CR18","doi-asserted-by":"crossref","first-page":"581","DOI":"10.1007\/3-540-57785-8_173","volume":"775","author":"P. Jan\u010dar","year":"1994","unstructured":"Jan\u010dar, P. (1994). Decidability questions for bisimilarity of Petri nets and some related problems. Lecture Notes in Computer Science, 775, 581\u2013594.","journal-title":"Lecture Notes in Computer Science"},{"key":"14_CR19","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1016\/0304-3975(85)90087-8","volume":"37","author":"D. Muller","year":"1985","unstructured":"Muller, D., and Schupp, P. (1985). The theory of ends, pushdown automata, and second-order logic. Theoretical Computer Science, 37, 51\u201375.","journal-title":"Theoretical Computer Science"},{"key":"14_CR20","doi-asserted-by":"crossref","first-page":"90","DOI":"10.1016\/S0019-9958(80)90887-6","volume":"45","author":"M. Oyamuguchi","year":"1980","unstructured":"Oyamuguchi, M., Honda, N., and Inagaki, Y. (1980). The equivalence problem for real-time strict deterministic languages. Information and Control, 45, 90\u2013115.","journal-title":"Information and Control"}],"container-title":["Lecture Notes in Computer Science","CONCUR '96: Concurrency Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-61604-7_57.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:08:29Z","timestamp":1605647309000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-61604-7_57"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540616047","9783540706250"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/3-540-61604-7_57","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1996]]}}}