Related Experiment Video
Updated: Feb 27, 2026

A Web Tool for Generating High Quality Machine-readable Biological Pathways
Published on: February 8, 2017
Formal reasoning about systems biology using theorem proving
Adnan Rashid1, Osman Hasan1, Umair Siddique2
1School of Electrical Engineering and Computer Science, National University of Sciences and Technology, Islamabad, Pakistan.
Abstract:
System biology provides the basis to understand the behavioral properties of complex biological organisms at different levels of abstraction. Traditionally, analysing systems biology based models of various diseases have been carried out by paper-and-pencil based proofs and simulations. However, these methods cannot provide an accurate analysis, which is a serious drawback for the safety-critical domain of human medicine. In order to overcome these limitations, we propose a framework to formally analyze biological networks and pathways. In particular, we formalize the notion of reaction kinetics in higher-order logic and formally verify some of the commonly used reaction based models of biological networks using the HOL Light theorem prover. Furthermore, we have ported our earlier formalization of Zsyntax, i.e., a deductive language for reasoning about biological networks and pathways, from HOL4 to the HOL Light theorem prover to make it compatible with the above-mentioned formalization of reaction kinetics. To illustrate the usefulness of the proposed framework, we present the formal analysis of three case studies, i.e., the pathway leading to TP53 Phosphorylation, the pathway leading to the death of cancer stem cells and the tumor growth based on cancer stem cells, which is used for the prognosis and future drug designs to treat cancer patients.
More Related Videos
Related Concept Videos
Relation between Mathematical Equations and Block Diagrams
Deductive Reasoning
For example, a researcher can deduce specific predictions...
Theorems of Pappus and Guldinus: Problem Solving
Fundamental Theorem of Calculus I: Problem Solving
SFG Algebra
Each node in an SFG corresponds to a variable, and the interactions between nodes are represented by branches with associated gains. When multiple branches lead into a node, the value at that node is the sum of the...
Mathematical Modeling: Problem Solving

