{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:56:30Z","timestamp":1725558990578},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540240143"},{"type":"electronic","value":"9783540305507"}],"license":[{"start":{"date-parts":[[2004,1,1]],"date-time":"2004-01-01T00:00:00Z","timestamp":1072915200000},"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":[[2004]]},"DOI":"10.1007\/978-3-540-30550-7_18","type":"book-chapter","created":{"date-parts":[[2010,7,2]],"date-time":"2010-07-02T19:06:05Z","timestamp":1278097565000},"page":"212-224","source":"Crossref","is-referenced-by-count":9,"title":["The Power of Maximal Parallelism in P Systems"],"prefix":"10.1007","author":[{"given":"Oscar H.","family":"Ibarra","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hsu-Chun","family":"Yen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhe","family":"Dang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"18_CR1","volume-title":"C.S.C. Memo 79, Project MAC","author":"H.G. Baker","year":"1973","unstructured":"Baker, H.G.: Rabin\u2019s proof of the undecidability of the reachability set inclusion problem for vector addition systems. In: C.S.C. Memo 79, Project MAC, MIT, Cambridge (1973)"},{"key":"18_CR2","unstructured":"Csuhaj-Varju, E., Dassow, J., Kelemen, J., Paun, Gh.: Grammar Systems: A Grammatical Approach to Distribution and Cooperation. Gordon and Breach Science Publishers, Inc. (1994)"},{"key":"18_CR3","unstructured":"Dang, Z., Ibarra, O.H.: On P systems operating in sequential and limited parallel modes. In: Pre-Proc. 6th Workshop on Descriptional Complexity of Formal Systems (2004)"},{"key":"18_CR4","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":"18_CR5","unstructured":"Freund, R.: Sequential P-systems (2000), Available at \n                    \n                      http:\/\/psystems.disco.unimib.it"},{"key":"18_CR6","unstructured":"Freund, R., Kari, L., Oswald, M., Sosik, P.: Computationally universal P systems without priorities: two catalysts are sufficient (2003), Available at \n                    \n                      http:\/\/psystems.disco.unimib.it"},{"key":"18_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1007\/3-540-36490-0_18","volume-title":"Membrane Computing","author":"R. Freund","year":"2003","unstructured":"Freund, R., Paun, A.: Membrane systems with symport\/antiport rules: universality results. In: P\u0103un, G., Rozenberg, G., Salomaa, A., Zandron, C. (eds.) WMC 2002. LNCS, vol.\u00a02597, pp. 270\u2013287. Springer, Heidelberg (2003)"},{"key":"18_CR8","volume-title":"C.S.C. Memo 121, Project MAC","author":"M.H. Hack","year":"1975","unstructured":"Hack, M.H.: The equality problem for vector addition systems is undecidable. In: C.S.C. Memo 121, Project MAC, MIT, Cambridge (1975)"},{"issue":"2","key":"18_CR9","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1016\/0304-3975(79)90041-0","volume":"8","author":"J. Hopcroft","year":"1979","unstructured":"Hopcroft, J., Pansiot, J.-J.: On the reachability problem for 5-dimensional vector addition systems. Theoretical Computer Science\u00a08(2), 135\u2013159 (1979)","journal-title":"Theoretical Computer Science"},{"key":"18_CR10","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/S0019-9958(83)80022-9","volume":"57","author":"D.T. Huynh","year":"1983","unstructured":"Huynh, D.T.: Commutative grammars: The complexity of uniform word problems. Information and Control\u00a057, 21\u201339 (1983)","journal-title":"Information and Control"},{"issue":"2-3","key":"18_CR11","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1016\/j.tcs.2003.10.028","volume":"312","author":"O. Ibarra","year":"2004","unstructured":"Ibarra, O., Dang, Z., Egecioglu, O.: Catalytic P systems, semilinear sets, and vector addition systems. Theoretical Computer Science\u00a0312(2-3), 379\u2013399 (2004)","journal-title":"Theoretical Computer Science"},{"key":"18_CR12","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1007\/BF00289268","volume":"15","author":"E. Mayr","year":"1981","unstructured":"Mayr, E.: Persistence of vector replacement systems is decidable. Acta Informat.\u00a015, 309\u2013318 (1981)","journal-title":"Acta Informat."},{"issue":"1","key":"18_CR13","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1006\/jcss.1999.1693","volume":"61","author":"G.. Paun","year":"2000","unstructured":"Paun, Gh.: Computing with membranes. Journal of Computer and System Sciences\u00a061(1), 108\u2013143 (2000)","journal-title":"Journal of Computer and System Sciences"},{"key":"18_CR14","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-56196-2","volume-title":"Membrane Computing: An Introduction","author":"G.. Paun","year":"2002","unstructured":"Paun, G.: Membrane Computing: An Introduction. Springer, Heidelberg (2002)"},{"issue":"1","key":"18_CR15","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/S0304-3975(02)00136-6","volume":"287","author":"G.. Paun","year":"2002","unstructured":"Paun, G., Rozenberg, G.: A guide to membrane computing. Theoretical Computer Science\u00a0287(1), 73\u2013100 (2002)","journal-title":"Theoretical Computer Science"},{"key":"18_CR16","series-title":"Lecture Notes in Computer Science","first-page":"371","volume-title":"Membrane Computing","author":"P. Sosik","year":"2002","unstructured":"Sosik, P.: P systems versus register machines: two universality proofs. In: P\u0103un, G., Rozenberg, G., Salomaa, A., Zandron, C. (eds.) WMC-CdeA 2002. LNCS, vol.\u00a02597, pp. 371\u2013382. Springer, Heidelberg (2002)"},{"key":"18_CR17","doi-asserted-by":"crossref","unstructured":"van Leeuwen, J.: A partial solution to the reachability problem for vector addition systems. In: Proceedings of STOC 1974, pp. 303\u2013309 (1974)","DOI":"10.1145\/800119.803908"}],"container-title":["Lecture Notes in Computer Science","Developments in Language Theory"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30550-7_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T19:31:09Z","timestamp":1558294269000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30550-7_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540240143","9783540305507"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30550-7_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}