Abstract
We consider model checking of Qualitative Networks, a popular formalism for modeling signal transduction networks in biology. One of the unique features of qualitative networks, due to them lacking initial states, is that of “reducing reachability sets”. Simply put, a state that is not visited after i steps will not be visited after i′ steps for every i′ > i. We use this feature to create a compact representation of all the paths of a qualitative network of a certain structure. Combining this compact path representation with LTL model checking leads to significant acceleration in performance. In particular, for a recent model of Leukemia, our approach works at least 5 times faster than the standard approach and up to 100 times faster in some cases. Our approach enhances the iterative hypothesis-driven experimentation process used by biologists, enabling fast turn-around of executable biological models.
Chapter PDF
Similar content being viewed by others
Keywords
These 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.
References
Batt, G., Ropers, D., de Jong, H., Geiselmann, J., Mateescu, R., Page, M., Schneider, D.: Validation of qualitative models of genetic regulatory networks by model checking: analysis of the nutritional stress response in escherichia coli. Bioinformatics 21(suppl. 1), i19–i28 (2005)
Benque, D., Bourton, S., Cockerton, C., Cook, B., Fisher, J., Ishtiaq, S., Piterman, N., Taylor, A., Vardi, M.Y.: BMA: Visual tool for modeling and analyzing biological networks. In: Madhusudan, P., Seshia, S.A. (eds.) CAV 2012. LNCS, vol. 7358, pp. 686–692. Springer, Heidelberg (2012)
Beyer, A., Thomason, P., Li, X., Scott, J., Fisher, J.: Mechanistic insights into metabolic disturbance during type-2 diabetes and obesity using qualitative networks. T. Comp. Sys. Biology 12, 146–162 (2010)
Bonzanni, N., Krepska, E., Feenstra, K.A., Fokkink, W., Kielmann, T., Bal, H., Heringa, J.: Executing multicellular differentiation: Quantitative predictive modelling of C.elegans vulval development. Bioinformatics 25(16), 2049–2056 (2009)
Chabrier-Rivier, N., Chiaverini, M., Danos, V., Fages, F.: Modeling and querying biomolecular interaction networks. Th. Comp. Sci. 325(1), 25–44 (2004)
Claessen, K., Fisher, J., Ishtiaq, S., Piterman, N., Qinsi, W.: Model-checking signal transduction networks through decreasing reachbility sets. Technical Report MSR-TR-2013-30, Microsoft Research (2013)
Clarke, E., Biere, A., Raimi, R., Zhu, Y.: Bounded model checking using satisfiability solving. Formal Methods in System Design 19(1), 7–34 (2001)
Cook, B., Fisher, J., Krepska, E., Piterman, N.: Proving stabilization of biological systems. In: Jhala, R., Schmidt, D. (eds.) VMCAI 2011. LNCS, vol. 6538, pp. 134–149. Springer, Heidelberg (2011)
Dill, D., Knapp, M., Gage, P., Talcott, C., Laderoute, K., Lincoln, P.: The pathalyzer: a tool for analysis of signal transduction pathways. In: 1st Annual Recomb Satellite Workshop on Systems Biology (2005)
Espinosa-Sotoa, C., Padilla-Longoriab, P., Alvarez-Buyllaa, E.: A gene regulatory network model for cell-fate determination during arabidopsis thaliana flower development that is robust and recovers experimental gene expression profiles. The Plant Cell 16(11), 2923–2939 (2004)
Fisher, J., Henzinger, T.: Executable cell biology. Nature Biotechnology 25(11), 1239–1249 (2007)
Fisher, J., Piterman, N., Hajnal, A., Henzinger, T.: Predictive modeling of signaling crosstalk during c. elegans vulval development. PLoS Computational Biology 3(5), e92 (2007)
Heath, J.: The equivalence between biology and computation. In: Degano, P., Gorrieri, R. (eds.) CMSB 2009. LNCS, vol. 5688, pp. 18–25. Springer, Heidelberg (2009)
Heath, J., Kwiatkowska, M., Norman, G., Parker, D., Tymchyshyn, O.: Probabilistic model checking of complex biological pathways. In: Priami, C. (ed.) CMSB 2006. LNCS (LNBI), vol. 4210, pp. 32–47. Springer, Heidelberg (2006)
Li, F., Long, T., Lu, Y., Ouyand, Q., Tang, C.: The yeast cell-cycle network is robustly designed. Proc. Natl. Acad. Sci. U S A 101(14), 4781–4786 (2004)
Naldi, A., Thieffry, D., Chaouiya, C.: Decision diagrams for the representation and analysis of logical models of genetic networks. In: Calder, M., Gilmore, S. (eds.) CMSB 2007. LNCS (LNBI), vol. 4695, pp. 233–247. Springer, Heidelberg (2007)
Pnueli, A., Zaks, A.: On the merits of temporal testers. In: Grumberg, O., Veith, H. (eds.) 25MC Festschrift. LNCS, vol. 5000, pp. 172–195. Springer, Heidelberg (2008)
Ray, S., Brayton, R.: Proving stabilization using liveness to safety conversion. In: 20th International Workshop on Logic and Synthesis (2011)
Samal, A., Jain, S.: The regulatory network of e. coli metabolism as a boolean dynamical system exhibits both homeostasis and flexibility of response. BMC Systems Biology 2(1), 21 (2008)
Sanchez, L., Thieffry, D.: Segmenting the fly embryo: a logical analysis fo the pair-rule cross-regulatory module. Journal of Theoretical Biology 244, 517–537 (2003)
Schaub, M., Henzinger, T., Fisher, J.: Qualitative networks: A symbolic approach to analyze biological signaling networks. BMC Systems Biology 1(4) (2007)
Shmulevitch, I., Dougherty, R., Kim, S., Zhang, W.: Probabilistic boolean networks: A rule-based uncertainty model for gene regulatory networks. Bioinformatics 18(2), 261–274 (2002)
Thomas, R., Thieffry, D., Kaufman, M.: Dynamical behaviour of biological regulatory networks—i. biological role of feedback loops and practical use of the concept of the loop-characteristic state. Bull. of Math. Bio. 55(2), 247–276 (1995)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Claessen, K., Fisher, J., Ishtiaq, S., Piterman, N., Wang, Q. (2013). Model-Checking Signal Transduction Networks through Decreasing Reachability Sets. In: Sharygina, N., Veith, H. (eds) Computer Aided Verification. CAV 2013. Lecture Notes in Computer Science, vol 8044. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-39799-8_5
Download citation
DOI: https://doi.org/10.1007/978-3-642-39799-8_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-39798-1
Online ISBN: 978-3-642-39799-8
eBook Packages: Computer ScienceComputer Science (R0)