The Computational Complexity of Tissue P Systems with Evolutional Symport/Antiport Rules

Pan, Linqiang; Song, Bosheng; Valencia-Cabrera, Luis; Pérez–Jiménez, Mario J.

doi:10.1155/2018/3745210

Cited by 21 publications

(21 citation statements)

References 35 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Finally, further variants of tissue P systems with cell division/separation and their computational efficiency were studied, e.g., in [31,41].…”

Section: S E P a R A T I O N R U L E S : [A]mentioning

confidence: 99%

P systems attacking hard problems beyond NP: a survey

Sosík

2019

J Membr Comput

View full text Add to dashboard Cite

In the field of membrane computing, a great attention is traditionally paid to the results demonstrating a theoretical possibility to solve NP-complete problems in polynomial time by means of various models of P systems. A bit less common is the fact that almost all models of P systems with this capability are actually stronger: some of them are able to solve PSPACEcomplete problems in polynomial time, while others have been recently shown to characterize the class # (which is conjectured to be strictly included in PSPACE). A large part of these results has appeared quite recently. In this survey, we focus on strong models of membrane systems which have the potential to solve hard problems belonging to classes containing NP. These include P systems with active membranes, P systems with proteins on membranes and tissue P systems, as well as P systems with symport/antiport and membrane division and, finally, spiking neural P systems. We provide a survey of computational complexity results of these membrane models, pointing out some features providing them with their computational strength. We also mention a sequence of open problems related to these topics.

show abstract

“…Finally, further variants of tissue P systems with cell division/separation and their computational efficiency were studied, e.g., in [31,41].…”

Section: S E P a R A T I O N R U L E S : [A]mentioning

confidence: 99%

P systems attacking hard problems beyond NP: a survey

Sosík

2019

J Membr Comput

View full text Add to dashboard Cite

show abstract

“…Apart from those novel technologies applied to the simulation of different types of P systems, the research line started with P-Lingua framework kept including new variants along the years, as tissue P systems with cell division [130], spiking neural P systems [131], tissue P systems with cell separation [132], cell-like P systems with symport/antiport rules [133], and more recently cell-like SN P systems [134]. In fact, P systems with evolutional symport-antiport rules were also included within MeCoSim version of P-Lingua framework [141]. New applications keep appearing within this umbrella, as some initial works in Physics using the PDP systems included in the same framework [144].…”

Section: The Era Of Practical Applications Based On P Systemsmentioning

confidence: 99%

An interactive timeline of simulators in membrane computing

et al. 2019

Self Cite

View full text Add to dashboard Cite

As with any fast-emerging research front in computer science, the proliferation of theoretical and practical results within Membrane computing since its appearance in 1998 was astonishing. As a consequence, it became necessary during the subsequent years to produce several surveys collecting the main achievements from a theoretical point of view, along with some specific surveys about simulation tools for this paradigm. As the discipline has reached a certain degree of maturity, more practical applications have arisen, and new collective works are summarising the new software products appeared. However, while these recapitulation efforts remain useful for details about new simulators, they cannot act as exhaustive updated listings, as they become obsolete as soon as new tools are developed. Thus, we considered that it was necessary to provide an interactive tool showing an updated timeline (https ://www.gcn.us.es/Simul ation MC) about the simulation of the computational devices of membrane computing (a.k.a P systems), aiming to stay updated whenever any new practical work comes out in the discipline. This paper recalls the main stages and milestones within the evolution of simulation tools for different types and variants of P systems, along with their main related applications. In addition, it describes the interactive web tool with the timeline mentioned, where all the references related here have been incorporated. Unlike other survey papers, it is the intent of this work to reinforce this initial collective effort with the web endpoint kept alive and updated.

show abstract

“…While using division rules, passing from rules of length at most (1, n) to (2, n) (the length of an evolutional symport/antiport rule is an ordered pair whose first component is the total number of objects involved in the left hand side of the rule, and the second component is the total number of objects involved in the right hand side of the rule), for every natural number n ≥ 1, amounts to passing from the non efficiency to the presumed efficiency. If separation rules are used instead of division rules, the non efficiency of tissue P systems with evolutional symport/antiport rules of length at most (1, n) or (n, 1), for every natural number n ≥ 1, has been established in [25].…”

Section: Introductionmentioning

confidence: 99%

Cell-like P systems with evolutional symport/antiport rules and membrane creation

Song

Orellana-Martín

et al. 2020

Information and Computation

Self Cite

View full text Add to dashboard Cite

Cell-like P systems with symport/antiport rules are computing models inspired by the conservation law, in the sense that they compute by changing the places of objects with respect to the membranes, and not by changing the objects themselves. In this work, a variant of these kinds of membrane systems, called cell-like P systems with evolutional symport/antiport rules, where objects can evolve in the execution of such rules, is introduced. Besides, inspired by the autopoiesis process (ability of a system to maintain itself), membrane creation rules are considered as an efficient mechanism to provide an exponential workspace in terms of membranes. The presumed efficiency of these computing models (ability to solve computationally hard problems in polynomial time and uniform way) is explored. Specifically, an efficient solution to the SAT problem is provided by means of a family of recognizer cell-like P systems with evolutional symport/antiport rules and membrane creation which make use of communication rules involving a restricted number of objects.

show abstract

The Computational Complexity of Tissue P Systems with Evolutional Symport/Antiport Rules

Cited by 21 publications

References 35 publications

P systems attacking hard problems beyond NP: a survey

P systems attacking hard problems beyond NP: a survey

An interactive timeline of simulators in membrane computing

Cell-like P systems with evolutional symport/antiport rules and membrane creation

Contact Info

Product

Resources

About