Membrane Computing as a Modelling Tool: Looking Back and Forward from Sevilla

García-Quismondo, Manuel; Graciani, Carmen; Riscos–Núñez, Agustín

doi:10.1007/978-3-030-00265-7_10

Cited by 3 publications

(1 citation statement)

References 36 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…P systems projected efficient computational models by combining the structural and dynamic properties of biological systems [9]. As a result, many fields such as the formal languages [10], theory of computability [11], and theory of computational complexity [12] with intractable problems were solved by the biological model, called P systems [13]. Some of the biological phenomena of the living cells were incorporated into membrane computing as an influential kind of computational concepts, cell-like P systems.…”

Section: Introudctionmentioning

confidence: 99%

P Systems Implementation: A Model of Computing for Biological Mitochondrial Rules using Object Oriented Programming

Nasef¹,

El‐Aarag²,

Hashim³

et al. 2021

IJACSA

View full text Add to dashboard Cite

Section: Introudctionmentioning

confidence: 99%

P Systems Implementation: A Model of Computing for Biological Mitochondrial Rules using Object Oriented Programming

Nasef¹,

El‐Aarag²,

Hashim³

et al. 2021

IJACSA

View full text Add to dashboard Cite

Minimal cooperation as a way to achieve the efficiency in cell-like membrane systems

et al. 2019

Self Cite

View full text Add to dashboard Cite

Cooperation is doubtless a relevant ingredient on rewriting rules based computing models. This paper provides an overview on both classical and newest results studying how cooperation among objects influences the ability of cell-like membrane systems to solve computationally hard problems in an efficient way. In this paper, two types of such membrane systems will be considered: (a) polarizationless P systems with active membranes without dissolution rules when minimal cooperation is permitted in object evolution rules; and (b) cell-like P systems with symport/antiport rules of minimal length. Specifically, assuming that P is not equal to NP, several frontiers of the efficiency are obtained in these two computing frameworks, in such manner that each borderline provides a tool to tackle the P versus NP problem.

show abstract

P versus B: P Systems as a Formal Framework for Controllability of Boolean Networks

Alhazov

Freund

Ivanov

2022

Electron. Proc. Theor. Comput. Sci.

View full text Add to dashboard Cite

Membrane computing and P systems are a paradigm of massively parallel natural computing introduced by Gheorghe Pȃun in 1999, inspired by the structure of the living cell and by its biochemical reactions. In spite of this explicit biological motivation, P systems have not been extensively used in modelling real-world systems. To confirm this intuition, we establish a state of the art investigation comparing the use of P systems to that of Boolean networks in this line of research. We then propose to use P systems as a tool for setting up formal frameworks to reason about other formalisms, and we introduce Boolean P systems, specifically tailored for capturing sequential controllability of Boolean networks. We show how to tackle some technical challenges and prove that sequential controllability properly embeds in the framework of Boolean P systems.

show abstract

Membrane Computing as a Modelling Tool: Looking Back and Forward from Sevilla

Cited by 3 publications

References 36 publications

P Systems Implementation: A Model of Computing for Biological Mitochondrial Rules using Object Oriented Programming

P Systems Implementation: A Model of Computing for Biological Mitochondrial Rules using Object Oriented Programming

Minimal cooperation as a way to achieve the efficiency in cell-like membrane systems

P versus B: P Systems as a Formal Framework for Controllability of Boolean Networks

Contact Info

Product

Resources

About