Algorithmic algebraic model checking. I: Challenges from systems biology
From MaRDI portal
Recommendations
Cited in
(24)- Hybrid systems: From verification to falsification by combining motion planning and discrete search
- Computing differential invariants of hybrid systems as fixed points
- Unwinding biological systems
- Generating invariants for non-linear hybrid systems
- Taylor approximation for hybrid systems
- Polynomial interrupt timed automata: verification and expressiveness
- Towards a hybrid dynamic logic for hybrid dynamic systems
- Analyzing oscillatory behavior with formal methods
- Computing Differential Invariants of Hybrid Systems as Fixedpoints
- Property Driven Three-Valued Model Checking on Hybrid Automata
- Automated symbolic reachability analysis; with application to Delta-Notch signaling automata
- Computational challenges in systems biology
- Approximated reachability on hybrid automata: falsification meets certification
- Computing reachable states for nonlinear biological models
- Design, optimization and predictions of a coupled model of the cell cycle, circadian clock, DNA repair system, irinotecan metabolism and exposure control under temporal logic constraints
- Hybrid Automata in Systems Biology: How Far Can We Go?
- Algorithmic global criteria for excluding oscillations
- Translating Time-Course Gene Expression Profiles into Semi-algebraic Hybrid Automata Via Dimensionality Reduction
- Algorithmic Algebraic Model Checking IV: Characterization of Metabolic Networks
- Symbolic Model Checking of Hybrid Systems Using Template Polyhedra
- Automated Technology for Verification and Analysis
- Discrete semantics for hybrid automata. Avoiding misleading assumptions in systems biology
- Hybrid automata, reachability, and systems biology
- Inclusion dynamics hybrid automata
This page was built for publication: Algorithmic algebraic model checking. I: Challenges from systems biology
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5716569)