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

Artiom Alhazov
(Vladimir Andrunachievici Institute of Mathematics and Computer Science)
Rudolf Freund
(Faculty of Informatics, TU Wien)
Sergiu Ivanov
(Université Paris-Saclay, Univ. Évry, IBISC)

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.

In Henning Bordihn, Géza Horváth and György Vaszil: Proceedings 12th International Workshop on Non-Classical Models of Automata and Applications (NCMA 2022), Debrecen, Hungary, August 26-27, 2022, Electronic Proceedings in Theoretical Computer Science 367, pp. 28–48.
Published: 27th August 2022.

ArXived at: https://dx.doi.org/10.4204/EPTCS.367.3 bibtex PDF
References in reconstructed bibtex, XML and HTML format (approximated).
Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org