The mobile ambients and the P systems are models developed in di erent areas of computer science based on very similar concepts and structures Given their resemblance we point out how to transfer ideas and results from one framework to the other Along this line we prove that any P system can be simulated in ambient calculus We also introduce the mobile P systems well suited to model security fe...

A variant of array-rewriting P systems that uses parallel rewriting of arrays in the regions is introduced. The generative power of this model is compared with certain array grammars generating array languages. It is shown that geometric arrays such as hollow rectangles and hollow squares can be generated by parallel array P systems with a priority relation on the rules. The advantage of the pr...

Energy–based P systems have been recently defined as P systems in which the amount of energy manipulated and/or consumed during computations is taken into account. In this paper we propose two quantum versions of energy–based P systems. Both versions are defined just like classical energy–based P systems, but for objects and rules. Objects are represented as pure states in the Hilbert space C, ...

In this paper we address the possibility of studying the computational capabilities of catalytic P systems with one catalyst by the means of iterated finite state transducers (IFT). In particular, we focus on a variant of catalytic P systems which satisfies in addition to the original definition the following property: if in a region of the P system an object is the subject of a catalytic rule,...

After a short introduction to the area of membrane computing (a branch of natural computing), we introduce the concept of anti-matter in membrane computing. First we consider spiking neural P systems with anti-spikes, and then we show the power of anti-matter in cell-like P systems. As expected, the use of anti-matter objects and especially of matter/anti-matter annihilation rules, turns out to...

Systolic automata are models of highly-concurrent language acceptors based on identical processors with one-way flow of information, amenable to efficient hardware implementation as multiprocessor chips. In this paper we investigate the relationship between Binary Systolic TreeAutomata (BSTA), inwhich the underlying communication structure is an infinite complete binary tree with parallel botto...

1 Computer and Automation Research Institute Hungarian Academy of Sciences H-1111, Budapest, Kende u. 13-17, Hungary {csuhaj,marion,vaszil}@sztaki.hu 2 Department of Computer Science University of Sheffield Regent Court, Portobello Street, Sheffield S1 4DP, United Kingdom [email protected] 3 Institute for Computer Languages Vienna University of Technology Favoritenstr. 9-11, 1040 Vienna...

Spiking neural P systems are a class of distributed parallel computing models inspired from the way the neurons communicate with each other by means of electrical impulses (called “spikes”). In this paper, we consider a restricted variant of spiking neural P systems, called homogeneous spiking neural P systems, where each neuron has the same set of rules. The universality of homogeneous spiking...

Discrete event dynamic systems may have extremely large state spaces. For their analysis, it is usual to relax the description by removing the integrality constraints. Applying this idea, continuous P/T systems are defined by allowing fractional firings of transitions, and thus the existence of non-discrete markings [4, 5, 1]. In this paper we compare the behaviors of discrete and continuous sy...

Metabolic P systems, shortly MP systems, are a special class of deterministic P systems, introduced for expressing biological metabolism. Their dynamics are computed by a special type of regulated multiset rewriting. In this chapter the basic results on MP systems are indicated and a procedure is outlined for constructing MP models of biological processes from time series of observed dynamics.