{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,11]],"date-time":"2025-02-11T23:10:18Z","timestamp":1739315418381,"version":"3.37.0"},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642040801"},{"type":"electronic","value":"9783642040818"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"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":[[2009]]},"DOI":"10.1007\/978-3-642-04081-8_18","type":"book-chapter","created":{"date-parts":[[2009,8,31]],"date-time":"2009-08-31T16:27:08Z","timestamp":1251736028000},"page":"259-273","source":"Crossref","is-referenced-by-count":3,"title":["Partially-Commutative Context-Free Processes"],"prefix":"10.1007","author":[{"given":"Wojciech","family":"Czerwi\u0144ski","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sibylle","family":"Fr\u00f6schle","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S\u0142awomir","family":"Lasota","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"18_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 of infinite structures. In: Handbook of Process Algebra, pp. 545\u2013623. Elsevier, Amsterdam (2001)"},{"issue":"2","key":"18_CR2","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1006\/inco.1995.1129","volume":"121","author":"S. Christensen","year":"1995","unstructured":"Christensen, S., H\u00fcttel, H., Stirling, C.: Bisimulation equivalence is decidable for all context-free processes. Inf. Comput.\u00a0121(2), 143\u2013148 (1995)","journal-title":"Inf. Comput."},{"key":"18_CR3","unstructured":"Fr\u00f6schle, S., Lasota, S.: Normed processes, unique decomposition, and complexity of bisimulation equivalences. In: Proc. INFINITY 2006. ENTCS (2006) (to appear)"},{"key":"18_CR4","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)"},{"issue":"1-2","key":"18_CR5","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. Theor. Comput. Sci.\u00a0158(1-2), 143\u2013159 (1996)","journal-title":"Theor. Comput. Sci."},{"key":"18_CR6","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":"18_CR7","doi-asserted-by":"crossref","unstructured":"Jan\u010dar, P.: Bisimilarity of Basic Parallel Processes is PSPACE-complete. In: Proc. LICS 2003, pp. 218\u2013227 (2003)","DOI":"10.1109\/LICS.2003.1210061"},{"key":"18_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"434","DOI":"10.1007\/978-3-540-85361-9_34","volume-title":"CONCUR 2008 - Concurrency Theory","author":"P. Jan\u010dar","year":"2008","unstructured":"Jan\u010dar, P., Kot, M., Sawa, Z.: Normed BPA vs. Normed BPP revisited. In: van Breugel, F., Chechik, M. (eds.) CONCUR 2008. LNCS, vol.\u00a05201, pp. 434\u2013446. Springer, Heidelberg (2008)"},{"issue":"2","key":"18_CR9","first-page":"172","volume":"4","author":"M. Karpi\u0144ski","year":"1997","unstructured":"Karpi\u0144ski, M., Rytter, W., Shinohara, A.: An efficient pattern-matching algorithm for strings with short descriptions. Nord. J. Comput.\u00a04(2), 172\u2013186 (1997)","journal-title":"Nord. J. Comput."},{"key":"18_CR10","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)"}],"container-title":["Lecture Notes in Computer Science","CONCUR 2009 - Concurrency Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-04081-8_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,11]],"date-time":"2025-02-11T22:48:37Z","timestamp":1739314117000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-04081-8_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642040801","9783642040818"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-04081-8_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}