Titlebook: Membrane Computing; 8th International Wo George Eleftherakis,Petros Kefalas,Arto Salomaa Conference proceedings 2007 Springer-Verlag Berlin

亲密

Causality in Membrane Systemssystems are usually equipped with the maximal parallelism semantics; however, since their introduction, some alternative semantics have been proposed and investigated..We propose a semantics that describes the causal dependencies occurring between the reactions of a P system. We investigate the basi

特别容易碎

Simulating the Bitonic Sort Using P Systemsh architecture, using the shuffled row-major indexing function. A correctness proof of the proposed algorithm is given. Two simulations with P systems are introduced and discussed. The first one uses dynamic communication graphs and follows the guidelines of the mesh version of the algorithm. The se

demote

On the Number of Agents in P Coloniesand evolving in a shared environment..We decrease the number of agents sufficient to guarantee computational completeness of P colonies with one and with two objects inside each agent, respectively, owing some special restrictions to the type of programs. We characterize the generative power of the

Substitution

Events, Causality, and Concurrency in Membrane Systemsems, the event structures are extended with notions like maximal concurrent transitions and saturated states with respect to concurrency. The event structure of a membrane system is defined in two steps: first the event structure of a maximal parallel step in membranes is defined, and then it is com

分解

P Systems with String Objects and with Communication by Requestmbols in the string. We define two variants of communication and prove that these systems with both types of communication are computationally complete, even having a number of membranes limited with relatively small constants.

NICHE

On the Dynamics of PB Systems with Volatile Membraneseachability and boundedness are decidable for PB systems extended with rules for membrane dissolution. For PB systems extended with membrane creation, reachability is still decidable whereas boundedness becomes undecidable. Furthermore, we show that both problems are undecidable for PB systems exten

实施生效

A Logarithmic Bound for Solving Subset Sum with P Systemsntary membranes to solve .-complete problems in a polynomial number of steps, and we do this by presenting a solution to the Subset Sum problem. On the other hand, we improve some similar results obtained for different models of P systems by reducing the number of steps and the necessary resources t

cultivated

下垂

Optimizing Evolution Rules Application and Communication Times in Membrane Systems Implementationules application time in membranes of the system. This work shows how to optimize the evolution rule application and communication times using two complementary techniques: the improvement of evolution rules algorithms and the usage of compression schema..On the one hand, this work uses the concepts

储备