English

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

Formal Languages and Automata Theory 2022-09-01 v1

Abstract

Membrane computing and P systems are a paradigm of massively parallel natural computing introduced by Gheorghe P\u{a}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.

Keywords

Cite

@article{arxiv.2208.14723,
  title  = {P versus B: P Systems as a Formal Framework for Controllability of Boolean Networks},
  author = {Artiom Alhazov and Rudolf Freund and Sergiu Ivanov},
  journal= {arXiv preprint arXiv:2208.14723},
  year   = {2022}
}

Comments

In Proceedings NCMA 2022, arXiv:2208.13015