A P systems variant for reasoning about sequential controllability of Boolean networks

DOI10.1016/j.tcs.2023.114056arXiv2303.00110OpenAlexW4383066791MaRDI QIDQ6168086

Artiom Alhazov, Vincent Ferrari-Dominguez, Sergiu Ivanov, Nicolas Glade, Rudolf Freund

Publication date: 8 August 2023

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2303.00110

zbMATH Keywords

complexityreachabilityBoolean networksBoolean P systems

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Complexity results for 1-safe nets
• Computing with membranes
• Small P systems with catalysts or anti-matter simulating generalized register machines and generalized counter automata
• Sequential and maximally parallel multiset rewriting: reversibility and determinism
• Controllability of reaction systems
• Sequential reprogramming of Boolean networks made practical
• Relationships between nondeterministic and deterministic tape complexities
• Polymorphic P Systems
• Temporal Reprogramming of Boolean Networks
• A Formal Framework for Static (Tissue) P Systems
• Sequential reprogramming of biological network fate
• Sequential reprogramming of biological network fate

This page was built for publication: A P systems variant for reasoning about sequential controllability of Boolean networks