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

DOI10.1016/J.ENTCS.2009.02.007MaRDI QIDQ5404076zbMATHOpenAlexFDO

Authors 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

hybrid automatareachabilitysemi-algebraic first-order formulæ

Mathematics Subject Classification ID

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

Recommendations

• Hybrid automata, reachability, and systems biology
• Discrete semantics for hybrid automata. Avoiding misleading assumptions in systems biology
• scientific article; zbMATH DE number 4102873
• scientific article; zbMATH DE number 1950549
• Hybrid modeling for systems biology: theory and practice
• Transactions on Computational Systems Biology III
• Stochastic programs and hybrid automata for (biological) modeling
• A Hybrid Approach to Modeling Biological Systems

Cites work

• scientific article; zbMATH DE number 3497890 (Why is no real title available?)
• scientific article; zbMATH DE number 1263213 (Why is no real title available?)
• scientific article; zbMATH DE number 1303063 (Why is no real title available?)
• scientific article; zbMATH DE number 1956618 (Why is no real title available?)
• scientific article; zbMATH DE number 1956633 (Why is no real title available?)
• scientific article; zbMATH DE number 1794358 (Why is no real title available?)
• scientific article; zbMATH DE number 1905118 (Why is no real title available?)
• scientific article; zbMATH DE number 2090033 (Why is no real title available?)
• scientific article; zbMATH DE number 1444339 (Why is no real title available?)
• scientific article; zbMATH DE number 3068536 (Why is no real title available?)
• A theory of timed automata
• Algorithmic algebraic model checking. III: Approximate methods
• Automated Technology for Verification and Analysis
• Computer Aided Verification
• Counting connected components of a semialgebraic set in subexponential time
• Efficient solving of quantified inequality constraints over the real numbers
• HyTech: A model checker for hybrid systems
• Modeling biological systems in stochastic concurrent constraint programming
• O-minimal hybrid systems.
• On the computational complexity and geometry of the first-order theory of the reals. III: Quantifier elimination
• QEPCAD B
• Taylor approximation for hybrid systems
• The algorithmic analysis of hybrid systems

Cited in

(13)

• Application of the reachability analysis for the iron homeostasis study
• Special issue: Hybrid automata and oscillatory behavior in biological systems. Selected papers based on the presentations at the 2nd From biology to concurrency and back workshop (FBTC 2008), Reykjavik, Iceland, July 12, 2008
• scientific article; zbMATH DE number 1950549 (Why is no real title available?)
• Approximated reachability on hybrid automata: falsification meets certification
• Hybrid Systems: Computation and Control
• Hybrid automata, reachability, and systems biology
• Model checking of biological systems
• Taming the complexity of biochemical models through bisimulation and collapsing: theory and practice
• MARCO: A Reachability Algorithm for Multi-affine Systems with Applications to Biological Systems
• Translating Time-Course Gene Expression Profiles into Semi-algebraic Hybrid Automata Via Dimensionality Reduction
• Discrete semantics for hybrid automata. Avoiding misleading assumptions in systems biology
• Biochemical systems theory: a review
• Computer Aided Verification

Describes a project that uses

Uses Software

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5404076)