Abstract

In the field of biological regulation, models extracted from experimental works are usually complex networks comprising intertwined feedback circuits. R. Thomas and coworkers introduced a qualitative description of the dynamics of such regulatory networks, called the generalized logical analysis, and used the concept of circuit-characteristic states to identify all steady states and functional circuits. These characteristic states play an essential role on the dynamics of the system, but they are not represented in the state graph. In this paper we present an extension of this formalism in which all singular states including characteristic ones are represented. Consequently, the state graph contains all steady states. Model checking is then able to verify temporal properties concerning singular states. Finally, we prove that this new modeling is coherent with R. Thomas’ modeling since all paths of R. Thomas’ dynamics are represented in the new state graph, which in addition shows the influence of singular states on the dynamics.KeywordsModel CheckState GraphFeedback CircuitRegular StateComputation Tree LogicThese keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.