On the computational power of brane calculi

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4220 LNBI, Issue , 2006, Pages 16-43

  Busi, Nadia ^a   Gorrieri, Roberto ^a  

^a UNIVERSITY OF BOLOGNA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

BRAIN; MATHEMATICAL MODELS; RANDOM PROCESSES; SIGNAL ENCODING;

BRANE CALCULI; RANDOM ACCESS MACHINES;

COMPUTATION THEORY;

EID: 38549095491     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11880646_2     Document Type: Conference Paper

References (17)

1. N. Busi. On the computational power of the Mate/Bud/Drip Brane Calculus: interleaving vs. maximal parallelism. Proc 6th International Workshop on Membrane Computing (WMC6), LNCS 3850, Springer, 2006.
2. N. Busi and G. Zavattaro. On the expressive power of movement and restriction in pure mobile ambients. Theoretical Computer Science, 322:477-515, 2004.
3. L. Cardelli. Brane Calculi - Interactions of biological membranes. Proc. Computational Methods in System Biology 2004 (CMSB 2004), LNCS 3082, Springer, 2005.
4. L. Cardelli. Abstract Machines for System Biology. Draft, 2005.
5. L. Cardelli and A.D. Gordon. Mobile Ambients. Theoretical Computer Science, 240(1):177-213, 2000.
6. L. Cardelli and G. Päun. An universality result for a (Mem)Brane Calculus based on mate/drip operations. International Journal of Foundations of Computer Science, to appear.
7. V. Danos and S. Pradalier. Projective Brane Calculus, Proc. Computational Methods in System Biology 2004 (CMSB 2004), LNCS 3082, Springer, 2005.
8. A. Finkel and Ph. Schnoebelen. Well-Structured Transition Systems Everywhere! Theoretical Computer Science, 256:63-92, Elsevier, 2001.
9. R. Freund. Asynchronous P Systems and P Systems Working in the Sequential Mode Proc. 5th International Workshop on Membrane Computing (WMC5), LNCS 3365, Springer, 2005.
10. G. Higman. Ordering by divisibility in abstract algebras. In Proc. London Math. Soc., vol. 2, pages 236-366, 1952.
11. O. H. Ibarra. Some Recent Results Concerning Deterministic P Systems. Proc 6th International Workshop on Membrane Computing (WMC6), LNCS 3850, Springer, 2006.
12. M.L. Minsky. Computation: finite and infinite machines. Prentice-Hall, 1967.
13. G. Pǎun. Membrane Computing. An Introduction. Springer, 2002.
14. G. Pǎun. Computing with membranes. Journal of Computer and System Sciences, 61(1):108-143, 2000.
15. C. Priami, A. Regev, W. Silverman, and E. Shapiro. Application of a stochastic passing-name calculus to representation and simulation of molecular processes. Information Processing Letter, 80:25-31, 2001.
16. A. Regev, E. M. Panina, W. Silverman, L. Cardelli, E. Shapiro. BioAmbients: An Abstraction for Biological Compartments. Theoretical Computer Science, 325(1):141-167, Elsevier, 2004.
17. J.C. Shepherdson and J.E. Sturgis. Computability of recursive functions. Journal of the ACM, 10:217-255, 1963.