Introduction to Membrane Computing

@inproceedings{Paun2006IntroductionTM,
  title={Introduction to Membrane Computing},
  author={Gheorghe Paun},
  booktitle={Applications of Membrane Computing},
  year={2006}
}
  • G. Paun
  • Published in
    Applications of Membrane…
     2006
  • Computer Science
This is a comprehensive (and friendly) introduction to membrane computing (MC), meant to offer both computer scientists and non-computer scientists an up-to-date overview of the field. That is why the set of notions introduced here is rather large, but the presentation is informal, without proofs and with rigorous definitions given only for the basic types of P systems — symbol object P systems with multiset rewriting rules, systems with symport/antiport rules, systems with string objects… 
View via Publisher
cs.ioc.ee
154 Citations
Highly Influential Citations
18
Background Citations
77
Methods Citations
23
Results Citations
2

154 Citations

Citation Type

Citation Type

A toolbox for simpler active membrane algorithms
Membrane Computing as a Modeling Framework. Cellular Systems Case Studies
TLDR
This work discusses in a certain detail the possibility of using membrane computing as a high level computational modeling framework for addressing structural and dynamical aspects of cellular systems.
Membrane Computing and Its Applications
TLDR
This paper briefly discuss about membrane computing applications like global clock, L system, solving optimization problems, solving SAT, HPP etc.
The computational power of timed P systems with active membranes using promoters
TLDR
This paper proposes a new variant of timed P systems with active membranes, where the application of rules can be regulated by promoters with only two polarizations, and proves that any Turing computable set of numbers can be generated by such a P system in the time-free way.
P systems with control nuclei: The concept
Discovering the Membrane Topology of Hyperdag P Systems
TLDR
This paper develops building-block membrane algorithms for discovery of the global topological structure from the local cell point of view and proposes more convenient operational modes and transfer modes, that depend only on each of the individual cell rules.
Basic Mathematical Operations in Membrane Computing
  • D. P. Y. Barfeh
  • Computer Science
    2019 International Conference on Computational Intelligence and Knowledge Economy (ICCIKE)
  • 2019
TLDR
The research explains how addition, subtraction, multiplication and division are done in membrane computing following rules already existed, and explains all levels in each transaction in details.
CS691 Report : Membrane Computing
The main aim of this project is to survey the current state of art of the P systems (a.k.a. membrane systems) area. To this aim, a couple of introductory papers ([1], [2]) and a doctoral thesis (by…
Encoding Catalytic P Systems in pi@
The mechanism of splitting mitochondria in terms of membrane automata
TLDR
This work attempts to describe in a novel way a mitochondrial fission process based on membrane automata and makes use of notions from brane calculus and presents an abstracted model of the mechanisms that contribute to this biological phenomenon.
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 180 REFERENCES
From cells to computers: computing with membranes (P systems).
  • G. Paun
  • Computer Science
    Bio Systems
  • 2001
Replicative - Distribution Rules in P Systems with Active Membranes
TLDR
A new operation, called replicative-distribution, is introduced into P systems with active membranes that can compute exactly what Turing machines can compute, and can solve NP-complete problems, particularly SAT, in linear time.
P Systems with Active Membranes: Attacking NP-Complete Problems
  • G. Paun
  • Computer Science
    J. Autom. Lang. Comb.
  • 2001
TLDR
It is proved that a class of P systems whose membranes are the main active components, in the sense that they directly mediate the evolution and the communication of objects, is not only computationally universal, but also able to solve NP complete problems in polynomial time.
P Systems with Gemmation of Mobile Membranes
TLDR
This paper introduces a new kind of communication between membranes, based upon the natural budding of vesicles in a cell, and proves that P systems of this type can generate all recursively enumerable languages and the Hamiltonian Path Problem can be solved in a quadratic time.
Computing with Membranes: Attacking NP-Complete Problems
The aim of this paper is to introduce to the reader the main ideas of Computing with Membranes, a recent branch of (theoretical) Molecular Computing, with emphasis on some variants which can solve…
Membrane Computing: An Introduction
TLDR
This chapter discusses Membrane Computing, What It Is and What It is Not, and attempts to get back to reality with open problems and Universality results.
Tissue-like P Systems with Channel-States
TLDR
This work considers tissue-like P systems with states associated with the links between cells, controlling the passage of objects across the links, and investigates the computing power of such devices for the case of using antiport rules of small weights.
Available Membrane Computing Software
TLDR
This chapter summarizes some of the simulators which can be successfully used for pedagogical purposes and as assistant tools for researchers, presenting the state of the art of the available software for simulating cell-like membrane systems.
On the Efficiency of P Systems with Active Membranes and Two Polarizations
TLDR
An algorithm for deterministically deciding SAT in linear time by P systems with active membranes using only two polarizations and rules of types (a, (c), and (e) is presented, improving results from [1].
Time and Synchronization in Membrane Systems
TLDR
Here, different ways to approach the synchronization of different rules, running in parallel, and having unknown execution times within the framework of membrane systems are presented.
...
1
2
3
4
5
...