Metabolic networks, formed by a series of metabolic pathways, are made of intracellular and extracellular reactions that determine the biochemical properties of a cell, and by a set of interactions that guide and regulate the activity of these reactions. Most of these pathways are formed by an intricate and complex network of chain reactions, and can be represented in a human readable form using graphs which describe the cell cycle checkpoint pathways. This paper proposes a method to represent Molecular Interaction Maps (graphical representations of complex metabolic networks) in Linear Temporal Logic. The logical representation of such networks allows one to reason about them, in order to check, for instance, whether a graph satisfies a given property $\phi$, as well as to find out which initial conditons would guarantee $\phi$, or else how can the the graph be updated in order to satisfy $\phi$. Both the translation and resolution methods have been implemented in a tool capable of addressing such questions thanks to a reduction to propositional logic which allows exploiting classical SAT solvers.

中文翻译：

---

分子相互作用图建模框架

由一系列代谢途径形成的代谢网络由决定细胞生化特性的细胞内和细胞外反应以及指导和调节这些反应活动的一组相互作用构成。这些途径中的大多数是由错综复杂的连锁反应网络形成的，并且可以使用描述细胞周期检查点途径的图表以人类可读的形式表示。本文提出了一种在线性时间逻辑中表示分子相互作用图（复杂代谢网络的图形表示）的方法。这种网络的逻辑表示允许人们对它们进行推理，例如，为了检查图是否满足给定的属性 $\phi$，以及找出哪些初始条件将保证 $\phi$，否则如何更新图形以满足 $\phi$。由于简化了命题逻辑，允许利用经典 SAT 求解器，因此翻译和解析方法都已在能够解决此类问题的工具中实现。