Hybrid automata, reachability, and systems biology

DOI10.1016/j.tcs.2009.12.015zbMath1209.68294OpenAlexW2034963384MaRDI QIDQ969180

Carla Piazza, Dario Campagna

Publication date: 11 May 2010

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

Full work available at URL: https://doi.org/10.1016/j.tcs.2009.12.015

zbMATH Keywords

reachabilitysystems biologysemi-algebraic automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items

Deforming fluid domains within the finite element method: five mesh-based tracking methods in comparison

Uses Software

• QEPCAD
• Kronos
• HyTech
• RSOLVER
• Uppaal
• OCaml
• HSolver
• d/dt
• SAHA-Tool

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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
• Hybrid Automata in Systems Biology: How Far Can We Go?
• Automated Technology for Verification and Analysis
• Hybrid Systems: Computation and Control
• Computer Aided Verification