Formal lumping of polynomial differential equations through approximate equivalences

• Published in: Journal of logical and algebraic methods in programming Vol. 134; p. 100876
• Main Authors: Cardelli, Luca, Squillace, Giuseppe, Tribastone, Mirco, Tschaikowski, Max, Vandin, Andrea
• Format: Journal Article
• Language: English
• Published: Elsevier Inc 01.08.2023
• Subjects: Equivalence relations; Lumping; Model reduction; Polynomial differential equations; Lumping; Model reduction; Polynomial differential equations; Equivalence relations
• ISSN: 2352-2208
• DOI: 10.1016/j.jlamp.2023.100876

It is well known that exact notions of model abstraction and reduction for dynamical systems may not be robust enough in practice because they are highly sensitive to the specific choice of parameters. In this paper we consider this problem for nonlinear ordinary differential equations (ODEs) with polynomial derivatives. We introduce a model reduction technique based on approximate differential equivalence, i.e., a partition of the set of ODE variables that performs an aggregation when the variables are governed by nearby derivatives. We develop algorithms to (i) compute the largest approximate differential equivalence; (ii) construct an approximately reduced model from the original one via an appropriate perturbation of the coefficients of the polynomials; and (iii) provide a formal certificate on the quality of the approximation as an error bound, computed as an over-approximation of the reachable set of the reduced model. Finally, we apply approximate differential equivalences to case studies on electric circuits, biological models, and polymerization reaction networks.