We prove that “simple” reaction systems, having at most one reactant and one inhibitor per reaction, suffice in order to simulate arbitrary systems.Expand

We investigate the computational complexity of deciding the occurrence of many different dynamical behaviours in reaction systems, with an emphasis on biologically relevant problems (i.e., existence of fixed points and fixed point attractors).Expand

We define space complexity classes in the framework of membrane computing, giving some initial results about their mutual relations and their connection with time complexity classes, and identifying some potentially interesting problems which require further research.Expand

We improve previously known universality results on enzymatic numerical P systems (EN P systems, for short) working in all-parallel and one-parallel modes. By using a flattening technique, we first… Expand

We consider recognizer P systems having three polarizations associated to the membranes, and we show that they are able to solve the PSPACE-complete problem Quantified 3SAT when working in polynomial space and exponential time.Expand

We prove that recognizer P systems with active membranes using polynomial space characterize the complexity class PSPACE, even when strong features such as division rules are used.Expand

We present HERESY, a simulator of reaction systems accelerated on Graphics Processing Units (GPUs) that allows up to 29A speed-up with respect to a CPU-based simulator.Expand

Reaction systems, a formalism describing biochemical reactions in terms of sets of reactants, inhibitors, and products, are known to have a PSPACE-complete configuration reachability problem.Expand

We focus on the complexity theory of P systems with active membranes, where the membranes themselves affect the applicability of rules and change (both in number and structurally) during computations.Expand