{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,15]],"date-time":"2026-10-15T11:03:48Z","timestamp":1792062228277,"version":"4.4.0"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540457794","type":"print"},{"value":"9783540462361","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11880646_2","type":"book-chapter","created":{"date-parts":[[2006,11,17]],"date-time":"2006-11-17T09:13:44Z","timestamp":1163754824000},"page":"16-43","source":"Crossref","is-referenced-by-count":21,"title":["On the Computational Power of Brane Calculi"],"prefix":"10.1007","author":[{"given":"Nadia","family":"Busi","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Roberto","family":"Gorrieri","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"2_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1007\/11603047_10","volume-title":"Membrane Computing","author":"N. Busi","year":"2006","unstructured":"Busi, N.: On the Computational Power of the Mate\/Bud\/Drip Brane Calculus: Interleaving vs. Maximal Parallelism. In: Freund, R., P\u0103un, G., Rozenberg, G., Salomaa, A. (eds.) WMC 2005. LNCS, vol.\u00a03850, pp. 144\u2013158. Springer, Heidelberg (2006)"},{"key":"2_CR2","doi-asserted-by":"publisher","first-page":"477","DOI":"10.1016\/j.tcs.2003.10.040","volume":"322","author":"N. Busi","year":"2004","unstructured":"Busi, N., Zavattaro, G.: On the expressive power of movement and restriction in pure mobile ambients. Theoretical Computer Science\u00a0322, 477\u2013515 (2004)","journal-title":"Theoretical Computer Science"},{"key":"2_CR3","series-title":"Lecture Notes in Bioinformatics","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1007\/978-3-540-25974-9_24","volume-title":"Computational Methods in Systems Biology","author":"L. Cardelli","year":"2005","unstructured":"Cardelli, L.: Brane Calculi - Interactions of biological membranes. In: Danos, V., Schachter, V. (eds.) CMSB 2004. LNCS (LNBI), vol.\u00a03082, pp. 257\u2013278. Springer, Heidelberg (2005)"},{"key":"2_CR4","doi-asserted-by":"crossref","unstructured":"Cardelli, L.: Abstract Machines for System Biology. Draft (2005)","DOI":"10.1007\/11599128_10"},{"issue":"1","key":"2_CR5","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1016\/S0304-3975(99)00231-5","volume":"240","author":"L. Cardelli","year":"2000","unstructured":"Cardelli, L., Gordon, A.D.: Mobile Ambients. Theoretical Computer Science\u00a0240(1), 177\u2013213 (2000)","journal-title":"Theoretical Computer Science"},{"key":"2_CR6","doi-asserted-by":"crossref","unstructured":"Cardelli, L., P\u0103un, G.: An universality result for a (Mem) Brane Calculus based on mate\/drip operations. International Journal of Foundations of Computer Science (to appear)","DOI":"10.1142\/S0129054106003693"},{"key":"2_CR7","series-title":"Lecture Notes in Bioinformatics","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1007\/978-3-540-25974-9_11","volume-title":"Computational Methods in Systems Biology","author":"V. Danos","year":"2005","unstructured":"Danos, V., Pradalier, S.: Projective Brane Calculus. In: Danos, V., Schachter, V. (eds.) CMSB 2004. LNCS (LNBI), vol.\u00a03082, pp. 134\u2013148. Springer, Heidelberg (2005)"},{"key":"2_CR8","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/S0304-3975(00)00102-X","volume":"256","author":"A. Finkel","year":"2001","unstructured":"Finkel, A., Schnoebelen, P.: Well-Structured Transition Systems Everywhere! Theoretical Computer Science\u00a0256, 63\u201392 (2001)","journal-title":"Theoretical Computer Science"},{"key":"2_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1007\/978-3-540-31837-8_3","volume-title":"Membrane Computing","author":"R. Freund","year":"2005","unstructured":"Freund, R.: Asynchronous P Systems and P Systems Working in the Sequential Mode. In: Mauri, G., P\u0103un, G., Jes\u00fas P\u00e9rez-J\u00edmenez, M., Rozenberg, G., Salomaa, A. (eds.) WMC 2004. LNCS, vol.\u00a03365, pp. 36\u201362. Springer, Heidelberg (2005)"},{"key":"2_CR10","doi-asserted-by":"crossref","unstructured":"Higman, G.: Ordering by divisibility in abstract algebras. In: Proc. London Math. Soc., vol.\u00a02, pp. 236\u2013366 (1952)","DOI":"10.1112\/plms\/s3-2.1.326"},{"key":"2_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/11603047_3","volume-title":"Membrane Computing","author":"O.H. Ibarra","year":"2006","unstructured":"Ibarra, O.H.: Some Recent Results Concerning Deterministic P Systems. In: Freund, R., P\u0103un, G., Rozenberg, G., Salomaa, A. (eds.) WMC 2005. LNCS, vol.\u00a03850, pp. 49\u201354. Springer, Heidelberg (2006)"},{"key":"2_CR12","volume-title":"Computation: finite and infinite machines","author":"M.L. Minsky","year":"1967","unstructured":"Minsky, M.L.: Computation: finite and infinite machines. Prentice-Hall, Englewood Cliffs (1967)"},{"key":"2_CR13","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-56196-2","volume-title":"Membrane Computing. An Introduction","author":"G. P\u0103un","year":"2002","unstructured":"P\u0103un, G.: Membrane Computing. An Introduction. Springer, Heidelberg (2002)"},{"issue":"1","key":"2_CR14","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1006\/jcss.1999.1693","volume":"61","author":"G. P\u0103un","year":"2000","unstructured":"P\u0103un, G.: Computing with membranes. Journal of Computer and System Sciences\u00a061(1), 108\u2013143 (2000)","journal-title":"Journal of Computer and System Sciences"},{"key":"2_CR15","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/S0020-0190(01)00214-9","volume":"80","author":"C. Priami","year":"2001","unstructured":"Priami, C., Regev, A., Silverman, W., Shapiro, E.: Application of a stochastic passing-name calculus to representation and simulation of molecular processes. Information Processing Letter\u00a080, 25\u201331 (2001)","journal-title":"Information Processing Letter"},{"issue":"1","key":"2_CR16","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1016\/j.tcs.2004.03.061","volume":"325","author":"A. Regev","year":"2004","unstructured":"Regev, A., Panina, E.M., Silverman, W., Cardelli, L., Shapiro, E.: BioAmbients: An Abstraction for Biological Compartments. Theoretical Computer Science\u00a0325(1), 141\u2013167 (2004)","journal-title":"Theoretical Computer Science"},{"key":"2_CR17","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1145\/321160.321170","volume":"10","author":"J.C. Shepherdson","year":"1963","unstructured":"Shepherdson, J.C., Sturgis, J.E.: Computability of recursive functions. Journal of the ACM\u00a010, 217\u2013255 (1963)","journal-title":"Journal of the ACM"}],"container-title":["Lecture Notes in Computer Science","Transactions on Computational Systems Biology VI"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11880646_2.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:27:33Z","timestamp":1619508453000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11880646_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540457794","9783540462361"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/11880646_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006]]}}}