Algorithmic algebraic model checking I: Challenges from systems biology

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

Research output: Contribution to journalConference article

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.

Original languageEnglish (US)
Pages (from-to)5-19
Number of pages15
JournalLecture Notes in Computer Science
Volume3576
DOIs
StatePublished - 2005
Event17th International Conference on Computer Aided Verification, CAV 2005 - Edinburgh, Scotland, United Kingdom
Duration: Jul 6 2005Jul 10 2005

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Algorithmic algebraic model checking I: Challenges from systems biology'. Together they form a unique fingerprint.

  • Cite this