Advertisement

Local Traces: An Over-Approximation of the Behaviour of the Proteins in Rule-Based Models

Conference paper
  • 686 Downloads
Part of the Lecture Notes in Computer Science book series (LNCS, volume 9859)

Abstract

Thanks to rule-based modelling languages, we can assemble large sets of mechanistic protein-protein interactions within integrated models. Our goal would be to understand how the behaviour of these systems emerges from these low-level interactions. Yet this is a quite long term challenge and it is desirable to offer intermediary levels of abstraction, so as to get a better understanding of the models and to increase our confidence within our mechanistic assumptions.

In this paper, we propose an abstract interpretation of the behaviour of each protein, in isolation. Given a model written in Kappa, this abstraction computes for each kind of protein a transition system that describes which conformations this protein can take and how a protein can pass from one conformation to another one. Then, we use simplicial complexes to abstract away the interleaving order of the transformations between conformations that commute. As a result, we get a compact summary of the potential behaviour of each protein of the model.

Keywords

Transition System Simplicial Complex Local Transition Agent Type Concurrent System 
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.

Notes

Acknowledgement

This work has been motivated by models written by Héctor Medina, and by Nathalie Théret and Jean Cocquet. We deeply thank them, as well as Pierre Boutillier, Ioana Cristescu, Vincent Danos, Walter Fontana, Russ Harmer, Jean Krivine, Jonathan Laurent, and Jean Yang, for fruitful discussions.

References

  1. 1.
    Boutillier, P., Feret, J., Krivine, J., Kim Lý, Q.: Kasim development homepage. http://kappalanguage.org
  2. 2.
    Chatain, T., Haar, S., Jezequel, L., Paulevé, L., Schwoon, S.: Characterization of reachable attractors using petri net unfoldings. In: Mendes, P., Dada, J.O., Smallbone, K. (eds.) CMSB 2014. LNCS, vol. 8859, pp. 129–142. Springer, Heidelberg (2014)Google Scholar
  3. 3.
    Cousot, P., Cousot, R.: Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints. In: Proceedings of POPL 1977 (1977)Google Scholar
  4. 4.
    Cousot, P., Cousot, R.: Systematic design of program analysis framework. In: Proceedings of POPL 1979 (1979)Google Scholar
  5. 5.
    Danos, V., Feret, J., Fontana, W., Harmer, R., Hayman, J., Krivine, J., Thompson-Walsh, C.D., Winskel, G.: Graphs, rewriting and pathway reconstruction for rule-based models. In: Proceedings of FSTTCS 2012. LIPIcs, vol. 18 (2012)Google Scholar
  6. 6.
    Danos, V., Feret, J., Fontana, W., Krivine, J.: Abstract interpretation of cellular signalling networks. In: Logozzo, F., Peled, D.A., Zuck, L.D. (eds.) VMCAI 2008. LNCS, vol. 4905, pp. 83–97. Springer, Heidelberg (2008)CrossRefGoogle Scholar
  7. 7.
    Danos, V., Laneve, C.: Formal molecular biology. TCS 325(1), 69–110 (2004)MathSciNetCrossRefzbMATHGoogle Scholar
  8. 8.
    Fajstrup, L., Goubault, É., Raußen, M.: Detecting deadlocks in concurrent systems. In: Sangiorgi, D., de Simone, R. (eds.) CONCUR 1998. LNCS, vol. 1466, pp. 332–347. Springer, Heidelberg (1998)CrossRefGoogle Scholar
  9. 9.
    Feret, J.: Reachability analysis of biological signalling pathways by abstract interpretation. In: Proceedings of ICCMSE 2007, vol. 963(2). AIP (2007)Google Scholar
  10. 10.
    Godefroid, P. (ed.): Partial-Order Methods for the Verification of Concurrent Systems. LNCS, vol. 1032. Springer, Heidelberg (1996)zbMATHGoogle Scholar
  11. 11.
    Laurent, J.: Causal analysis of rule-based models of signaling pathways (2015)Google Scholar
  12. 12.
    Tarski, A.: A lattice-theoretical fixpoint theorem and its applications. Pacific J. Math. 5(2), 285–309 (1955)MathSciNetCrossRefzbMATHGoogle Scholar
  13. 13.
    Winskel, G.: Event structures. In: Brauer, W., Reisig, W., Rozenberg, G. (eds.) Advances in Petri Nets 1986. LNCS, vol. 255, pp. 325–392. Springer, Heidelberg (1987)Google Scholar
  14. 14.
    You, J.: Darpa sets out to automate research. Science 347, 465 (2015)CrossRefGoogle Scholar

Copyright information

© Springer International Publishing AG 2016

Authors and Affiliations

  1. 1.DI-ENS (INRIA/ÉNS/CNRS/PSL)ParisFrance

Personalised recommendations