Asynchronous P systems with active membranes

Authors:
Pierluigi Frisco;Gordon Govan;Alberto Leporati
Affiliations:
School of Math. and Comp. Sciences, HeriotWatt University, EH14 4AS Edinburgh, UK;School of Math. and Comp. Sciences, HeriotWatt University, EH14 4AS Edinburgh, UK;Dipartimento di Informatica, Sistemistica e Comunicazione, Università degli Studi di MilanoBicocca, Viale Sarca 336/14, 20126 Milano, Italy
Venue:
Theoretical Computer Science
Year:
2012

Citing 12
Cited 0

Computing with membranes

Journal of Computer and System Sciences
Handbook of Theoretical Computer Science

Handbook of Theoretical Computer Science
Membrane Computing: An Introduction

Membrane Computing: An Introduction
Solving NP-Complete Problems Using P Systems with Active Membranes

UMC '00 Proceedings of the Second International Conference on Unconventional Models of Computation
Complexity classes in models of cellular computing with membranes

Natural Computing: an international journal
The conformon-P system: a molecular and cell biology-inspired computability model

Theoretical Computer Science
P systems with minimal parallelism

Theoretical Computer Science
Computing with Cells: Advances in Membrane Computing

Computing with Cells: Advances in Membrane Computing
A formal framework for static (tissue) P systems

WMC'07 Proceedings of the 8th international conference on Membrane computing
P systems with elementary active membranes: beyond NP and coNP

CMC'10 Proceedings of the 11th international conference on Membrane computing
The computational power of membrane systems under tight uniformity conditions

Natural Computing: an international journal
P systems with active membranes operating under minimal parallelism

CMC'11 Proceedings of the 12th international conference on Membrane Computing

Quantified Score

Hi-index	5.23

Visualization

Abstract

We prove that recognising P systems with active membranes operating in asynchronous mode are able to solve in a semi-uniform way both NP-complete and PP-complete problems in linear time (in the best case) and exponential space, when using different sets of rules. Precisely, the proposed solution of k-SAT, k=3, uses evolution and communication rules, as well as membranes creation and division of non-elementary membranes; however, it does not use neither polarisations nor membrane dissolution rules. Our solution of MAJORITY-SAT makes use of polarisations as well as evolution and communication rules, together with rules for dividing non-elementary membranes. We also prove that these systems can simulate partially blind register machines; the converse simulation holds for a constrained version of our P systems.