Abstract
Model checking is a technique to check whether programs and designs satisfy properties expressed in temporal logic. Such properties characterize sequences of events. In recent years, model checking has become a familiar tool in software and hardware industries. One of the main strengths of model checking is its ability to supply counter examples: in case that the property is not satisfied by the model we get an execution exhibiting this failure. Counter examples are fundamental in understanding, localizing, and eventually fixing, faults. This, together with the relative ease of use of model checking, led to its adoption. The success of model checking prompted system biologists to harness it to their needs. In this domain, the main usage is to have a model representing a certain biological phenomenon and to use model checking for one of two things. Either prove that the model satisfies a set of properties, i.e., reproduces a set of biological behaviors. Or to use model checking to extract interesting behaviors of the model by looking for a counter example to the property saying that this interesting behavior does not happen. In this chapter we present the technique of model checking and survey its usage in systems biology. We take quite a liberal interpretation of what is model checking and consider also cases where the techniques underlying model checking are used for similar purposes in systems biology.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Aziz A, Sanwal K, Singhal V, Brayton R (2000) Model-checking continuous-time markov chains. ACM Trans Comput Logic 1(1):162–170
Baier C, Katoen JP (2008) Principles of model checking. MIT Press, Cambridge
Barnat J, Brim L, Krejci A, Safranek D, Vejnar M, Vejpustek T (2012) On parameter synthesis by parallel model checking. IEEE/ACM Trans Comput Biol Bioinf 9(3):693–705
Batt G, Page M, Cantone I, Goessler G, Monteiro P, de Jong H (2010) Efficient parameter search for qualitative models of regulatory networks using symbolic model checking. Bioinformatics 26(18):i603–i610
Benque D, Bourton S, Cockerton C, Cook B, Fisher J, Ishtiaq S, Piterman N, Taylor A, Vardi M (2012) BMA: visual tool for modeling and analyzing biological networks. In: 24th international conference on computer aided verification. Lecture notes in computer science, vol. 7358. Springer, Berlin, pp 686–692
Bernot G, Comet JP, Richard A, Guespin J (2004) Application of formal methods to biological regulatory networks: extending thomas’ asynchronous logical approach with temporal logic. J Theor Biol 229(3):339–347
Biere A, Cimatti A, Clarke E, Fujita M, Zhu Y (1999) Symbolic model checking using SAT procedures instead of BDDs. In: Proceedings of 36th design automation conference, pp 317–320. IEEE Computer Society
Bryant R (1986) Graph-based algorithms for Boolean-function manipulation. IEEE Trans Comput C-35(8):677–691
Burch J, Clarke E, McMillan K, Dill D, Hwang L (1990) Symbolic model checking: \(10^{20}\) states and beyond. In: Proceedings of 5th IEEE symposium on logic in computer, science, pp 428–439
Calzone L, Fages F, Soliman S (2006) BIOCHAM: an environment for modeling biological systems and formalizing experimental knowledge. Bioinformatics 22(14):1805–1807
Chabrier N, Fages F (2003) Symbolic model checking of biochemical networks. In: Computational methods in systems biology. Lecture notes in computer science, vol 2602. Springer, Berlin, pp 149–162
Chabrier-Rivier N, Chiaverini M, Danos V, Fages F, Schächter V (2004) Modeling and querying biomolecular interaction networks. Theor Comput Sci 325(1):25–44
Ciocchetta F, Hillston J (2009) Bio-PEPA: a framework for the modelling and analysis of biological systems. Theor Comput Sci 410(33–34):3065–3084
Clarke E, Emerson E (1981) Design and synthesis of synchronization skeletons using branching time temporal logic. In: Proceedings of workshop on logic of programs. Lecture notes in computer science, vol 131. Springer, Berlin, pp 52–71
Clarke E, Grumberg O, Peled D (1999) Model checking. MIT Press, Cambridge
Cook B, Fisher J, Krepska E, Piterman N (2011) Proving stabilization of biological systems. In: Verification, model checking, and abstract interpretation. Lecture notes in computer science, vol 6538. Springer, Berlin, pp 134–149
Eén N, Sörensson N (2004) An extensible sat-solver. In: 6th international conference on theory and applications of satisfiability testing. Lecture notes in computer science, vol 2919. Springer, Berlin, pp 502–518
Eker S, Knapp M, Laderoute K, Lincoln P, Meseguer J, Sönmez M (2002) Pathway logic: symbolic analysis of biological signaling. In: Pacific symposium on biocomputing, pp 400–412
Fisher J, Henzinger T (2007) Executable cell biology. Nat Biotechnol 25(11):1239–1249
Fisher J, Piterman N, Hajnal A, Henzinger T (2007) Predictive modeling of signaling crosstalk during c. elegans vulval development. PLoS Comput Biol 3(5):e92
Guerriero M (2009) Qualitative and quantitative analysis of a Bio-PEPA model of the gp130/JAK/STAT signalling pathway. Trans Comput Syst Biol XI 5750:90–115
Heath J, Kwiatkowska M, Norman G, Parker D, Tymchyshyn O (2008) Probabilistic model checking of complex biological pathways. Theor Comput Sci 391(3):239–257
Kroening D, Strichman O (2008) Decision procedures: an algorithmic point of view. Springer, Berlin
Kwiatkowska M, Heath J (2009) Biological pathways as communicating computer systems. J Cell Sci 122:2793–2800
Kwiatkowska M, Norman G, Parker D (2007) Stochastic model checking. In: 7th international school on formal methods for the design of computer, communication, and software systems. Lecture notes in computer science, vol 4486. Springer, pp 220–270
Kwiatkowska M, Norman G, Parker D (2008) Using probabilistic model checking in systems biology. SIGMETRICS Perform Eval Rev 35(4):14–21
Moskewicz M, Madigan C, Zhao Y, Zhang L, Malik S (2001) Chaff: engineering an efficient sat solver. In: Proceedings of the 38th design automation conference, pp 530–535. ACM
de Moura L, Bjørner N (2008) Z3: an efficient smt solver. In: 14th international conference tools and algorithms for the construction and analysis of systems. Lecture notes in computer science, vol 4963. Springer, Berlin, pp 337–340
Pnueli A (1977) The temporal logic of programs. In: Proceedings of 18th IEEE symposium on foundations of computer science. IEEE Press, Piscataway, pp 46–57
Priami C, Regev A, Shapiro E, Silverman W (2001) Application of a stochastic name-passing calculus to representation and simulation of molecular processes. Inf Process Lett 80(1):25–31
Robinson A, Voronkov A (eds) (2001) Handbook of automated reasoning. Elsevier, Amsterdam
Schaub M, Henzinger T, Fisher J (2007) Qualitative networks: a symbolic approach to analyze biological signaling networks. BMC Syst Biol 1(1):4
Talcott C (2008) Pathway logic. In: Formal methods for computational systems biology. Lecture notes in computer science, vol 5016. Springer, Berlin, pp 21–53
Thomas R, Thieffry D, Kaufman M (1999) Dynamical behaviour of biological regulatory networks–I. biological role of feedback loops and practical use of the concept of the loop-characteristic state. Bull Math Biol 55(2):247–276
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
Fisher, J., Piterman, N. (2014). Model Checking in Biology. In: Kulkarni, V., Stan, GB., Raman, K. (eds) A Systems Theoretic Approach to Systems and Synthetic Biology I: Models and System Characterizations. Springer, Dordrecht. https://doi.org/10.1007/978-94-017-9041-3_10
Download citation
DOI: https://doi.org/10.1007/978-94-017-9041-3_10
Published:
Publisher Name: Springer, Dordrecht
Print ISBN: 978-94-017-9040-6
Online ISBN: 978-94-017-9041-3
eBook Packages: Biomedical and Life SciencesBiomedical and Life Sciences (R0)