Algorithmic algebraic model checking I: Challenges from systems biology

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

Research output: Chapter in Book/Report/Conference proceedingConference contribution

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)
Title of host publicationLecture Notes in Computer Science
EditorsK. Etessami, S.K. Rajamani
Pages5-19
Number of pages15
Volume3576
StatePublished - 2005
Event17th International Conference on Computer Aided Verification, CAV 2005 - Edinburgh, Scotland, United Kingdom
Duration: Jul 6 2005Jul 10 2005

Other

Other17th International Conference on Computer Aided Verification, CAV 2005
CountryUnited Kingdom
CityEdinburgh, Scotland
Period7/6/057/10/05

Fingerprint

Model checking
Algebra
Polynomials
Decomposition
Proteins
Systems Biology

ASJC Scopus subject areas

  • Computer Science (miscellaneous)

Cite this

Piazza, C., Antoniotti, M., Mysore, V., Policriti, A., Winkler, F., & Mishra, B. (2005). Algorithmic algebraic model checking I: Challenges from systems biology. In K. Etessami, & S. K. Rajamani (Eds.), Lecture Notes in Computer Science (Vol. 3576, pp. 5-19)

Algorithmic algebraic model checking I : Challenges from systems biology. / Piazza, C.; Antoniotti, M.; Mysore, V.; Policriti, A.; Winkler, F.; Mishra, Bhubaneswar.

Lecture Notes in Computer Science. ed. / K. Etessami; S.K. Rajamani. Vol. 3576 2005. p. 5-19.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Piazza, C, Antoniotti, M, Mysore, V, Policriti, A, Winkler, F & Mishra, B 2005, Algorithmic algebraic model checking I: Challenges from systems biology. in K Etessami & SK Rajamani (eds), Lecture Notes in Computer Science. vol. 3576, pp. 5-19, 17th International Conference on Computer Aided Verification, CAV 2005, Edinburgh, Scotland, United Kingdom, 7/6/05.
Piazza C, Antoniotti M, Mysore V, Policriti A, Winkler F, Mishra B. Algorithmic algebraic model checking I: Challenges from systems biology. In Etessami K, Rajamani SK, editors, Lecture Notes in Computer Science. Vol. 3576. 2005. p. 5-19
Piazza, C. ; Antoniotti, M. ; Mysore, V. ; Policriti, A. ; Winkler, F. ; Mishra, Bhubaneswar. / Algorithmic algebraic model checking I : Challenges from systems biology. Lecture Notes in Computer Science. editor / K. Etessami ; S.K. Rajamani. Vol. 3576 2005. pp. 5-19
@inproceedings{a7ad532baa1f48d08ce0b38ad89a9e9f,
title = "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.",
author = "C. Piazza and M. Antoniotti and V. Mysore and A. Policriti and F. Winkler and Bhubaneswar Mishra",
year = "2005",
language = "English (US)",
volume = "3576",
pages = "5--19",
editor = "K. Etessami and S.K. Rajamani",
booktitle = "Lecture Notes in Computer Science",

}

TY - GEN

T1 - Algorithmic algebraic model checking I

T2 - Challenges from systems biology

AU - Piazza, C.

AU - Antoniotti, M.

AU - Mysore, V.

AU - Policriti, A.

AU - Winkler, F.

AU - Mishra, Bhubaneswar

PY - 2005

Y1 - 2005

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=26444525313&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=26444525313&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:26444525313

VL - 3576

SP - 5

EP - 19

BT - Lecture Notes in Computer Science

A2 - Etessami, K.

A2 - Rajamani, S.K.

ER -