Skip to main content
    • Aa
    • Aa

Static analysis of Biological Regulatory Networks dynamics using abstract interpretation


The analysis of the dynamics of Biological Regulatory Networks (BRNs) requires innovative methods to cope with the state-space explosion. This paper settles an original approach for deciding reachability properties based on Process Hitting, which is a framework suitable for modelling dynamical complex systems. In particular, Process Hitting has been shown to be of interest in providing compact models of the dynamics of BRNs with discrete values. Process Hitting splits a finite number of processes into so-called sorts and describes the way each process is able to act upon (that is, to ‘hit’) another one (or itself) in order to ‘bounce’ it as another process of the same sort with further actions.

By using complementary abstract interpretations of the succession of actions in Process Hitting, we build a very efficient static analysis to over- and under-approximate reachability properties, which avoids the need to build the underlying states graph. The analysis is proved to have a low theoretical complexity, in particular when the number of processes per sorts is limited, while a very large number of sorts can be managed.

This makes such an approach very promising for the scalable analysis of abstract complex systems. We illustrate this through the analysis of a large BRN of 94 components. Our method replies quasi-instantaneously to reachability questions, while standard model-checking techniques regularly fail because of the combinatoric explosion of behaviours.

Linked references
Hide All

This list contains references from the content that can be linked to their source. For a full set of references and notes please see the PDF or HTML where available.

P. Alimonti , E. Feuerstein , L. Laura and U. Nanni (2011) Linear time analysis of properties of conflict-free and general petri nets. Theoretical Computer Science 412 (4–5) 320338.

J. Aracena (2008) Maximum number of fixed points in regulatory boolean networks. Bulletin of Mathematical Biology 70 (5) 13981409.

G. Bernot , F. Cassez , J.-P. Comet , F. Delaplace , C. Müller and O. Roux (2007) Semantics of biological regulatory networks. Electronic Notes in Theoretical Computer Science 180 (3) 314.

D. Brand and P. Zafiropulo (1983) On communicating finite-state machines. Journal of the ACM 30 323342.

E. M. Clarke and E. A. Emerson (1981) Design and synthesis of synchronization skeletons using branching-time temporal logic. In: D. Kozen (ed.) Logics of Programs. Springer-Verlag Lecture Notes in Computer Science 131 5271.

P. Cousot and R. Cousot (1992) Abstract interpretation frameworks. Journal of Logic and Computation 2 (4) 511547.

V. Danos , J. Feret , W. Fontana and J. Krivine (2008) Abstract interpretation of cellular signalling networks. In: F. Logozzo , D. Peled and L. Zuck (eds.) Verification, Model Checking, and Abstract Interpretation. Springer-Verlag Lecture Notes in Computer Science 4905 8397.

S. Klamt , J. Saez-Rodriguez , J. Lindquist , L. Simeoni and E. Gilles (2006) A methodology for the structural and functional analysis of signaling and regulatory networks. BMC Bioinformatics 7 (1) 56.

L. Paulevé , M. Magnin and O. Roux (2011a) Abstract Interpretation of Dynamics of Biological Regulatory Networks. In: Proceedings of The First International Workshop on Static Analysis and Systems Biology (SASB 2010). Electronic Notes in Theoretical Computer Science 272 4356.

L. Paulevé , M. Magnin and O. Roux (2011b) Refining dynamics of gene regulatory networks in a stochastic π-calculus framework. In: C. Priami , R.-J. Back , I. Petre and E. de Vink (eds.) Transactions on Computational Systems Biology XIII. Springer-Verlag Lecture Notes in Computer Science 6575 171191.

É. Remy , P. Ruet and D. Thieffry (2008) Graphic requirements for multistability and attractive cycles in a boolean dynamical framework. Advances in Applied Mathematics 41 (3) 335350.

A. Richard (2010) Negative circuits and sustained oscillations in asynchronous automata networks. Advances in Applied Mathematics 44 (4) 378392.

A. Richard and J.-P. Comet (2007) Necessary conditions for multistationarity in discrete dynamical systems. Discrete Applied Mathematics 155 (18) 24032413.

A. Richard , J.-P. Comet and G. Bernot (2006) Formal Methods for Modeling Biological Regulatory Networks. In: H. A. Gabbar (ed.) Modern Formal Methods and Applications, Springer-Verlag83122.

J. Saez-Rodriguez (2007) A logical model provides insights into t cell receptor signaling. PLoS Comput Biol 3 (8) e163.

R. Thomas (1973) Boolean formalization of genetic control circuits. Journal of Theoretical Biology 42 (3) 563585.

Recommend this journal

Email your librarian or administrator to recommend adding this journal to your organisation's collection.

Mathematical Structures in Computer Science
  • ISSN: 0960-1295
  • EISSN: 1469-8072
  • URL: /core/journals/mathematical-structures-in-computer-science
Please enter your name
Please enter a valid email address
Who would you like to send this to? *


Full text views

Total number of HTML views: 0
Total number of PDF views: 4 *
Loading metrics...

Abstract views

Total abstract views: 84 *
Loading metrics...

* Views captured on Cambridge Core between September 2016 - 29th May 2017. This data will be updated every 24 hours.