• Publications
  • Influence
Simple reaction Systems and their Classification
TLDR
We prove that “simple” reaction systems, having at most one reactant and one inhibitor per reaction, suffice in order to simulate arbitrary systems. Expand
  • 12
  • 2
  • PDF
Fixed Points and Attractors of Reaction Systems
TLDR
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
  • 26
  • 1
  • PDF
Introducing a Space Complexity Measure for P Systems
TLDR
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
  • 31
  • 1
  • PDF
Improving Universality Results on Parallel Enzymatic Numerical P Systems
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 firstExpand
  • 23
  • 1
  • PDF
P systems with active membranes: trading time for space
TLDR
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
  • 16
  • 1
  • PDF
P Systems with Active Membranes Working in Polynomial Space
TLDR
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
  • 19
  • 1
  • PDF
Efficient Simulation of Reaction Systems on Graphics Processing Units
TLDR
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
  • 8
  • 1
Reachability in Resource-Bounded Reaction Systems
TLDR
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
  • 5
  • 1
  • PDF
Recent complexity-theoretic results on P systems with active membranes
TLDR
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
  • 9
  • 1
  • PDF
The Firing Squad Synchronization Problem on Higher-Dimensional CA with Multiple Updating Cycles
TLDR
Traditional cellular automata (CA) assume the presence of a single global clock regulating the update of all their cells. Expand
  • 4
  • 1
  • PDF
...
1
2
3
4
5
...