Time-free cell-like P systems with multiple promoters/inhibitors

Zhao, Yuzhen; Liu, Xiyu; Sun, Minghe; Qu, Jianhua; Zheng, Yuanjie

doi:10.1016/j.tcs.2020.07.018

Cited by 8 publications

(5 citation statements)

References 23 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The studies of cell-like P systems and their variants mainly focused on the theoretical analysis and application of computing models [8]. A variety of cell-like P systems based on biological facts [9], the biochemical reaction of cells [10], mathematical biological cells [11], and theoretical computer science have been directly designed and developed for solving problems in the studies of theoretical analysis of cell-like P systems, which is recruited various ingredients, including energy, catalysts, and mitosis [12], such as cell-like P systems with active membranes inspired in the mitosis process [13]; polarizationless P systems with active membranes [14], to avoid polarizations; cell-like P systems with evolutional symport/antiport rules inspired by conservation law [15], and its variants [16]. The analysis of computing power and computational efficiency of cell-like P systems and their variants are also an important part of theoretical studies and works [17].…”

Section: Related Workmentioning

confidence: 99%

“…A grayscale image I contains N pixels is divided into K + 1 classes, the values of the minimum and maximum of grey levels for image I are set to 0 and L, usually, L = 255. Then a group of thresholds {t 1 , t 2 , • • • , t K } contain K thresholds are adopted to segment the original image I into K + 1 distinct classes {C 0 , C 1 , • • • , C K }, which can be described by (10) in the following…”

Section: Objective Functionmentioning

confidence: 99%

See 1 more Smart Citation

An Extended Membrane System Based on Cell-like P Systems and Improved Particle Swarm Optimization for Image Segmentation

Wang

Liu

et al. 2022

Mathematics

Self Cite

View full text Add to dashboard Cite

An extended membrane system with a dynamic nested membrane structure, which is integrated with the evolution-communication mechanism of a cell-like P system with evolutional symport/antiport rules and active membranes (ECP), and the evolutionary mechanisms of particle swarm optimization (PSO) and improved PSO inspired by starling flock behavior (SPSO), named DSPSO-ECP, is designed and developed to try to break application restrictions of P systems in this paper. The purpose of DSPSO-ECP is to enhance the performance of extended membrane system in solving optimization problems. In the proposed DSPSO-ECP, the updated model of velocity and position of standard PSO, as basic evolution rules, are adopted to evolve objects in elementary membranes. The modified updated model of the velocity of improved SPSO is used as local evolution rules to evolve objects in sub-membranes. A group of sub-membranes for elementary membranes are specially designed to avoid prematurity through membrane creation and dissolution rules with promoter/inhibitor. The exchange and sharing of information between different membranes are achieved by communication rules for objects based on evolutional symport rules of ECP. At last, computational results, which are made on numerical benchmark functions and classic test images, are discussed and analyzed to validate the efficiency of the proposed DSPSO-ECP.

show abstract

Section: Related Workmentioning

confidence: 99%

Section: Objective Functionmentioning

confidence: 99%

An Extended Membrane System Based on Cell-like P Systems and Improved Particle Swarm Optimization for Image Segmentation

Wang

Liu

et al. 2022

Mathematics

Self Cite

View full text Add to dashboard Cite

show abstract

“…Membrane computing is inspired by biological cells, tissues, and nervous systems and can be implemented as distributed and parallel computing devices. At present, many new variants have been proposed [3][4][5][6][7][8][9], and many variants have been proven Turing universal. In the theoretical research of membrane computing, various computationally hard problems were solved [10][11][12][13][14].…”

Section: Introductionmentioning

confidence: 99%

Solving the SAT Problem by Cell-Like P Systems with Channel States and Symport Rules

Wan

Liu

Yue-guo

2023

Discrete Dynamics in Nature and Society

View full text Add to dashboard Cite

Cell-like P systems with channel states, which are a variant of tissue P systems in membrane computing, can be viewed as highly parallel computing devices based on the nested structure of cells, where communication rules are classified as symport rules and antiport rules. In this work, we remove the antiport rules and construct a novel variant, namely, cell-like P systems with channel states and symport rules, where one rule is only allowed to be nondeterministically applied once per channel. To explore the computational efficiency of the variant, we solve the S A T problem and obtain a uniform solution in polynomial time with the maximal length of rules 1. The results of our work are reflected in the following two aspects: first, communication rules are restricted to only one type, namely, symport rules; second, the maximal length of rules is decreased from 2 to 1. Our work indicates that the constructed variant with fewer rule types can still solve the S A T problem and obtain better results in terms of computational complexity. Hence, in terms of computational efficiency, our work is a notable improvement.

show abstract

“…As far as time-free is concerned, the approach was proposed in [34]. Recently, relative to NPcomplete problems, some results have been obtained with time-freeness [35], [36].…”

Section: Introductionmentioning

confidence: 99%

Flip-flop P systems with proteins on membranes in a time-free manner

2023

View full text Add to dashboard Cite

Flip-flop P systems with proteins are a bio-inspired variant of cell-like P systems in membrane computing, where proteins can control the execution of rules. In this work, firstly, in order to simulate the fact that the execution time of biochemical reactions is uncertain, considering time-freeness, we therefore construct a novel variant, namely timed flip-flop P systems with proteins, where the protein on each membrane only has two types of working states, and such a system runs under the time-freeness mode; secondly, we study the computation power of this variant, and it is shown that a system with only one membrane and a maximum rule length of 4 is Turing universal; moreover, based on the variant, a solution to the SAT problem is obtained by the constructed system in polynomial time. Our work indicates that the constructed variant with time-freeness can still solve the SAT problem in feasible time. Because timefreeness of rules is employed, the variant may be more suitable for particular applications. INDEX TERMS P system, protein, university, SAT , time-freeness.

show abstract

Time-free cell-like P systems with multiple promoters/inhibitors

Cited by 8 publications

References 23 publications

An Extended Membrane System Based on Cell-like P Systems and Improved Particle Swarm Optimization for Image Segmentation

An Extended Membrane System Based on Cell-like P Systems and Improved Particle Swarm Optimization for Image Segmentation

Solving the SAT Problem by Cell-Like P Systems with Channel States and Symport Rules

Flip-flop P systems with proteins on membranes in a time-free manner

Contact Info

Product

Resources

About