Advertisement

Core Formal Molecular Biology

  • Vincent Danos
  • Cosimo Laneve
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2618)

Abstract

A core modeling language for Molecular Biology is introduced, where two simple forms of interaction are considered, complexation and activation. This core language is equipped with two sensible bisimulation-based equivalences, and it is shown that interactions involving complex reactants are superfluous up to these notions. Strong compilations in π-calculus are given, following Regev’s principle of translating physical connection as private name sharing.

Keywords

Complex Reactant Operational Semantic Process Algebra Extensional Semantic Core Language 
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

  1. 1.
    Roberto Amadio, Ilaria Castellani, and Davide Sangiorgi. On bisimulations for the asynchronous π-calculus. Theoretical Computer Science, 195(2):291–324, 1998.zbMATHCrossRefMathSciNetGoogle Scholar
  2. 2.
    Marc Chiaverini and Vincent Danos. A formalism for Kohn’s molecular map. In Proceedings of International Workshop on Computational Methods in Systems Biology, LNCS. Springer-Verlag, 2003.Google Scholar
  3. 3.
    E. M. Clarke, E. Allen Emerson, and A. P. Sistla. Automatic verification of finite state concurrent systems using temporal logic specifications: A practical approach. ACM Transactions on Programming Languages and Systems, 8(2):244–263, 1986.zbMATHCrossRefGoogle Scholar
  4. 4.
    Edmund M. Clarke, Orna Grumberg, and Doron A. Peled. Model Checking. The MIT Press, Cambridge, Massachusetts, 1999.Google Scholar
  5. 5.
    Vincent Danos and Cosimo Laneve. Graphs for formal molecular biology. In Proceedings of International Workshop on Computational Methods in Systems Biology, LNCS. Springer-Verlag, 2003.Google Scholar
  6. 6.
    Steven Eker, Merrill Knapp, Keith Laderoute, Patrick Lincoln, José Meseguer, and Kemal Sonmez. Pathway logic: Symbolic analysis of biological signaling. In Proceedings of the Pacific Symposium on Biocomputing, pages 400–412, January 2002. To appear.Google Scholar
  7. 7.
    Cédric Fournet and Georges Gonthier. The reflexive chemical abstract machine and the join-calculus. In 23rd ACM Symposium on Principles of Programming Languages (POPL’96), 1996.Google Scholar
  8. 8.
    Ronojoy Ghosh and Claire J. Tomlin. Lateral inhibition through delta-notch signaling: A piecewise affine hybrid model? In Proceedings of HSCC 2001, volume 2034 of LNCS, pages 232–246. Springer, 2001.Google Scholar
  9. 9.
    Matthew Hennessy and Robin Milner. Algebraic laws for nondeterminism and concurrency. Journal of the ACM (JACM), 32(1):137–161, 1985.zbMATHCrossRefMathSciNetGoogle Scholar
  10. 10.
    Kurt W. Kohn. Molecular interaction map of the mammalian cell cycle control and DNA repair systems. Molecular Biology of the Cell, n. 10:2703–2734, 1999.Google Scholar
  11. 11.
    Ron Maimon and Sam Browning. Diagrammatic notation and computational structure of gene networks. In Proceedings of the 2nd International Conference on Systems Biology, 2001.Google Scholar
  12. 12.
    Robin Milner and Davide Sangiorgi. Barbed bisimulation. In W. Kuich, editor, Nineteenth Colloquium on Automata, Languages and Programming (ICALP) (Wien, Austria), volume 623 of LNCS, pages 685–695. Springer, 1992.Google Scholar
  13. 13.
    Masao Nagasaki, Shuichi Onami, Satoru Miyano, and Hiroaki Kitano. Bio-calculus: Its concept and molecular interaction. Genome Informatics, 10:133–143, 1999.Google Scholar
  14. 14.
    C. Priami, A. Regev, E. Shapiro, and W. Silverman. Application of a stochastic name-passing calculus to representation and simulation of molecular processes. Information Processing Letters, 80:25–31, 2001.zbMATHCrossRefMathSciNetGoogle Scholar
  15. 15.
    A. Regev and E. Shapiro. Cells as computation. Nature, 419, September 2002.Google Scholar
  16. 16.
    A. Regev, W. Silverman, and E. Shapiro. Representation and simulation of biochemical processes using the π-calculus process algebra. In R. B. Altman, A. K. Dunker, L. Hunter, and T. E. Klein, editors, Pacific Symposium on Biocomputing, volume 6, pages 459–470, Singapore, 2001. World Scientific Press.Google Scholar
  17. 17.
    Birgit Schoeberl, Claudia Eichler-Jonsson, Ernst-Dieter Gilles, and Gertraud Müller. Computational modeling of the dynamics of the map kinase cascade activated by surface and internalized EGF receptors. Nature Biotechnology, 20:370–375, 2002.CrossRefGoogle Scholar
  18. 18.
    D. Thieffry and R. Thomas. Qualitative analysis of gene networks. In R. B. Altman, A. K. Dunker, L. Hunter, and T. E. Klein, editors, Pacific Symposium on Biocomputing, volume 3, pages 77–88, Singapore, 1998. World Scientific Press.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Vincent Danos
    • 1
  • Cosimo Laneve
    • 2
  1. 1.Équipe PPSUniversity Paris 7& CNRSFrance
  2. 2.Department of Computer ScienceUniversity of BolognaFrance

Personalised recommendations