论文标题
P对B：P系统作为布尔网络可控性的正式框架
P versus B: P Systems as a Formal Framework for Controllability of Boolean Networks
论文作者
论文摘要
膜计算和P系统是GheorghePăun于1999年引入的大规模平行自然计算的范式，其灵感来自活细胞的结构及其生化反应。 尽管存在这种明确的生物学动机，但P系统尚未广泛用于建模现实世界系统。 为了确认这一直觉，我们建立了一个最先进的调查，将P系统与布尔网络的使用进行了比较。 然后，我们建议使用P系统作为设置正式框架来推理其他形式主义的工具，并引入了布尔P系统，专门针对捕获布尔网络的顺序可控性量身定制。 我们展示了如何应对一些技术挑战，并证明该顺序可控性正确地嵌入了布尔P系统的框架中。
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.
