An algorithm for the formal reduction of differential equations as over-approximations
From MaRDI portal
Publication:6160777
Recommendations
Cites work
- scientific article; zbMATH DE number 4079233 (Why is no real title available?)
- scientific article; zbMATH DE number 1956619 (Why is no real title available?)
- Analysis of Kinetic Reaction Mechanisms
- Approximate Reduction of Heterogenous Nonlinear Models With Differential Hulls
- Biochemical systems theory: a review
- Bounds on the reachable sets of nonlinear control systems
- Computing reachable sets for uncertain nonlinear monotone systems
- Forward and backward bisimulations for chemical reaction networks
- Guaranteed Error Bounds on Approximate Model Abstractions Through Reachability Analysis
- Mean-field limits beyond ordinary differential equations
- Reachability of Uncertain Nonlinear Systems Using a Nonlinear Hybridization
- Symbolic computation of differential equivalences
- Syntactic Markovian bisimulation for chemical reaction networks
Cited in
(5)- scientific article; zbMATH DE number 1474958 (Why is no real title available?)
- Efficient syntax-driven lumping of differential equations
- Bridging Causal Reversibility and Time Reversibility: A Stochastic Process Algebraic Approach
- Recomputing causality assignments on lumped process models when adding new simplification assumptions
- Exact hierarchical reductions of dynamical models via linear transformations
This page was built for publication: An algorithm for the formal reduction of differential equations as over-approximations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6160777)