Computability of Recursive Functions
Journal of the ACM (JACM)
Theoretical Computer Science
Journal of Computer and System Sciences
Well-structured transition systems everywhere!
Theoretical Computer Science
Information Processing Letters
Membrane Computing: An Introduction
Membrane Computing: An Introduction
On the expressive power of movement and restriction in pure mobile ambients
Theoretical Computer Science - Special issue: Foundations of wide area network computing
BioAmbients: an abstraction for biological compartments
Theoretical Computer Science - Special issue: Computational systems biology
Computation: finite and infinite machines
Computation: finite and infinite machines
Some recent results concerning deterministic p systems
WMC'05 Proceedings of the 6th international conference on Membrane Computing
On the computational power of the mate/bud/drip brane calculus: interleaving vs. maximal parallelism
WMC'05 Proceedings of the 6th international conference on Membrane Computing
Asynchronous p systems and p systems working in the sequential mode
WMC'04 Proceedings of the 5th international conference on Membrane Computing
CMSB'04 Proceedings of the 20 international conference on Computational Methods in Systems Biology
CMSB'04 Proceedings of the 20 international conference on Computational Methods in Systems Biology
Modeling and analysis of biological processes by mem(brane) calculi and systems
Proceedings of the 38th conference on Winter simulation
Expressiveness Issues in Brane Calculi: A Survey
Electronic Notes in Theoretical Computer Science (ENTCS)
Membrane systems with proteins embedded in membranes
Theoretical Computer Science
On the Computational Power of Biochemistry
AB '08 Proceedings of the 3rd international conference on Algebraic Biology
Membrane computing with transport and embedded proteins
Theoretical Computer Science
On the computational power of BlenX
Theoretical Computer Science
Turing universality of the biochemical ground form
Mathematical Structures in Computer Science
π@: a π-based process calculus for the implementation of compartmentalised bio-inspired calculi
SFM'08 Proceedings of the Formal methods for the design of computer, communication, and software systems 8th international conference on Formal methods for computational systems biology
Mutual mobile membranes with objects on surface
Natural Computing: an international journal
Some notes on (mem)brane computation
PPSN'06 Proceedings of the 9th international conference on Parallel Problem Solving from Nature
| Hi-index | 0.00 |
Brane calculi are a family of biologically inspired process calculi proposed in [3] for modeling the interactions of dynamically nested membranes. In [3] a basic calculus for membranes interactions – called Phago/Exo/ Pino – is proposed, whose primitives are inspired by endocytosis and exocytosis. An alternative basic calculus – called Mate/Bud/Drip and inspired by membrane fusion and fission – is also outlined and shown to be encodable in Phago/Exo/Pino in [3]. In this paper we investigate and compare the expressiveness of such two calculi w.r.t. their ability to act as computational devices. We show that (a fragment of) the Phago/Exo/Pino calculus is Turing powerful, by providing an encoding of Random Access Machines. On the other hand, we show the impossibility to define a “faithful” encoding of Random Access Machines in the Mate/Bud/Drip calculus, by providing a proof of the decidability of the existence of a divergent computation in Mate/Bud/Drip.