Petri nets: an introduction
Computability of Recursive Functions
Journal of the ACM (JACM)
Theoretical Computer Science
Journal of Computer and System Sciences
Membrane Computing: An Introduction
Membrane Computing: An Introduction
BioAmbients: an abstraction for biological compartments
Theoretical Computer Science - Special issue: Computational systems biology
Computation: finite and infinite machines
Computation: finite and infinite machines
Deciding reachability in mobile ambients
ESOP'05 Proceedings of the 14th European conference on Programming Languages and Systems
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
Universality results for P systems based on brane calculi operations
Theoretical Computer Science
P Systems with Proteins on Membranes
Fundamenta Informaticae
Membrane Computing and Brane Calculi (Some Personal Notes)
Electronic Notes in Theoretical Computer Science (ENTCS)
Tissue P Systems and (Mem)Brane Systems with Mate and Drip Operations Working on Strings
Electronic Notes in Theoretical Computer Science (ENTCS)
Communication via Mobile Vesicles in Brane Calculi
Electronic Notes in Theoretical Computer Science (ENTCS)
Expressiveness Issues in Brane Calculi: A Survey
Electronic Notes in Theoretical Computer Science (ENTCS)
Membrane computing and brane calculi. Old, new, and future bridges
Theoretical Computer Science
An integrating view on DNA computing and membrane computing
EC'08 Proceedings of the 9th WSEAS International Conference on Evolutionary Computing
Computational expressiveness of Genetic Systems
Theoretical Computer Science
Membrane computing with transport and embedded proteins
Theoretical Computer Science
Some notes on (mem)brane computation
PPSN'06 Proceedings of the 9th international conference on Parallel Problem Solving from Nature
Deciding behavioural properties in brane calculi
CMSB'06 Proceedings of the 2006 international conference on Computational Methods in Systems Biology
On the computational power of brane calculi
Transactions on Computational Systems Biology VI
P systems with proteins on membranes and membrane division
DLT'06 Proceedings of the 10th international conference on Developments in Language Theory
Coordinating parallel mobile ambients to solve SAT problem in polynomial number of steps
COORDINATION'12 Proceedings of the 14th international conference on Coordination Models and Languages
P Systems with Proteins on Membranes
Fundamenta Informaticae
FCT'07 Proceedings of the 16th international conference on Fundamentals of Computation Theory
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] two basic calculi are proposed. Mate/Bud/Drip (MBD) is one of such basic calculi, and its primitives are inspired by membrane fusion and fission. In this paper we investigate the expressiveness of MBD w.r.t. its ability to act as a computational device. In particular, we compare the expressiveness of two different semantics for MBD: the standard interleaving semantics – where a single interaction is executed at each computational step – and the maximal parallelism semantics – according to which a computational step is composed of a maximal set of independent interactions. For the interleaving semantics, we show a nondeterministic encoding of Register Machines in MBD, that preserves the existence of a terminating computation, but that could introduce additional divergent (i.e., infinite) computations. For the maximal parallelism semantics, we provide a deterministic encoding of Register Machines, which preserves both the existence of a terminating computation and the existence of a divergent computation. The impossibilty of providing a deterministic encoding under the interleaving semantics is a consequence of the decidability of the existence of a divergent computation proved in [1].