Temporal logic constraints in the biochemical abstract machine BIOCHAM

  • Authors:
  • François Fages

  • Affiliations:
  • INRIA Rocquencourt, France

  • Venue:
  • LOPSTR'05 Proceedings of the 15th international conference on Logic Based Program Synthesis and Transformation
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

Recent progress in Biology and data-production technologies push research toward a new interdisciplinary field, named Systems Biology, where the challenge is to break the complexity walls for reasoning about large biomolecular interaction systems. Pioneered by Regev, Silverman and Shapiro, the application of process calculi to the description of biological processes has been a source of inspiration for many researchers coming from the programming language community. In this presentation, we give an overview of the Biochemical Abstract Machine (BIOCHAM), in which biochemical systems are modeled using a simple language of reaction rules, and the biological properties of the system, known from experiments, are formalized in temporal logic. In this setting, the biological validation of a model can be done by model-checking, both qualitatively and quantitatively. Moreover, the temporal properties can be turned into specifications for learning modifications or refinements of the model, when incorporating new biological knowledge.