A P systems variant for reasoning about sequential controllability of Boolean networks
From MaRDI portal
Publication:6168086
DOI10.1016/J.TCS.2023.114056arXiv2303.00110OpenAlexW4383066791MaRDI QIDQ6168086FDOQ6168086
Authors: Artiom Alhazov, Vincent Ferrari-Dominguez, Rudolf Freund, Nicolas Glade, Sergiu Ivanov 
Publication date: 8 August 2023
Published in: Theoretical Computer Science (Search for Journal in Brave)
Abstract: A Boolean network is a discrete dynamical system operating on vectors of Boolean variables. The action of a Boolean network can be conveniently expressed as a system of Boolean update functions, computing the new values for each component of the Boolean vector as a function of the other components. Boolean networks are widely used in modelling biological systems that can be seen as consisting of entities which can be activated or deactivated, expressed or inhibited, on or off. P systems on the other hand are classically introduced as a model of hierarchical multiset rewriting. However, over the years the community has proposed a wide range of P system variants including diverse ingredients suited for various needs. In this work, we propose a new variant -- Boolean P systems -- specifically designed for reasoning about sequential controllability of Boolean networks, and use it to first establish a crisp formalization of the problem, and then to prove that the problem of sequential controllability is PSPACE-complete. We further claim that Boolean P systems are a demonstration of how P systems can be used to construct ad hoc formalisms, custom-tailored for reasoning about specific problems, and providing new advantageous points of view.
Full work available at URL: https://arxiv.org/abs/2303.00110
Cites Work
- Title not available (Why is that?)
- Computing with membranes
- Title not available (Why is that?)
- Relationships between nondeterministic and deterministic tape complexities
- Reaction systems
- A Formal Framework for Static (Tissue) P Systems
- Complexity results for 1-safe nets
- Sequential reprogramming of biological network fate
- Sequential and maximally parallel multiset rewriting: reversibility and determinism
- Small P systems with catalysts or anti-matter simulating generalized register machines and generalized counter automata
- Controllability of reaction systems
- Polymorphic P systems
- Sequential reprogramming of Boolean networks made practical
- Temporal reprogramming of Boolean networks
- Sequential reprogramming of biological network fate
This page was built for publication: A P systems variant for reasoning about sequential controllability of Boolean networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6168086)
