Hybrid Automata in Systems Biology: How Far Can We Go?
From MaRDI portal
Publication:5404076
DOI10.1016/J.ENTCS.2009.02.007zbMATH Open1283.92035OpenAlexW2052442815MaRDI QIDQ5404076FDOQ5404076
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
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
- HyTech: A model checker for hybrid systems
- QEPCAD B
- A theory of timed automata
- O-minimal hybrid systems.
- Title not available (Why is that?)
- Modeling biological systems in stochastic concurrent constraint programming
- The algorithmic analysis of hybrid systems
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the computational complexity and geometry of the first-order theory of the reals. III: Quantifier elimination
- Title not available (Why is that?)
- Title not available (Why is that?)
- Efficient solving of quantified inequality constraints over the real numbers
- Algorithmic algebraic model checking. III: Approximate methods
- Title not available (Why is that?)
- Title not available (Why is that?)
- Counting connected components of a semialgebraic set in subexponential time
- Title not available (Why is that?)
- Computer Aided Verification
- Title not available (Why is that?)
- Automated Technology for Verification and Analysis
- Taylor approximation for hybrid systems
- Title not available (Why is that?)
Cited In (12)
- Computer Aided Verification
- Taming the complexity of biochemical models through bisimulation and collapsing: theory and practice
- 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
- Hybrid Systems: Computation and Control
- Biochemical systems theory: a review
- Discrete semantics for hybrid automata. Avoiding misleading assumptions in systems biology
- MARCO: A Reachability Algorithm for Multi-affine Systems with Applications to Biological Systems
- Approximated reachability on hybrid automata: falsification meets certification
- Model checking of biological systems
- Translating Time-Course Gene Expression Profiles into Semi-algebraic Hybrid Automata Via Dimensionality Reduction
- Title not available (Why is that?)
- Hybrid automata, reachability, and systems biology
Uses Software
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)
