Algorithmic algebraic model checking I: Challenges from systems biology

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

doi:10.1007/11513988_3

Algorithmic algebraic model checking I: Challenges from systems biology

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

Computer Science

Research output: Contribution to journal › Conference article › peer-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 Delta-Notch protein signaling system in biology.

Original language	English (US)
Pages (from-to)	5-19
Number of pages	15
Journal	Lecture Notes in Computer Science
Volume	3576
DOIs	https://doi.org/10.1007/11513988_3
State	Published - 2005
Event	17th International Conference on Computer Aided Verification, CAV 2005 - Edinburgh, Scotland, United Kingdom Duration: Jul 6 2005 → Jul 10 2005

ASJC Scopus subject areas

Theoretical Computer Science
Computer Science(all)

Access to Document

10.1007/11513988_3

Cite this

@article{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 B. Mishra",

year = "2005",

doi = "10.1007/11513988_3",

language = "English (US)",

volume = "3576",

pages = "5--19",

journal = "Lecture Notes in Computer Science",

issn = "0302-9743",

publisher = "Springer Verlag",

note = "17th International Conference on Computer Aided Verification, CAV 2005 ; Conference date: 06-07-2005 Through 10-07-2005",

}

TY - JOUR

T1 - Algorithmic algebraic model checking I

T2 - 17th International Conference on Computer Aided Verification, CAV 2005

AU - Piazza, C.

AU - Antoniotti, M.

AU - Mysore, V.

AU - Policriti, A.

AU - Winkler, F.

AU - Mishra, B.

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

U2 - 10.1007/11513988_3

DO - 10.1007/11513988_3

M3 - Conference article

AN - SCOPUS:26444525313

SN - 0302-9743

VL - 3576

SP - 5

EP - 19

JO - Lecture Notes in Computer Science

JF - Lecture Notes in Computer Science

Y2 - 6 July 2005 through 10 July 2005

ER -

Algorithmic algebraic model checking I: Challenges from systems biology

Abstract

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this