Algorithmic algebraic model checking I: Challenges from systems biology

Abstract

In this paper, we suggest a possible confluence of the theory of hybrid automata and the techniques of algorithmic algebra to create a computational basis for systems biology. We describe a method to compute bounded reachability by combining Taylor polynomials and cylindric algebraic decomposition algorithms. We discuss the power and limitations of the framework we propose and we suggest several possible extensions. We briefly show an application to the study of the Delta-Notch protein signaling system in biology. ©Springer-Verlag Berlin Heidelberg 2005.

Publication
Lecture Notes in Computer Science
Date
Links