Membrane Computing: An Introduction
Membrane Computing: An Introduction
The power of communication: P systems with symport/antiport
New Generation Computing
Minimizing evolution-communication P systems and automata
New Generation Computing - Membrane computing
Computationally universal P systems without priorities: two catalysts are sufficient
Theoretical Computer Science - Descriptional complexity of formal systems
Further remarks on P systems with active membranes, separation, merging, and release rules
Soft Computing - A Fusion of Foundations, Methodologies and Applications
Deterministic catalytic systems are not universal
Theoretical Computer Science - Implementation and application of automata
P systems without multiplicities of symbol-objects
Information Processing Letters
Using well-structured transition systems to decide divergence for catalytic P systems
Theoretical Computer Science
Reversible P Systems to Simulate Fredkin Circuits
Fundamenta Informaticae - SPECIAL ISSUE MCU2004
The Oxford Handbook of Membrane Computing
The Oxford Handbook of Membrane Computing
Skin output in P systems with minimal symport/antiport and two membranes
WMC'07 Proceedings of the 8th international conference on Membrane computing
A formal framework for static (tissue) P systems
WMC'07 Proceedings of the 8th international conference on Membrane computing
Reversibility and determinism in sequential multiset rewriting
UC'10 Proceedings of the 9th international conference on Unconventional computation
On generalized communicating P systems with one symbol
CMC'10 Proceedings of the 11th international conference on Membrane computing
Synchrony and asynchrony in membrane systems
WMC'06 Proceedings of the 7th international conference on Membrane Computing
Towards a characterization of p systems with minimal symport/antiport and two membranes
WMC'06 Proceedings of the 7th international conference on Membrane Computing
Computational completeness of tissue p systems with conditional uniport
WMC'06 Proceedings of the 7th international conference on Membrane Computing
Number of protons/bi-stable catalysts and membranes in p systems. time-freeness
WMC'05 Proceedings of the 6th international conference on Membrane Computing
Symbol/Membrane complexity of p systems with symport/antiport rules
WMC'05 Proceedings of the 6th international conference on Membrane Computing
Asynchronous p systems and p systems working in the sequential mode
WMC'04 Proceedings of the 5th international conference on Membrane Computing
WMC'04 Proceedings of the 5th international conference on Membrane Computing
WMC'04 Proceedings of the 5th international conference on Membrane Computing
Implementation of catalytic p systems
CIAA'04 Proceedings of the 9th international conference on Implementation and Application of Automata
Sequential and maximally parallel multiset rewriting: reversibility and determinism
Natural Computing: an international journal
On reversibility and determinism in p systems
WMC'09 Proceedings of the 10th international conference on Membrane Computing
Look-Ahead evolution for p systems
WMC'09 Proceedings of the 10th international conference on Membrane Computing
| Hi-index | 0.00 |
The goal of this survey is to overview some important properties of membrane systems that are referred to as "promising" or dynamic. It is sometimes quite desirable to achieve them, although they are mostly undecidable. We summarize how some of these properties affect the computational power or the descriptional complexity of membrane systems. A number of variants of the dynamic systems is also discussed. Finally, a few self-stabilization properties are proposed.