{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T01:39:41Z","timestamp":1760146781362},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540853602"},{"type":"electronic","value":"9783540853619"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-85361-9_34","type":"book-chapter","created":{"date-parts":[[2008,8,18]],"date-time":"2008-08-18T12:28:04Z","timestamp":1219062484000},"page":"434-446","source":"Crossref","is-referenced-by-count":2,"title":["Normed BPA vs. Normed BPP Revisited"],"prefix":"10.1007","author":[{"given":"Petr","family":"Jan\u010dar","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Martin","family":"Kot","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zden\u011bk","family":"Sawa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"34_CR1","doi-asserted-by":"publisher","first-page":"545","DOI":"10.1016\/B978-044482830-9\/50027-8","volume-title":"Handbook of Process Algebra","author":"O. Burkart","year":"2001","unstructured":"Burkart, O., Caucal, D., Moller, F., Steffen, B.: Verification on infinite structures. In: Bergstra, J., Ponse, A., Smolka, S. (eds.) Handbook of Process Algebra, pp. 545\u2013623. Elsevier, Amsterdam (2001)"},{"key":"34_CR2","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), \n                    \n                      http:\/\/www.brics.dk\/~srba\/roadmap\/"},{"key":"34_CR3","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.: 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)"},{"key":"34_CR4","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 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":"34_CR5","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":"34_CR6","first-page":"218","volume-title":"Proc. 18th LiCS","author":"P. Jan\u010dar","year":"2003","unstructured":"Jan\u010dar, P.: Strong bisimilarity on Basic Parallel Processes is PSPACE-complete. In: Proc. 18th LiCS, pp. 218\u2013227. IEEE Computer Society, Los Alamitos (2003)"},{"key":"34_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"535","DOI":"10.1007\/3-540-45841-7_44","volume-title":"STACS 2002","author":"J. Srba","year":"2002","unstructured":"Srba, J.: Strong bisimilarity and regularity of Basic Parallel Processes is PSPACE-hard. In: Alt, H., Ferreira, A. (eds.) STACS 2002. LNCS, vol.\u00a02285, pp. 535\u2013546. Springer, Heidelberg (2002)"},{"key":"34_CR8","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, 143\u2013159 (1996)","journal-title":"Theoretical Computer Science"},{"key":"34_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"646","DOI":"10.1007\/11821069_56","volume-title":"Mathematical Foundations of Computer Science 2006","author":"S. Lasota","year":"2006","unstructured":"Lasota, S., Rytter, W.: Faster algorithm for bisimulation equivalence of normed context-free processes. In: Kr\u00e1lovi\u010d, R., Urzyczyn, P. (eds.) MFCS 2006. LNCS, vol.\u00a04162, pp. 646\u2013657. Springer, Heidelberg (2006)"},{"key":"34_CR10","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1017\/S0960129500000992","volume":"6","author":"Y. Hirshfeld","year":"1996","unstructured":"Hirshfeld, Y., Jerrum, M., Moller, F.: A polynomial-time algorithm for deciding bisimulation equivalence of normed Basic Parallel Processes. Mathematical Structures in Computer Science\u00a06, 251\u2013259 (1996)","journal-title":"Mathematical Structures in Computer Science"},{"key":"34_CR11","unstructured":"Jan\u010dar, P., Kot, M.: Bisimilarity on normed Basic Parallel Processes can be decided in time O(n\n                           3). In: Bharadwaj, R. (ed.) Proceedings of the Third International Workshop on Automated Verification of Infinite-State Systems \u2013 AVIS 2004 (2004)"},{"key":"34_CR12","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1007\/s002360050159","volume":"36","author":"I. \u010cern\u00e1","year":"1999","unstructured":"\u010cern\u00e1, I., K\u0159et\u00ednsk\u00fd, M., Ku\u010dera, A.: Comparing expressibility of normed BPA and normed BPP processes. Acta Informatica\u00a036, 233\u2013256 (1999)","journal-title":"Acta Informatica"},{"key":"34_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1007\/978-3-540-45187-7_10","volume-title":"CONCUR 2003 - Concurrency Theory","author":"P. Jan\u010dar","year":"2003","unstructured":"Jan\u010dar, P., Ku\u010dera, A., Moller, F.: Deciding bisimilarity between BPA and BPP processes. In: Amadio, R., Lugiez, D. (eds.) CONCUR 2003. LNCS, vol.\u00a02761, pp. 159\u2013173. Springer, Heidelberg (2003)"},{"key":"34_CR14","doi-asserted-by":"crossref","first-page":"667","DOI":"10.1016\/S0304-3975(01)00094-9","volume":"270","author":"A. Ku\u010dera","year":"2002","unstructured":"Ku\u010dera, A., Mayr, R.: Weak bisimilarity between finite-state systems and BPA or normed BPP is decidable in polynomial time. Theoretical Computer Science\u00a0270, 667\u2013700 (2002)","journal-title":"Theoretical Computer Science"},{"key":"34_CR15","first-page":"395","volume-title":"IFIP TCS","author":"A. Ku\u010dera","year":"2004","unstructured":"Ku\u010dera, A., Mayr, R.: A generic framework for checking semantic equivalences between pushdown automata and finite-state automata. In: IFIP TCS, pp. 395\u2013408. Kluwer, Dordrecht (2004)"}],"container-title":["Lecture Notes in Computer Science","CONCUR 2008 - Concurrency Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-85361-9_34","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,3]],"date-time":"2019-03-03T01:11:27Z","timestamp":1551575487000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-85361-9_34"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540853602","9783540853619"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-85361-9_34","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}