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

DOI10.1016/j.entcs.2009.02.007zbMath1283.92035OpenAlexW2052442815MaRDI QIDQ5404076

Dario Campagna, Carla Piazza

Publication date: 21 March 2014

Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.entcs.2009.02.007

zbMATH Keywords

reachabilityhybrid automatasemi-algebraic first-order formulæ

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Systems biology, networks (92C42)

Related Items

Model Checking of Biological Systems ⋮ Biochemical systems theory: a review ⋮ Hybrid automata, reachability, and systems biology

Uses Software

• QEPCAD
• Kronos
• HyTech
• REDLOG
• RSOLVER
• Uppaal
• d/dt

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The algorithmic analysis of hybrid systems
• Modeling biological systems in stochastic concurrent constraint programming
• On the computational complexity and geometry of the first-order theory of the reals. III: Quantifier elimination
• Counting connected components of a semialgebraic set in subexponential time
• A theory of timed automata
• HyTech: A model checker for hybrid systems
• O-minimal hybrid systems.
• Taylor approximation for hybrid systems
• QEPCAD B
• Efficient solving of quantified inequality constraints over the real numbers
• Automated Technology for Verification and Analysis
• Computer Aided Verification

This page was built for publication: Hybrid Automata in Systems Biology: How Far Can We Go?