Formal lumping of polynomial differential equations through approximate equivalences
From MaRDI portal
Publication:6113017
DOI10.1016/j.jlamp.2023.100876MaRDI QIDQ6113017
Giuseppe Squillace, Andrea Vandin, Max Tschaikowski, Mirco Tribastone, Luca Cardelli
Publication date: 8 August 2023
Published in: Journal of Logical and Algebraic Methods in Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jlamp.2023.100876
68-XX: Computer science
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Tackling continuous state-space explosion in a Markovian process algebra
- Model-order reduction of ion channel dynamics using approximate bisimulation
- Quadratic programming with one negative eigenvalue is NP-hard
- Mathematical biology. Vol. 1: An introduction.
- Guaranteed error bounds for structured complexity reduction of biochemical networks
- A unified framework for differential aggregations in Markovian process algebra
- Efficient syntax-driven lumping of differential equations
- Methods of model reduction for large-scale biological systems: a survey of current methods and trends
- Exact Fluid Lumpability for Markovian Process Algebra
- Approximate Reduction of Heterogenous Nonlinear Models With Differential Hulls
- Reachable set computation for uncertain time-varying linear systems
- Reachability analysis of nonlinear systems using conservative polynomialization and non-convex sets
- Algebra, Coalgebra, and Minimization in Polynomial Differential Equations
- Optimal partition and effective dynamics of complex networks
- Systematic Simulation Using Sensitivity Analysis
- Three Partition Refinement Algorithms
- The polynomial solvability of convex quadratic programming
- PID Control of Biochemical Reaction Networks
- Syntactic Markovian Bisimulation for Chemical Reaction Networks
- Forward and Backward Bisimulations for Chemical Reaction Networks
- Approximation of Large-Scale Dynamical Systems
- Formal Reduction for Rule-based Models
- Symbolic computation of differential equivalences
- Symbolic computation of differential equivalences
- Guaranteed Error Bounds on Approximate Model Abstractions Through Reachability Analysis
