Algorithmic Algebraic Model Checking I: Challenges from Systems Biology

C. Piazza, M. Antoniotti, B. Mishra, V. Mysore, Franz Winkler, A. Policriti

Research output: Chapter in Book/Report/Conference proceedingConference proceedingspeer-review

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 DeltaNotch protein signaling system in biology.
Original languageEnglish
Title of host publicationProceedings Computer Aided Verification (CAV 2005)
Editors K.Etessami and S.K.Rajamani
PublisherSpringer
Pages5-19
Number of pages15
ISBN (Print)3-540-27231-3
Publication statusPublished - 2005

Publication series

NameLecture Notes in Computer Science (LNCS)

Fields of science

  • 101 Mathematics
  • 101001 Algebra
  • 101005 Computer algebra
  • 101009 Geometry
  • 101012 Combinatorics
  • 101013 Mathematical logic
  • 101020 Technical mathematics

Cite this