Hybrid Automata in Systems Biology: How Far Can We Go? | Zendy

Dario Campagna | Zendy; Carla Piazza | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Hybrid Automata in Systems Biology: How Far Can We Go?

Author(s) -

Dario Campagna,

Carla Piazza

Publication year - 2009

Publication title -

electronic notes in theoretical computer science

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.242

H-Index - 60

ISSN - 1571-0661

DOI - 10.1016/j.entcs.2009.02.007

Subject(s) - reachability , satisfiability , computation , hybrid system , computer science , simple (philosophy) , automaton , algebraic number , reachability problem , theoretical computer science , hybrid automaton , mathematical optimization , mathematics , algorithm , mathematical analysis , philosophy , epistemology , machine learning

We consider the reachability problem on semi-algebraic hybrid automata. In particular, we deal with the effective cost that has to be afforded to solve reachability through first-order satisfiability.The analysis we perform with some existing tools shows that even simple examples cannot be efficiently solved. We need approximations to reduce the number of variables in our formulae: this is the main source of time computation growth. We study standard approximation methods based on Taylor polynomials and ad-hoc strategies to solve the problem and we show their effectiveness on the repressilator case study

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research