AMAN , Bogdan

In this paper we provide algorithms for solving the SAT problem using P systems with active membranes with neither polarization nor division rules. The semi- uniform solutions are given under the assumption that initial con gurations (either al- phabet or structure) of exponential size are pre-computed by well-de ned P systems (P systems with...

We consider P systems that assigns storage costs per step to membranes, and execution costs to rules. We present an abstract syntax of the new class of membrane systems, and then deal with costs by extending the operational semantics of P systems with promoters, inhibitors and registers.We use Priced-Timed Maude to implement the P systems with...

In this paper we introduce mutual mobile membranes with surface objects, systems which have biological motivation. In P systems with mobile membranes with surface objects, a membrane may enter or exit another membrane. The second membrane just undergoes the action, meaning that it has no control on when the movement takes place. This kind of...

We introduce and study a multiset-based type system with ratio thresholds motivated by an important regulatory mechanism inside a cell which try to maintain a \life-death" ratio between some given lower and upper thresholds. We use such a type system to control ratio thresholds in a bio-inspired and multisets-based formalism. For this type...

No description

In this short note we extend the notion of red-green Turing machines to speci c variants of P automata. Acceptance and recognizability of nite strings by red- green automata are de ned via in nite runs of the automaton on the input string and the way how to distinguish between red and green states.

We show multiple ways to simulate R systems by non-cooperative P systems with atomic control by promoters and/or inhibitors, or with matter-antimatter annihi- lation rules, with a slowdown by a factor of constant. The descriptional complexity is also linear with respect to that of simulated R system. All these constants depend on how general...

We investigate the relationship of time Petri nets and di erent variants of membrane systems. First we show that the added feature of \time" in time Petri nets makes it possible to simulate the maximal parallel rule application of membrane systems without introducing maximal parallelism to the Petri net semantics, then we de ne local time P...

The concept of a matter object being annihilated when meeting its corresponding anti-matter object is investigated in the context of membrane systems, i.e., of (distributed) multiset rewriting systems applying rules in the maximally parallel way. Computational completeness can be obtained with using only non-cooperative rules besides these...

We present a transformation of membrane systems, possibly with pro- moter/inhibitor rules, priority relations, and membrane dissolution, into formulas of the chemical calculus such that terminating computations of membranes correspond to terminating reduction sequences of formulas and vice versa. In the end, the same result can be extracted...

Reversible computation allows computation to proceed not only in the standard, forward direction, but also backward, recovering past states. While reversible computation has attracted interest for its multiple applications, covering areas as different as low-power computing , simulation, robotics and debugging, such applications need to be...